./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-divine/ring_1w1r-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 839c364b Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57ca2f2b-7a1b-4211-a914-b6836eaa190b/bin/utaipan-eEHZpOm5b7/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57ca2f2b-7a1b-4211-a914-b6836eaa190b/bin/utaipan-eEHZpOm5b7/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57ca2f2b-7a1b-4211-a914-b6836eaa190b/bin/utaipan-eEHZpOm5b7/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57ca2f2b-7a1b-4211-a914-b6836eaa190b/bin/utaipan-eEHZpOm5b7/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-divine/ring_1w1r-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57ca2f2b-7a1b-4211-a914-b6836eaa190b/bin/utaipan-eEHZpOm5b7/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57ca2f2b-7a1b-4211-a914-b6836eaa190b/bin/utaipan-eEHZpOm5b7 --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 b7e9feb6929ab81158cc9d6731414a71af210f92cb571da2954e02689fee6d2b --- Real Ultimate output --- This is Ultimate 0.2.2-hotfix-svcomp22-839c364 [2021-11-25 18:43:12,200 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-25 18:43:12,202 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-25 18:43:12,247 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-25 18:43:12,248 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-25 18:43:12,252 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-25 18:43:12,255 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-25 18:43:12,259 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-25 18:43:12,261 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-25 18:43:12,267 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-25 18:43:12,268 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-25 18:43:12,270 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-25 18:43:12,270 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-25 18:43:12,273 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-25 18:43:12,275 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-25 18:43:12,280 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-25 18:43:12,285 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-25 18:43:12,286 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-25 18:43:12,289 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-25 18:43:12,296 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-25 18:43:12,298 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-25 18:43:12,300 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-25 18:43:12,303 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-25 18:43:12,304 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-25 18:43:12,313 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-25 18:43:12,314 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-25 18:43:12,314 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-25 18:43:12,316 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-25 18:43:12,317 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-25 18:43:12,319 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-25 18:43:12,320 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-25 18:43:12,321 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-25 18:43:12,323 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-25 18:43:12,325 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-25 18:43:12,326 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-25 18:43:12,327 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-25 18:43:12,327 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-25 18:43:12,328 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-25 18:43:12,328 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-25 18:43:12,329 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-25 18:43:12,330 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-25 18:43:12,331 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57ca2f2b-7a1b-4211-a914-b6836eaa190b/bin/utaipan-eEHZpOm5b7/config/svcomp-Reach-32bit-Taipan_Default.epf [2021-11-25 18:43:12,380 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-25 18:43:12,380 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-25 18:43:12,381 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-25 18:43:12,381 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-25 18:43:12,388 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-11-25 18:43:12,389 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-11-25 18:43:12,389 INFO L138 SettingsManager]: * User list type=DISABLED [2021-11-25 18:43:12,389 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2021-11-25 18:43:12,389 INFO L138 SettingsManager]: * Explicit value domain=true [2021-11-25 18:43:12,390 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2021-11-25 18:43:12,391 INFO L138 SettingsManager]: * Octagon Domain=false [2021-11-25 18:43:12,391 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2021-11-25 18:43:12,391 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2021-11-25 18:43:12,391 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2021-11-25 18:43:12,392 INFO L138 SettingsManager]: * Interval Domain=false [2021-11-25 18:43:12,392 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2021-11-25 18:43:12,392 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2021-11-25 18:43:12,392 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2021-11-25 18:43:12,393 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-25 18:43:12,393 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-25 18:43:12,393 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-25 18:43:12,394 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-25 18:43:12,394 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-25 18:43:12,394 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-25 18:43:12,394 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-25 18:43:12,394 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-25 18:43:12,396 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-25 18:43:12,396 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-25 18:43:12,396 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-25 18:43:12,397 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-25 18:43:12,397 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-25 18:43:12,397 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-25 18:43:12,398 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-25 18:43:12,398 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-25 18:43:12,398 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-25 18:43:12,398 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-25 18:43:12,398 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2021-11-25 18:43:12,399 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-25 18:43:12,399 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-25 18:43:12,399 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-25 18:43:12,399 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-11-25 18:43:12,399 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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_57ca2f2b-7a1b-4211-a914-b6836eaa190b/bin/utaipan-eEHZpOm5b7/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_57ca2f2b-7a1b-4211-a914-b6836eaa190b/bin/utaipan-eEHZpOm5b7 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 -> b7e9feb6929ab81158cc9d6731414a71af210f92cb571da2954e02689fee6d2b [2021-11-25 18:43:12,671 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-25 18:43:12,692 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-25 18:43:12,694 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-25 18:43:12,695 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-25 18:43:12,696 INFO L275 PluginConnector]: CDTParser initialized [2021-11-25 18:43:12,697 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57ca2f2b-7a1b-4211-a914-b6836eaa190b/bin/utaipan-eEHZpOm5b7/../../sv-benchmarks/c/pthread-divine/ring_1w1r-2.i [2021-11-25 18:43:12,761 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57ca2f2b-7a1b-4211-a914-b6836eaa190b/bin/utaipan-eEHZpOm5b7/data/bbedd8d6b/c82439a0784d4056813a0f514c9f3d0b/FLAG9ba80c89d [2021-11-25 18:43:13,251 INFO L306 CDTParser]: Found 1 translation units. [2021-11-25 18:43:13,252 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57ca2f2b-7a1b-4211-a914-b6836eaa190b/sv-benchmarks/c/pthread-divine/ring_1w1r-2.i [2021-11-25 18:43:13,274 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57ca2f2b-7a1b-4211-a914-b6836eaa190b/bin/utaipan-eEHZpOm5b7/data/bbedd8d6b/c82439a0784d4056813a0f514c9f3d0b/FLAG9ba80c89d [2021-11-25 18:43:13,574 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57ca2f2b-7a1b-4211-a914-b6836eaa190b/bin/utaipan-eEHZpOm5b7/data/bbedd8d6b/c82439a0784d4056813a0f514c9f3d0b [2021-11-25 18:43:13,576 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-25 18:43:13,578 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-25 18:43:13,579 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-25 18:43:13,579 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-25 18:43:13,583 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-25 18:43:13,583 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 06:43:13" (1/1) ... [2021-11-25 18:43:13,585 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@388ccf78 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:43:13, skipping insertion in model container [2021-11-25 18:43:13,585 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 06:43:13" (1/1) ... [2021-11-25 18:43:13,592 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-25 18:43:13,656 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-25 18:43:13,844 WARN L610 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2021-11-25 18:43:14,113 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57ca2f2b-7a1b-4211-a914-b6836eaa190b/sv-benchmarks/c/pthread-divine/ring_1w1r-2.i[39095,39108] [2021-11-25 18:43:14,123 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57ca2f2b-7a1b-4211-a914-b6836eaa190b/sv-benchmarks/c/pthread-divine/ring_1w1r-2.i[39180,39193] [2021-11-25 18:43:14,124 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57ca2f2b-7a1b-4211-a914-b6836eaa190b/sv-benchmarks/c/pthread-divine/ring_1w1r-2.i[39232,39245] [2021-11-25 18:43:14,135 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-25 18:43:14,144 INFO L203 MainTranslator]: Completed pre-run [2021-11-25 18:43:14,164 WARN L610 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2021-11-25 18:43:14,211 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57ca2f2b-7a1b-4211-a914-b6836eaa190b/sv-benchmarks/c/pthread-divine/ring_1w1r-2.i[39095,39108] [2021-11-25 18:43:14,212 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57ca2f2b-7a1b-4211-a914-b6836eaa190b/sv-benchmarks/c/pthread-divine/ring_1w1r-2.i[39180,39193] [2021-11-25 18:43:14,212 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57ca2f2b-7a1b-4211-a914-b6836eaa190b/sv-benchmarks/c/pthread-divine/ring_1w1r-2.i[39232,39245] [2021-11-25 18:43:14,216 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-25 18:43:14,279 INFO L208 MainTranslator]: Completed translation [2021-11-25 18:43:14,279 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:43:14 WrapperNode [2021-11-25 18:43:14,280 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-25 18:43:14,281 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-25 18:43:14,282 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-25 18:43:14,282 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-25 18:43:14,289 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:43:14" (1/1) ... [2021-11-25 18:43:14,323 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:43:14" (1/1) ... [2021-11-25 18:43:14,361 INFO L137 Inliner]: procedures = 224, calls = 41, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 125 [2021-11-25 18:43:14,362 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-25 18:43:14,363 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-25 18:43:14,363 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-25 18:43:14,363 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-25 18:43:14,374 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:43:14" (1/1) ... [2021-11-25 18:43:14,374 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:43:14" (1/1) ... [2021-11-25 18:43:14,387 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:43:14" (1/1) ... [2021-11-25 18:43:14,387 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:43:14" (1/1) ... [2021-11-25 18:43:14,395 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:43:14" (1/1) ... [2021-11-25 18:43:14,410 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:43:14" (1/1) ... [2021-11-25 18:43:14,417 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:43:14" (1/1) ... [2021-11-25 18:43:14,420 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-25 18:43:14,421 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-25 18:43:14,421 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-25 18:43:14,421 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-25 18:43:14,429 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:43:14" (1/1) ... [2021-11-25 18:43:14,436 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-25 18:43:14,447 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57ca2f2b-7a1b-4211-a914-b6836eaa190b/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 18:43:14,462 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57ca2f2b-7a1b-4211-a914-b6836eaa190b/bin/utaipan-eEHZpOm5b7/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-25 18:43:14,470 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57ca2f2b-7a1b-4211-a914-b6836eaa190b/bin/utaipan-eEHZpOm5b7/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-25 18:43:14,511 INFO L130 BoogieDeclarations]: Found specification of procedure reader_fn [2021-11-25 18:43:14,511 INFO L138 BoogieDeclarations]: Found implementation of procedure reader_fn [2021-11-25 18:43:14,511 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-25 18:43:14,512 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-25 18:43:14,512 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-11-25 18:43:14,512 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-11-25 18:43:14,512 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-11-25 18:43:14,512 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-25 18:43:14,512 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-25 18:43:14,513 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-25 18:43:14,514 WARN L209 CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-11-25 18:43:14,681 INFO L236 CfgBuilder]: Building ICFG [2021-11-25 18:43:14,682 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-11-25 18:43:14,947 INFO L277 CfgBuilder]: Performing block encoding [2021-11-25 18:43:14,957 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-25 18:43:14,957 INFO L301 CfgBuilder]: Removed 3 assume(true) statements. [2021-11-25 18:43:14,959 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 06:43:14 BoogieIcfgContainer [2021-11-25 18:43:14,960 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-25 18:43:14,962 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-25 18:43:14,962 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-25 18:43:14,965 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-25 18:43:14,966 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 06:43:13" (1/3) ... [2021-11-25 18:43:14,966 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46109efd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 06:43:14, skipping insertion in model container [2021-11-25 18:43:14,967 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:43:14" (2/3) ... [2021-11-25 18:43:14,967 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46109efd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 06:43:14, skipping insertion in model container [2021-11-25 18:43:14,967 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 06:43:14" (3/3) ... [2021-11-25 18:43:14,968 INFO L111 eAbstractionObserver]: Analyzing ICFG ring_1w1r-2.i [2021-11-25 18:43:14,988 WARN L149 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-11-25 18:43:14,988 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-25 18:43:14,988 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2021-11-25 18:43:14,988 INFO L513 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-11-25 18:43:15,024 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:43:15,025 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:43:15,025 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:43:15,025 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:43:15,026 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:43:15,026 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:43:15,026 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:43:15,026 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:43:15,027 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:43:15,027 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:43:15,027 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~r~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:43:15,027 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~r~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:43:15,027 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:43:15,028 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:43:15,028 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~r~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:43:15,028 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~r~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:43:15,028 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~val~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:43:15,029 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~val~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:43:15,029 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~last~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:43:15,029 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~last~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:43:15,029 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:43:15,030 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:43:15,030 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:43:15,030 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:43:15,030 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:43:15,031 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:43:15,031 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~last~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:43:15,031 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~last~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:43:15,031 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~last~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:43:15,032 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~last~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:43:15,032 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~r~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:43:15,032 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~r~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:43:15,033 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#in~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:43:15,033 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#in~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:43:15,033 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~r~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:43:15,033 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~r~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:43:15,033 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#in~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:43:15,034 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#in~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:43:15,034 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~r~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:43:15,034 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~r~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:43:15,034 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#in~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:43:15,035 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#in~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:43:15,035 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~r~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:43:15,035 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~r~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:43:15,035 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#in~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:43:15,035 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#in~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:43:15,036 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:43:15,036 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:43:15,036 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:43:15,036 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:43:15,037 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:43:15,037 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:43:15,037 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:43:15,037 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:43:15,038 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:43:15,038 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:43:15,038 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:43:15,038 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:43:15,038 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:43:15,039 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:43:15,039 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:43:15,039 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:43:15,039 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:43:15,039 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:43:15,040 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:43:15,040 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:43:15,040 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#in~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:43:15,040 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#in~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:43:15,041 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:43:15,041 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:43:15,041 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#in~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:43:15,041 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#in~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:43:15,042 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:43:15,042 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:43:15,042 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#in~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:43:15,042 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#in~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:43:15,042 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:43:15,043 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:43:15,043 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#in~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:43:15,043 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#in~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:43:15,043 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:43:15,044 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:43:15,044 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:43:15,044 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:43:15,044 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:43:15,045 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:43:15,045 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:43:15,045 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:43:15,045 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:43:15,046 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:43:15,046 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:43:15,046 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:43:15,046 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:43:15,047 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:43:15,047 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:43:15,047 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:43:15,047 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:43:15,048 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:43:15,048 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:43:15,048 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:43:15,048 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:43:15,048 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:43:15,049 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:43:15,049 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:43:15,049 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:43:15,049 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:43:15,050 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:43:15,050 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:43:15,050 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:43:15,051 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:43:15,051 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:43:15,051 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:43:15,051 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:43:15,052 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:43:15,052 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:43:15,052 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:43:15,052 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:43:15,053 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:43:15,053 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:43:15,053 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:43:15,053 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:43:15,054 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:43:15,054 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:43:15,054 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:43:15,054 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:43:15,055 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:43:15,055 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:43:15,055 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~ret13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:43:15,055 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:43:15,056 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~ret13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:43:15,056 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:43:15,056 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~ret16#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:43:15,056 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:43:15,057 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~ret16#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:43:15,057 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~ret13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:43:15,057 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~ret13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:43:15,057 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~ret13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:43:15,058 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~ret13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:43:15,058 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~ret16#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:43:15,058 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~ret16#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:43:15,059 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~ret16#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:43:15,059 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~ret16#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:43:15,059 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~ret13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:43:15,059 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~ret13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:43:15,060 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~ret13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:43:15,060 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~ret13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:43:15,060 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~ret16#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:43:15,060 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~ret16#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:43:15,061 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:43:15,061 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:43:15,061 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:43:15,061 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:43:15,062 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~r~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:43:15,062 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~r~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:43:15,062 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#in~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:43:15,062 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#in~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:43:15,062 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~r~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:43:15,063 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~r~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:43:15,063 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#in~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:43:15,063 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#in~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:43:15,063 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:43:15,064 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:43:15,064 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:43:15,064 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:43:15,064 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_~x~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:43:15,064 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#t~mem10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:43:15,065 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:43:15,065 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:43:15,065 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:43:15,065 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:43:15,066 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_~x~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:43:15,066 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#t~mem10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:43:15,066 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:43:15,066 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:43:15,066 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#in~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:43:15,067 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#in~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:43:15,067 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:43:15,067 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:43:15,067 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#in~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:43:15,068 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#in~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:43:15,068 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:43:15,068 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:43:15,068 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:43:15,068 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:43:15,069 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:43:15,069 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:43:15,069 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:43:15,069 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:43:15,070 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:43:15,070 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:43:15,070 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:43:15,070 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:43:15,071 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:43:15,071 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:43:15,071 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:43:15,071 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:43:15,072 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:43:15,072 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_~x~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:43:15,072 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:43:15,072 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_~x~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:43:15,072 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:43:15,073 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:43:15,073 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:43:15,073 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:43:15,073 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:43:15,074 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:43:15,074 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#t~mem10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:43:15,074 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:43:15,074 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:43:15,075 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#t~mem10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:43:15,075 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:43:15,075 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:43:15,075 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#t~mem10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:43:15,076 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:43:15,076 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:43:15,076 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#t~mem10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:43:15,076 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#t~mem10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:43:15,077 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#t~mem10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:43:15,077 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_~x~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:43:15,077 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:43:15,077 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_~x~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:43:15,078 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:43:15,078 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:43:15,078 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~ret14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:43:15,078 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:43:15,079 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~ret14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:43:15,079 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~ret14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:43:15,079 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~ret14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:43:15,079 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~ret14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:43:15,080 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~val~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:43:15,080 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~ret14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:43:15,080 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~val~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:43:15,080 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~ret14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:43:15,081 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~ret14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:43:15,081 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~last~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:43:15,081 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~val~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:43:15,081 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~last~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:43:15,081 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~val~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:43:15,082 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~last~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:43:15,082 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~val~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:43:15,082 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~last~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:43:15,082 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~val~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:43:15,083 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~val~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:43:15,083 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~last~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:43:15,083 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~val~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:43:15,083 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~last~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:43:15,084 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:43:15,084 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~pre15#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:43:15,084 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:43:15,084 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~pre15#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:43:15,084 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:43:15,085 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:43:15,085 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:43:15,085 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:43:15,085 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~pre15#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:43:15,086 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~pre15#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:43:15,089 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~pre15#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:43:15,089 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:43:15,089 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:43:15,090 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~r~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:43:15,090 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~ret13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:43:15,090 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:43:15,090 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_~x~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:43:15,090 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~val~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:43:15,091 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:43:15,091 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~last~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:43:15,091 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:43:15,091 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:43:15,092 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~ret14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:43:15,092 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:43:15,092 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~r~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:43:15,092 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#in~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:43:15,093 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:43:15,093 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#in~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:43:15,093 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:43:15,093 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:43:15,094 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#t~mem10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:43:15,094 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:43:15,094 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#in~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:43:15,094 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:43:15,094 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:43:15,095 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~ret16#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:43:15,095 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#in~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:43:15,095 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:43:15,095 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:43:15,100 INFO L148 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2021-11-25 18:43:15,146 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-25 18:43:15,153 INFO L339 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, mLoopAccelerationTechnique=FAST_UPR [2021-11-25 18:43:15,154 INFO L340 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2021-11-25 18:43:15,171 INFO L118 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-11-25 18:43:15,183 INFO L133 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 152 places, 158 transitions, 324 flow [2021-11-25 18:43:15,185 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 152 places, 158 transitions, 324 flow [2021-11-25 18:43:15,187 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 152 places, 158 transitions, 324 flow [2021-11-25 18:43:15,260 INFO L129 PetriNetUnfolder]: 10/157 cut-off events. [2021-11-25 18:43:15,261 INFO L130 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2021-11-25 18:43:15,270 INFO L84 FinitePrefix]: Finished finitePrefix Result has 162 conditions, 157 events. 10/157 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 270 event pairs, 0 based on Foata normal form. 0/144 useless extension candidates. Maximal degree in co-relation 116. Up to 2 conditions per place. [2021-11-25 18:43:15,277 INFO L116 LiptonReduction]: Number of co-enabled transitions 6150 [2021-11-25 18:43:19,307 INFO L131 LiptonReduction]: Checked pairs total: 7563 [2021-11-25 18:43:19,307 INFO L133 LiptonReduction]: Total number of compositions: 153 [2021-11-25 18:43:19,315 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 30 places, 32 transitions, 72 flow [2021-11-25 18:43:19,365 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 119 states, 116 states have (on average 2.413793103448276) internal successors, (280), 118 states have internal predecessors, (280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:43:19,367 INFO L276 IsEmpty]: Start isEmpty. Operand has 119 states, 116 states have (on average 2.413793103448276) internal successors, (280), 118 states have internal predecessors, (280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:43:19,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2021-11-25 18:43:19,372 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:43:19,372 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2021-11-25 18:43:19,373 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2021-11-25 18:43:19,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:43:19,378 INFO L85 PathProgramCache]: Analyzing trace with hash 589910224, now seen corresponding path program 1 times [2021-11-25 18:43:19,388 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:43:19,388 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [23079758] [2021-11-25 18:43:19,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:43:19,389 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:43:19,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:43:19,564 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 18:43:19,564 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:43:19,565 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [23079758] [2021-11-25 18:43:19,565 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [23079758] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 18:43:19,565 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 18:43:19,566 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-25 18:43:19,567 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1695836602] [2021-11-25 18:43:19,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 18:43:19,571 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-11-25 18:43:19,572 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:43:19,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-11-25 18:43:19,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-11-25 18:43:19,596 INFO L87 Difference]: Start difference. First operand has 119 states, 116 states have (on average 2.413793103448276) internal successors, (280), 118 states have internal predecessors, (280), 0 states have call successors, (0), 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 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:43:19,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:43:19,663 INFO L93 Difference]: Finished difference Result 119 states and 258 transitions. [2021-11-25 18:43:19,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-11-25 18:43:19,668 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 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 5 [2021-11-25 18:43:19,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:43:19,685 INFO L225 Difference]: With dead ends: 119 [2021-11-25 18:43:19,686 INFO L226 Difference]: Without dead ends: 119 [2021-11-25 18:43:19,687 INFO L932 BasicCegarLoop]: 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 [2021-11-25 18:43:19,692 INFO L933 BasicCegarLoop]: 4 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-25 18:43:19,694 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 4 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-25 18:43:19,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2021-11-25 18:43:19,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2021-11-25 18:43:19,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 116 states have (on average 2.2241379310344827) internal successors, (258), 118 states have internal predecessors, (258), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:43:19,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 258 transitions. [2021-11-25 18:43:19,766 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 258 transitions. Word has length 5 [2021-11-25 18:43:19,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:43:19,766 INFO L470 AbstractCegarLoop]: Abstraction has 119 states and 258 transitions. [2021-11-25 18:43:19,771 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:43:19,773 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 258 transitions. [2021-11-25 18:43:19,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2021-11-25 18:43:19,774 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:43:19,774 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2021-11-25 18:43:19,774 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-25 18:43:19,775 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2021-11-25 18:43:19,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:43:19,775 INFO L85 PathProgramCache]: Analyzing trace with hash 1107344259, now seen corresponding path program 1 times [2021-11-25 18:43:19,776 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:43:19,776 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1425063555] [2021-11-25 18:43:19,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:43:19,776 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:43:19,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:43:19,892 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 18:43:19,893 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:43:19,893 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1425063555] [2021-11-25 18:43:19,893 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1425063555] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 18:43:19,893 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 18:43:19,894 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-25 18:43:19,894 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1766025890] [2021-11-25 18:43:19,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 18:43:19,895 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-25 18:43:19,895 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:43:19,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-25 18:43:19,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-25 18:43:19,896 INFO L87 Difference]: Start difference. First operand 119 states and 258 transitions. Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:43:19,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:43:19,965 INFO L93 Difference]: Finished difference Result 191 states and 419 transitions. [2021-11-25 18:43:19,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-25 18:43:19,973 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 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 6 [2021-11-25 18:43:19,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:43:19,975 INFO L225 Difference]: With dead ends: 191 [2021-11-25 18:43:19,976 INFO L226 Difference]: Without dead ends: 191 [2021-11-25 18:43:19,976 INFO L932 BasicCegarLoop]: 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 [2021-11-25 18:43:19,977 INFO L933 BasicCegarLoop]: 6 mSDtfsCounter, 17 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-25 18:43:19,978 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [17 Valid, 9 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-25 18:43:19,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2021-11-25 18:43:20,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 146. [2021-11-25 18:43:20,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 143 states have (on average 2.265734265734266) internal successors, (324), 145 states have internal predecessors, (324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:43:20,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 324 transitions. [2021-11-25 18:43:20,006 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 324 transitions. Word has length 6 [2021-11-25 18:43:20,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:43:20,006 INFO L470 AbstractCegarLoop]: Abstraction has 146 states and 324 transitions. [2021-11-25 18:43:20,009 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:43:20,010 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 324 transitions. [2021-11-25 18:43:20,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-11-25 18:43:20,011 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:43:20,011 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 18:43:20,011 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-25 18:43:20,011 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2021-11-25 18:43:20,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:43:20,011 INFO L85 PathProgramCache]: Analyzing trace with hash -478205706, now seen corresponding path program 1 times [2021-11-25 18:43:20,012 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:43:20,012 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1494640064] [2021-11-25 18:43:20,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:43:20,012 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:43:20,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:43:20,270 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 18:43:20,270 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:43:20,270 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1494640064] [2021-11-25 18:43:20,271 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1494640064] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 18:43:20,271 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 18:43:20,271 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-25 18:43:20,271 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1608122225] [2021-11-25 18:43:20,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 18:43:20,272 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-25 18:43:20,272 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:43:20,272 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-25 18:43:20,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-11-25 18:43:20,273 INFO L87 Difference]: Start difference. First operand 146 states and 324 transitions. Second operand has 7 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:43:20,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:43:20,577 INFO L93 Difference]: Finished difference Result 173 states and 374 transitions. [2021-11-25 18:43:20,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-25 18:43:20,578 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 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 10 [2021-11-25 18:43:20,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:43:20,580 INFO L225 Difference]: With dead ends: 173 [2021-11-25 18:43:20,580 INFO L226 Difference]: Without dead ends: 154 [2021-11-25 18:43:20,580 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2021-11-25 18:43:20,582 INFO L933 BasicCegarLoop]: 2 mSDtfsCounter, 52 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 233 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 233 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-25 18:43:20,582 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [52 Valid, 12 Invalid, 240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 233 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-25 18:43:20,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2021-11-25 18:43:20,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 154. [2021-11-25 18:43:20,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 151 states have (on average 2.2649006622516556) internal successors, (342), 153 states have internal predecessors, (342), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:43:20,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 342 transitions. [2021-11-25 18:43:20,600 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 342 transitions. Word has length 10 [2021-11-25 18:43:20,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:43:20,600 INFO L470 AbstractCegarLoop]: Abstraction has 154 states and 342 transitions. [2021-11-25 18:43:20,600 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:43:20,601 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 342 transitions. [2021-11-25 18:43:20,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-11-25 18:43:20,601 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:43:20,601 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 18:43:20,602 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-11-25 18:43:20,602 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2021-11-25 18:43:20,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:43:20,602 INFO L85 PathProgramCache]: Analyzing trace with hash 1570963847, now seen corresponding path program 1 times [2021-11-25 18:43:20,602 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:43:20,602 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1807262920] [2021-11-25 18:43:20,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:43:20,603 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:43:20,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:43:21,159 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 18:43:21,159 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:43:21,159 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1807262920] [2021-11-25 18:43:21,159 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1807262920] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 18:43:21,159 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 18:43:21,160 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-11-25 18:43:21,160 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1404486832] [2021-11-25 18:43:21,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 18:43:21,160 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-11-25 18:43:21,160 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:43:21,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-11-25 18:43:21,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2021-11-25 18:43:21,161 INFO L87 Difference]: Start difference. First operand 154 states and 342 transitions. Second operand has 13 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 12 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:43:21,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:43:21,737 INFO L93 Difference]: Finished difference Result 179 states and 390 transitions. [2021-11-25 18:43:21,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-11-25 18:43:21,738 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 12 states have internal predecessors, (16), 0 states have call successors, (0), 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 16 [2021-11-25 18:43:21,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:43:21,740 INFO L225 Difference]: With dead ends: 179 [2021-11-25 18:43:21,740 INFO L226 Difference]: Without dead ends: 171 [2021-11-25 18:43:21,741 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=102, Invalid=278, Unknown=0, NotChecked=0, Total=380 [2021-11-25 18:43:21,742 INFO L933 BasicCegarLoop]: 6 mSDtfsCounter, 65 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 358 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 369 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 358 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-11-25 18:43:21,742 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [65 Valid, 29 Invalid, 369 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 358 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-11-25 18:43:21,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2021-11-25 18:43:21,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 167. [2021-11-25 18:43:21,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 164 states have (on average 2.2621951219512195) internal successors, (371), 166 states have internal predecessors, (371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:43:21,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 371 transitions. [2021-11-25 18:43:21,769 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 371 transitions. Word has length 16 [2021-11-25 18:43:21,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:43:21,769 INFO L470 AbstractCegarLoop]: Abstraction has 167 states and 371 transitions. [2021-11-25 18:43:21,769 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 12 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:43:21,770 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 371 transitions. [2021-11-25 18:43:21,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-11-25 18:43:21,771 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:43:21,771 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 18:43:21,771 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-11-25 18:43:21,771 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2021-11-25 18:43:21,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:43:21,772 INFO L85 PathProgramCache]: Analyzing trace with hash -2102097049, now seen corresponding path program 2 times [2021-11-25 18:43:21,772 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:43:21,773 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1629956207] [2021-11-25 18:43:21,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:43:21,773 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:43:21,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:43:22,183 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 18:43:22,183 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:43:22,183 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1629956207] [2021-11-25 18:43:22,184 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1629956207] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 18:43:22,184 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 18:43:22,184 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-11-25 18:43:22,184 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [338254940] [2021-11-25 18:43:22,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 18:43:22,184 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-11-25 18:43:22,184 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:43:22,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-11-25 18:43:22,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2021-11-25 18:43:22,185 INFO L87 Difference]: Start difference. First operand 167 states and 371 transitions. Second operand has 13 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 12 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:43:23,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:43:23,554 INFO L93 Difference]: Finished difference Result 195 states and 420 transitions. [2021-11-25 18:43:23,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-11-25 18:43:23,554 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 12 states have internal predecessors, (16), 0 states have call successors, (0), 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 16 [2021-11-25 18:43:23,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:43:23,556 INFO L225 Difference]: With dead ends: 195 [2021-11-25 18:43:23,556 INFO L226 Difference]: Without dead ends: 185 [2021-11-25 18:43:23,557 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=245, Invalid=567, Unknown=0, NotChecked=0, Total=812 [2021-11-25 18:43:23,558 INFO L933 BasicCegarLoop]: 8 mSDtfsCounter, 71 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 486 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 527 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 486 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-11-25 18:43:23,558 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [71 Valid, 44 Invalid, 527 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 486 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2021-11-25 18:43:23,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2021-11-25 18:43:23,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 175. [2021-11-25 18:43:23,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 172 states have (on average 2.25) internal successors, (387), 174 states have internal predecessors, (387), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:43:23,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 387 transitions. [2021-11-25 18:43:23,570 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 387 transitions. Word has length 16 [2021-11-25 18:43:23,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:43:23,570 INFO L470 AbstractCegarLoop]: Abstraction has 175 states and 387 transitions. [2021-11-25 18:43:23,570 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 12 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:43:23,571 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 387 transitions. [2021-11-25 18:43:23,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-11-25 18:43:23,572 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:43:23,572 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 18:43:23,572 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-11-25 18:43:23,573 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2021-11-25 18:43:23,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:43:23,573 INFO L85 PathProgramCache]: Analyzing trace with hash 98493671, now seen corresponding path program 3 times [2021-11-25 18:43:23,573 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:43:23,574 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1902674261] [2021-11-25 18:43:23,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:43:23,574 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:43:23,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:43:24,020 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 18:43:24,020 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:43:24,021 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1902674261] [2021-11-25 18:43:24,021 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1902674261] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 18:43:24,021 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 18:43:24,021 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-11-25 18:43:24,021 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [939152942] [2021-11-25 18:43:24,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 18:43:24,022 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-11-25 18:43:24,022 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:43:24,022 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-11-25 18:43:24,023 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2021-11-25 18:43:24,023 INFO L87 Difference]: Start difference. First operand 175 states and 387 transitions. Second operand has 13 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 12 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:43:25,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:43:25,091 INFO L93 Difference]: Finished difference Result 193 states and 409 transitions. [2021-11-25 18:43:25,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-11-25 18:43:25,092 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 12 states have internal predecessors, (16), 0 states have call successors, (0), 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 16 [2021-11-25 18:43:25,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:43:25,094 INFO L225 Difference]: With dead ends: 193 [2021-11-25 18:43:25,094 INFO L226 Difference]: Without dead ends: 183 [2021-11-25 18:43:25,095 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=243, Invalid=569, Unknown=0, NotChecked=0, Total=812 [2021-11-25 18:43:25,095 INFO L933 BasicCegarLoop]: 8 mSDtfsCounter, 53 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 355 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 398 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 355 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-11-25 18:43:25,096 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [53 Valid, 36 Invalid, 398 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 355 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-11-25 18:43:25,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2021-11-25 18:43:25,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 162. [2021-11-25 18:43:25,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 159 states have (on average 2.2264150943396226) internal successors, (354), 161 states have internal predecessors, (354), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:43:25,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 354 transitions. [2021-11-25 18:43:25,114 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 354 transitions. Word has length 16 [2021-11-25 18:43:25,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:43:25,115 INFO L470 AbstractCegarLoop]: Abstraction has 162 states and 354 transitions. [2021-11-25 18:43:25,115 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 12 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:43:25,115 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 354 transitions. [2021-11-25 18:43:25,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-11-25 18:43:25,118 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:43:25,118 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 18:43:25,118 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-11-25 18:43:25,119 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2021-11-25 18:43:25,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:43:25,120 INFO L85 PathProgramCache]: Analyzing trace with hash 679617786, now seen corresponding path program 1 times [2021-11-25 18:43:25,120 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:43:25,120 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [885975608] [2021-11-25 18:43:25,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:43:25,121 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:43:25,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:43:26,008 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 18:43:26,009 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:43:26,009 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [885975608] [2021-11-25 18:43:26,009 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [885975608] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 18:43:26,009 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 18:43:26,009 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-11-25 18:43:26,010 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2014913922] [2021-11-25 18:43:26,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 18:43:26,010 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-11-25 18:43:26,010 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:43:26,011 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-11-25 18:43:26,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2021-11-25 18:43:26,011 INFO L87 Difference]: Start difference. First operand 162 states and 354 transitions. Second operand has 15 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 14 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) [2021-11-25 18:43:27,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:43:27,082 INFO L93 Difference]: Finished difference Result 240 states and 524 transitions. [2021-11-25 18:43:27,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-11-25 18:43:27,083 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 14 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 [2021-11-25 18:43:27,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:43:27,084 INFO L225 Difference]: With dead ends: 240 [2021-11-25 18:43:27,085 INFO L226 Difference]: Without dead ends: 240 [2021-11-25 18:43:27,085 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=143, Invalid=507, Unknown=0, NotChecked=0, Total=650 [2021-11-25 18:43:27,086 INFO L933 BasicCegarLoop]: 4 mSDtfsCounter, 80 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 718 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 741 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 718 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-11-25 18:43:27,087 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [80 Valid, 42 Invalid, 741 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 718 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2021-11-25 18:43:27,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2021-11-25 18:43:27,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 220. [2021-11-25 18:43:27,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 220 states, 217 states have (on average 2.2211981566820276) internal successors, (482), 219 states have internal predecessors, (482), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:43:27,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 482 transitions. [2021-11-25 18:43:27,097 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 482 transitions. Word has length 18 [2021-11-25 18:43:27,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:43:27,098 INFO L470 AbstractCegarLoop]: Abstraction has 220 states and 482 transitions. [2021-11-25 18:43:27,098 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 14 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) [2021-11-25 18:43:27,098 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 482 transitions. [2021-11-25 18:43:27,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-11-25 18:43:27,100 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:43:27,100 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 18:43:27,100 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-11-25 18:43:27,100 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2021-11-25 18:43:27,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:43:27,101 INFO L85 PathProgramCache]: Analyzing trace with hash -1684464002, now seen corresponding path program 2 times [2021-11-25 18:43:27,101 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:43:27,101 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1093188910] [2021-11-25 18:43:27,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:43:27,101 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:43:27,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:43:27,824 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 18:43:27,824 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:43:27,824 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1093188910] [2021-11-25 18:43:27,824 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1093188910] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 18:43:27,825 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 18:43:27,825 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-11-25 18:43:27,825 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [435484190] [2021-11-25 18:43:27,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 18:43:27,826 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-11-25 18:43:27,826 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:43:27,826 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-11-25 18:43:27,827 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2021-11-25 18:43:27,827 INFO L87 Difference]: Start difference. First operand 220 states and 482 transitions. Second operand has 15 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 14 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) [2021-11-25 18:43:29,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:43:29,161 INFO L93 Difference]: Finished difference Result 390 states and 863 transitions. [2021-11-25 18:43:29,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-11-25 18:43:29,161 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 14 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 [2021-11-25 18:43:29,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:43:29,164 INFO L225 Difference]: With dead ends: 390 [2021-11-25 18:43:29,164 INFO L226 Difference]: Without dead ends: 390 [2021-11-25 18:43:29,165 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 127 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=176, Invalid=694, Unknown=0, NotChecked=0, Total=870 [2021-11-25 18:43:29,166 INFO L933 BasicCegarLoop]: 7 mSDtfsCounter, 108 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 899 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 923 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 899 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2021-11-25 18:43:29,166 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [108 Valid, 65 Invalid, 923 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 899 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2021-11-25 18:43:29,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 390 states. [2021-11-25 18:43:29,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 390 to 226. [2021-11-25 18:43:29,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 226 states, 223 states have (on average 2.219730941704036) internal successors, (495), 225 states have internal predecessors, (495), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:43:29,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 495 transitions. [2021-11-25 18:43:29,177 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 495 transitions. Word has length 18 [2021-11-25 18:43:29,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:43:29,178 INFO L470 AbstractCegarLoop]: Abstraction has 226 states and 495 transitions. [2021-11-25 18:43:29,178 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 14 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) [2021-11-25 18:43:29,178 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 495 transitions. [2021-11-25 18:43:29,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-11-25 18:43:29,179 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:43:29,179 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 18:43:29,180 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-11-25 18:43:29,180 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2021-11-25 18:43:29,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:43:29,180 INFO L85 PathProgramCache]: Analyzing trace with hash -2034888920, now seen corresponding path program 3 times [2021-11-25 18:43:29,180 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:43:29,181 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1785560627] [2021-11-25 18:43:29,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:43:29,181 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:43:29,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:43:29,757 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 18:43:29,757 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:43:29,757 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1785560627] [2021-11-25 18:43:29,757 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1785560627] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 18:43:29,758 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 18:43:29,758 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-11-25 18:43:29,758 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [98289641] [2021-11-25 18:43:29,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 18:43:29,758 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-11-25 18:43:29,758 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:43:29,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-11-25 18:43:29,759 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2021-11-25 18:43:29,759 INFO L87 Difference]: Start difference. First operand 226 states and 495 transitions. Second operand has 15 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 14 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) [2021-11-25 18:43:30,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:43:30,939 INFO L93 Difference]: Finished difference Result 298 states and 655 transitions. [2021-11-25 18:43:30,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-11-25 18:43:30,940 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 14 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 [2021-11-25 18:43:30,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:43:30,942 INFO L225 Difference]: With dead ends: 298 [2021-11-25 18:43:30,942 INFO L226 Difference]: Without dead ends: 298 [2021-11-25 18:43:30,943 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=166, Invalid=590, Unknown=0, NotChecked=0, Total=756 [2021-11-25 18:43:30,944 INFO L933 BasicCegarLoop]: 8 mSDtfsCounter, 97 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 919 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 943 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 919 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2021-11-25 18:43:30,944 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [97 Valid, 86 Invalid, 943 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 919 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2021-11-25 18:43:30,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2021-11-25 18:43:30,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 226. [2021-11-25 18:43:30,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 226 states, 223 states have (on average 2.219730941704036) internal successors, (495), 225 states have internal predecessors, (495), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:43:30,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 495 transitions. [2021-11-25 18:43:30,964 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 495 transitions. Word has length 18 [2021-11-25 18:43:30,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:43:30,964 INFO L470 AbstractCegarLoop]: Abstraction has 226 states and 495 transitions. [2021-11-25 18:43:30,964 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 14 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) [2021-11-25 18:43:30,965 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 495 transitions. [2021-11-25 18:43:30,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-11-25 18:43:30,965 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:43:30,965 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 18:43:30,966 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-11-25 18:43:30,966 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2021-11-25 18:43:30,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:43:30,966 INFO L85 PathProgramCache]: Analyzing trace with hash 2017096340, now seen corresponding path program 4 times [2021-11-25 18:43:30,967 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:43:30,967 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2024371703] [2021-11-25 18:43:30,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:43:30,967 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:43:31,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:43:31,469 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 18:43:31,469 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:43:31,469 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2024371703] [2021-11-25 18:43:31,469 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2024371703] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 18:43:31,469 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 18:43:31,470 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-11-25 18:43:31,470 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1754296180] [2021-11-25 18:43:31,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 18:43:31,470 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-11-25 18:43:31,470 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:43:31,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-11-25 18:43:31,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2021-11-25 18:43:31,471 INFO L87 Difference]: Start difference. First operand 226 states and 495 transitions. Second operand has 13 states, 12 states have (on average 1.5) internal successors, (18), 12 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) [2021-11-25 18:43:32,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:43:32,539 INFO L93 Difference]: Finished difference Result 408 states and 911 transitions. [2021-11-25 18:43:32,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-11-25 18:43:32,539 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 1.5) internal successors, (18), 12 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 [2021-11-25 18:43:32,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:43:32,543 INFO L225 Difference]: With dead ends: 408 [2021-11-25 18:43:32,543 INFO L226 Difference]: Without dead ends: 408 [2021-11-25 18:43:32,544 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=134, Invalid=466, Unknown=0, NotChecked=0, Total=600 [2021-11-25 18:43:32,545 INFO L933 BasicCegarLoop]: 8 mSDtfsCounter, 99 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 718 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 735 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 718 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-11-25 18:43:32,546 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [99 Valid, 68 Invalid, 735 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 718 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2021-11-25 18:43:32,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 408 states. [2021-11-25 18:43:32,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 408 to 232. [2021-11-25 18:43:32,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 232 states, 229 states have (on average 2.2183406113537116) internal successors, (508), 231 states have internal predecessors, (508), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:43:32,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 508 transitions. [2021-11-25 18:43:32,559 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 508 transitions. Word has length 18 [2021-11-25 18:43:32,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:43:32,561 INFO L470 AbstractCegarLoop]: Abstraction has 232 states and 508 transitions. [2021-11-25 18:43:32,561 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 1.5) internal successors, (18), 12 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) [2021-11-25 18:43:32,561 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 508 transitions. [2021-11-25 18:43:32,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-11-25 18:43:32,562 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:43:32,562 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 18:43:32,562 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-11-25 18:43:32,563 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2021-11-25 18:43:32,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:43:32,563 INFO L85 PathProgramCache]: Analyzing trace with hash -975094232, now seen corresponding path program 5 times [2021-11-25 18:43:32,564 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:43:32,564 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1522739886] [2021-11-25 18:43:32,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:43:32,564 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:43:32,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:43:33,218 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 18:43:33,218 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:43:33,219 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1522739886] [2021-11-25 18:43:33,219 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1522739886] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 18:43:33,219 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 18:43:33,219 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-11-25 18:43:33,219 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1194879163] [2021-11-25 18:43:33,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 18:43:33,219 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-11-25 18:43:33,220 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:43:33,220 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-11-25 18:43:33,220 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2021-11-25 18:43:33,220 INFO L87 Difference]: Start difference. First operand 232 states and 508 transitions. Second operand has 15 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 14 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) [2021-11-25 18:43:34,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:43:34,304 INFO L93 Difference]: Finished difference Result 342 states and 755 transitions. [2021-11-25 18:43:34,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-11-25 18:43:34,305 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 14 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 [2021-11-25 18:43:34,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:43:34,308 INFO L225 Difference]: With dead ends: 342 [2021-11-25 18:43:34,308 INFO L226 Difference]: Without dead ends: 342 [2021-11-25 18:43:34,308 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 135 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=170, Invalid=700, Unknown=0, NotChecked=0, Total=870 [2021-11-25 18:43:34,309 INFO L933 BasicCegarLoop]: 8 mSDtfsCounter, 128 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 740 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 768 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 740 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-11-25 18:43:34,309 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [128 Valid, 61 Invalid, 768 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 740 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2021-11-25 18:43:34,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2021-11-25 18:43:34,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 232. [2021-11-25 18:43:34,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 232 states, 229 states have (on average 2.2183406113537116) internal successors, (508), 231 states have internal predecessors, (508), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:43:34,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 508 transitions. [2021-11-25 18:43:34,319 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 508 transitions. Word has length 18 [2021-11-25 18:43:34,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:43:34,319 INFO L470 AbstractCegarLoop]: Abstraction has 232 states and 508 transitions. [2021-11-25 18:43:34,319 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 14 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) [2021-11-25 18:43:34,319 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 508 transitions. [2021-11-25 18:43:34,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-11-25 18:43:34,320 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:43:34,320 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 18:43:34,321 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-11-25 18:43:34,321 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2021-11-25 18:43:34,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:43:34,321 INFO L85 PathProgramCache]: Analyzing trace with hash -612019740, now seen corresponding path program 6 times [2021-11-25 18:43:34,321 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:43:34,322 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1997532613] [2021-11-25 18:43:34,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:43:34,322 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:43:34,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:43:35,137 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 18:43:35,137 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:43:35,138 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1997532613] [2021-11-25 18:43:35,138 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1997532613] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 18:43:35,138 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 18:43:35,138 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-11-25 18:43:35,138 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1476509422] [2021-11-25 18:43:35,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 18:43:35,138 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-11-25 18:43:35,138 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:43:35,139 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-11-25 18:43:35,139 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2021-11-25 18:43:35,139 INFO L87 Difference]: Start difference. First operand 232 states and 508 transitions. Second operand has 15 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 14 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) [2021-11-25 18:43:36,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:43:36,123 INFO L93 Difference]: Finished difference Result 317 states and 692 transitions. [2021-11-25 18:43:36,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-11-25 18:43:36,123 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 14 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 [2021-11-25 18:43:36,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:43:36,126 INFO L225 Difference]: With dead ends: 317 [2021-11-25 18:43:36,126 INFO L226 Difference]: Without dead ends: 317 [2021-11-25 18:43:36,126 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=143, Invalid=507, Unknown=0, NotChecked=0, Total=650 [2021-11-25 18:43:36,127 INFO L933 BasicCegarLoop]: 4 mSDtfsCounter, 98 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 814 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 841 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 814 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-11-25 18:43:36,129 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [98 Valid, 42 Invalid, 841 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 814 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2021-11-25 18:43:36,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2021-11-25 18:43:36,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 244. [2021-11-25 18:43:36,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 244 states, 241 states have (on average 2.20746887966805) internal successors, (532), 243 states have internal predecessors, (532), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:43:36,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 532 transitions. [2021-11-25 18:43:36,138 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 532 transitions. Word has length 18 [2021-11-25 18:43:36,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:43:36,138 INFO L470 AbstractCegarLoop]: Abstraction has 244 states and 532 transitions. [2021-11-25 18:43:36,139 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 14 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) [2021-11-25 18:43:36,139 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 532 transitions. [2021-11-25 18:43:36,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-11-25 18:43:36,139 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:43:36,140 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 18:43:36,140 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-11-25 18:43:36,140 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2021-11-25 18:43:36,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:43:36,140 INFO L85 PathProgramCache]: Analyzing trace with hash 1318865768, now seen corresponding path program 7 times [2021-11-25 18:43:36,141 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:43:36,141 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [473827241] [2021-11-25 18:43:36,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:43:36,141 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:43:36,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:43:36,659 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 18:43:36,659 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:43:36,659 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [473827241] [2021-11-25 18:43:36,660 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [473827241] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 18:43:36,660 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 18:43:36,660 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-11-25 18:43:36,660 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [972227838] [2021-11-25 18:43:36,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 18:43:36,661 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-11-25 18:43:36,661 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:43:36,661 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-11-25 18:43:36,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2021-11-25 18:43:36,662 INFO L87 Difference]: Start difference. First operand 244 states and 532 transitions. Second operand has 15 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 14 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) [2021-11-25 18:43:38,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:43:38,129 INFO L93 Difference]: Finished difference Result 455 states and 1007 transitions. [2021-11-25 18:43:38,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-11-25 18:43:38,130 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 14 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 [2021-11-25 18:43:38,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:43:38,133 INFO L225 Difference]: With dead ends: 455 [2021-11-25 18:43:38,134 INFO L226 Difference]: Without dead ends: 455 [2021-11-25 18:43:38,134 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 129 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=176, Invalid=694, Unknown=0, NotChecked=0, Total=870 [2021-11-25 18:43:38,136 INFO L933 BasicCegarLoop]: 7 mSDtfsCounter, 101 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 1088 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 1110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 1088 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2021-11-25 18:43:38,136 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [101 Valid, 64 Invalid, 1110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 1088 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2021-11-25 18:43:38,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 455 states. [2021-11-25 18:43:38,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 455 to 235. [2021-11-25 18:43:38,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 235 states, 232 states have (on average 2.2155172413793105) internal successors, (514), 234 states have internal predecessors, (514), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:43:38,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 514 transitions. [2021-11-25 18:43:38,149 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 514 transitions. Word has length 18 [2021-11-25 18:43:38,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:43:38,150 INFO L470 AbstractCegarLoop]: Abstraction has 235 states and 514 transitions. [2021-11-25 18:43:38,150 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 14 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) [2021-11-25 18:43:38,150 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 514 transitions. [2021-11-25 18:43:38,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-11-25 18:43:38,151 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:43:38,151 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 18:43:38,151 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-11-25 18:43:38,151 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2021-11-25 18:43:38,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:43:38,152 INFO L85 PathProgramCache]: Analyzing trace with hash -2003052934, now seen corresponding path program 8 times [2021-11-25 18:43:38,152 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:43:38,152 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2040623564] [2021-11-25 18:43:38,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:43:38,153 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:43:38,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:43:38,991 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 18:43:38,991 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:43:38,991 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2040623564] [2021-11-25 18:43:38,991 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2040623564] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 18:43:38,991 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 18:43:38,992 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-11-25 18:43:38,992 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1560142587] [2021-11-25 18:43:38,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 18:43:38,992 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-11-25 18:43:38,992 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:43:38,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-11-25 18:43:38,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2021-11-25 18:43:38,993 INFO L87 Difference]: Start difference. First operand 235 states and 514 transitions. Second operand has 15 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 14 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) [2021-11-25 18:43:40,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:43:40,117 INFO L93 Difference]: Finished difference Result 305 states and 668 transitions. [2021-11-25 18:43:40,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-11-25 18:43:40,117 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 14 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 [2021-11-25 18:43:40,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:43:40,120 INFO L225 Difference]: With dead ends: 305 [2021-11-25 18:43:40,120 INFO L226 Difference]: Without dead ends: 305 [2021-11-25 18:43:40,120 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=144, Invalid=506, Unknown=0, NotChecked=0, Total=650 [2021-11-25 18:43:40,121 INFO L933 BasicCegarLoop]: 4 mSDtfsCounter, 79 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 822 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 845 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 822 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2021-11-25 18:43:40,121 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [79 Valid, 39 Invalid, 845 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 822 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2021-11-25 18:43:40,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2021-11-25 18:43:40,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 235. [2021-11-25 18:43:40,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 235 states, 232 states have (on average 2.2155172413793105) internal successors, (514), 234 states have internal predecessors, (514), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:43:40,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 514 transitions. [2021-11-25 18:43:40,130 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 514 transitions. Word has length 18 [2021-11-25 18:43:40,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:43:40,131 INFO L470 AbstractCegarLoop]: Abstraction has 235 states and 514 transitions. [2021-11-25 18:43:40,131 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 14 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) [2021-11-25 18:43:40,131 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 514 transitions. [2021-11-25 18:43:40,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-11-25 18:43:40,132 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:43:40,132 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 18:43:40,132 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-11-25 18:43:40,132 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2021-11-25 18:43:40,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:43:40,133 INFO L85 PathProgramCache]: Analyzing trace with hash -72167426, now seen corresponding path program 9 times [2021-11-25 18:43:40,133 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:43:40,133 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1193263325] [2021-11-25 18:43:40,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:43:40,133 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:43:40,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:43:40,716 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 18:43:40,716 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:43:40,716 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1193263325] [2021-11-25 18:43:40,716 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1193263325] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 18:43:40,717 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 18:43:40,717 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-11-25 18:43:40,717 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1271008545] [2021-11-25 18:43:40,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 18:43:40,717 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-11-25 18:43:40,717 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:43:40,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-11-25 18:43:40,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2021-11-25 18:43:40,718 INFO L87 Difference]: Start difference. First operand 235 states and 514 transitions. Second operand has 15 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 14 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) [2021-11-25 18:43:41,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:43:41,905 INFO L93 Difference]: Finished difference Result 437 states and 971 transitions. [2021-11-25 18:43:41,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-11-25 18:43:41,905 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 14 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 [2021-11-25 18:43:41,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:43:41,908 INFO L225 Difference]: With dead ends: 437 [2021-11-25 18:43:41,909 INFO L226 Difference]: Without dead ends: 437 [2021-11-25 18:43:41,909 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 145 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=177, Invalid=693, Unknown=0, NotChecked=0, Total=870 [2021-11-25 18:43:41,910 INFO L933 BasicCegarLoop]: 7 mSDtfsCounter, 101 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 942 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 966 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 942 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2021-11-25 18:43:41,910 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [101 Valid, 58 Invalid, 966 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 942 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2021-11-25 18:43:41,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 437 states. [2021-11-25 18:43:41,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 437 to 214. [2021-11-25 18:43:41,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 214 states, 211 states have (on average 2.2369668246445498) internal successors, (472), 213 states have internal predecessors, (472), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:43:41,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 472 transitions. [2021-11-25 18:43:41,919 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 472 transitions. Word has length 18 [2021-11-25 18:43:41,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:43:41,920 INFO L470 AbstractCegarLoop]: Abstraction has 214 states and 472 transitions. [2021-11-25 18:43:41,920 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 14 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) [2021-11-25 18:43:41,920 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 472 transitions. [2021-11-25 18:43:41,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-11-25 18:43:41,921 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:43:41,921 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 18:43:41,921 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-11-25 18:43:41,921 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2021-11-25 18:43:41,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:43:41,922 INFO L85 PathProgramCache]: Analyzing trace with hash 18114131, now seen corresponding path program 1 times [2021-11-25 18:43:41,922 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:43:41,922 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [422909878] [2021-11-25 18:43:41,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:43:41,923 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:43:41,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:43:41,956 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 18:43:41,956 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:43:41,956 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [422909878] [2021-11-25 18:43:41,957 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [422909878] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 18:43:41,957 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1544975523] [2021-11-25 18:43:41,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:43:41,957 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:43:41,958 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57ca2f2b-7a1b-4211-a914-b6836eaa190b/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 18:43:41,966 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57ca2f2b-7a1b-4211-a914-b6836eaa190b/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 18:43:41,993 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57ca2f2b-7a1b-4211-a914-b6836eaa190b/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-11-25 18:43:42,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:43:42,074 INFO L263 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 3 conjunts are in the unsatisfiable core [2021-11-25 18:43:42,079 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 18:43:42,160 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 18:43:42,160 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 18:43:42,226 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 18:43:42,227 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1544975523] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 18:43:42,227 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1301706512] [2021-11-25 18:43:42,235 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:1603) 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:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) 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) [2021-11-25 18:43:42,246 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 18:43:42,246 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2021-11-25 18:43:42,246 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2067975474] [2021-11-25 18:43:42,246 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 18:43:42,247 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-25 18:43:42,247 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:43:42,247 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-25 18:43:42,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2021-11-25 18:43:42,248 INFO L87 Difference]: Start difference. First operand 214 states and 472 transitions. Second operand has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 7 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:43:42,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:43:42,403 INFO L93 Difference]: Finished difference Result 398 states and 879 transitions. [2021-11-25 18:43:42,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-25 18:43:42,404 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 7 states have internal predecessors, (51), 0 states have call successors, (0), 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 21 [2021-11-25 18:43:42,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:43:42,407 INFO L225 Difference]: With dead ends: 398 [2021-11-25 18:43:42,407 INFO L226 Difference]: Without dead ends: 398 [2021-11-25 18:43:42,408 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2021-11-25 18:43:42,408 INFO L933 BasicCegarLoop]: 6 mSDtfsCounter, 71 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-25 18:43:42,409 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [71 Valid, 24 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-25 18:43:42,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 398 states. [2021-11-25 18:43:42,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 398 to 374. [2021-11-25 18:43:42,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 374 states, 371 states have (on average 2.2964959568733154) internal successors, (852), 373 states have internal predecessors, (852), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:43:42,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 852 transitions. [2021-11-25 18:43:42,423 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 852 transitions. Word has length 21 [2021-11-25 18:43:42,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:43:42,423 INFO L470 AbstractCegarLoop]: Abstraction has 374 states and 852 transitions. [2021-11-25 18:43:42,423 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 7 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:43:42,423 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 852 transitions. [2021-11-25 18:43:42,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-11-25 18:43:42,426 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:43:42,426 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 18:43:42,460 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57ca2f2b-7a1b-4211-a914-b6836eaa190b/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-11-25 18:43:42,645 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57ca2f2b-7a1b-4211-a914-b6836eaa190b/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2021-11-25 18:43:42,645 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2021-11-25 18:43:42,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:43:42,646 INFO L85 PathProgramCache]: Analyzing trace with hash 911747171, now seen corresponding path program 10 times [2021-11-25 18:43:42,646 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:43:42,646 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1886515348] [2021-11-25 18:43:42,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:43:42,646 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:43:42,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:43:43,911 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 18:43:43,911 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:43:43,911 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1886515348] [2021-11-25 18:43:43,911 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1886515348] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 18:43:43,911 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [717249664] [2021-11-25 18:43:43,912 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-11-25 18:43:43,912 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:43:43,912 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57ca2f2b-7a1b-4211-a914-b6836eaa190b/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 18:43:43,913 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57ca2f2b-7a1b-4211-a914-b6836eaa190b/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 18:43:43,915 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57ca2f2b-7a1b-4211-a914-b6836eaa190b/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-11-25 18:43:44,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:43:44,026 WARN L261 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 119 conjunts are in the unsatisfiable core [2021-11-25 18:43:44,030 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 18:43:44,083 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:43:44,090 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 [2021-11-25 18:43:44,098 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:43:44,099 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 [2021-11-25 18:43:44,109 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2021-11-25 18:43:44,663 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-25 18:43:44,664 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:43:44,680 INFO L354 Elim1Store]: treesize reduction 38, result has 30.9 percent of original size [2021-11-25 18:43:44,680 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 [2021-11-25 18:43:44,875 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:43:44,887 INFO L354 Elim1Store]: treesize reduction 43, result has 14.0 percent of original size [2021-11-25 18:43:44,888 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 58 treesize of output 45 [2021-11-25 18:43:45,342 INFO L354 Elim1Store]: treesize reduction 97, result has 24.2 percent of original size [2021-11-25 18:43:45,342 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 10 case distinctions, treesize of input 51 treesize of output 57 [2021-11-25 18:43:45,420 INFO L354 Elim1Store]: treesize reduction 14, result has 17.6 percent of original size [2021-11-25 18:43:45,420 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 [2021-11-25 18:43:45,459 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 18:43:45,459 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 18:43:50,557 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_354 Int) (|v_ULTIMATE.start_ring_enqueue_#t~mem6#1_137| Int)) (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_~r#1.base|))) (or (= (+ |c_reader_fnThread1of1ForFork0_~last~0#1| 1) (select (select (store |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_~r#1.base| (store .cse0 (+ (* |v_ULTIMATE.start_ring_enqueue_#t~mem6#1_137| 4) |c_ULTIMATE.start_ring_enqueue_~r#1.offset| 4) v_ArrVal_354)) |c_reader_fnThread1of1ForFork0_~r~0#1.base|) (+ |c_reader_fnThread1of1ForFork0_~r~0#1.offset| (* (select (select |c_#memory_int| |c_reader_fnThread1of1ForFork0_~r~0#1.base|) |c_reader_fnThread1of1ForFork0_~r~0#1.offset|) 4) 4))) (< |v_ULTIMATE.start_ring_enqueue_#t~mem6#1_137| (select .cse0 (+ |c_ULTIMATE.start_ring_enqueue_~r#1.offset| 20)))))) is different from false [2021-11-25 18:44:08,833 WARN L227 SmtUtils]: Spent 5.84s on a formula simplification that was a NOOP. DAG size: 65 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-11-25 18:44:37,896 WARN L227 SmtUtils]: Spent 6.26s on a formula simplification that was a NOOP. DAG size: 85 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-11-25 18:44:44,088 WARN L227 SmtUtils]: Spent 5.72s on a formula simplification that was a NOOP. DAG size: 84 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-11-25 18:45:02,232 WARN L227 SmtUtils]: Spent 11.37s on a formula simplification that was a NOOP. DAG size: 77 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-11-25 18:45:20,354 WARN L227 SmtUtils]: Spent 15.47s on a formula simplification that was a NOOP. DAG size: 75 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-11-25 18:45:33,277 WARN L227 SmtUtils]: Spent 6.22s on a formula simplification that was a NOOP. DAG size: 65 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-11-25 18:45:33,278 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 18:45:33,279 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [717249664] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 18:45:33,279 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [120825695] [2021-11-25 18:45:33,280 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:1603) 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:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) 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) [2021-11-25 18:45:33,280 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 18:45:33,280 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 15, 16] total 45 [2021-11-25 18:45:33,280 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1180609127] [2021-11-25 18:45:33,281 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 18:45:33,281 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2021-11-25 18:45:33,281 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:45:33,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2021-11-25 18:45:33,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=181, Invalid=1874, Unknown=19, NotChecked=88, Total=2162 [2021-11-25 18:45:33,283 INFO L87 Difference]: Start difference. First operand 374 states and 852 transitions. Second operand has 47 states, 46 states have (on average 1.434782608695652) internal successors, (66), 46 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:45:36,347 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse24 (select |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_~r#1.base|)) (.cse26 (+ |c_ULTIMATE.start_ring_enqueue_~r#1.offset| 20))) (let ((.cse25 (select .cse24 .cse26))) (let ((.cse1 (+ .cse25 1)) (.cse8 (+ 1 (select (store .cse24 (+ |c_ULTIMATE.start_ring_enqueue_~r#1.offset| 4 (* .cse25 4)) |c_ULTIMATE.start_ring_enqueue_~x#1|) .cse26)))) (let ((.cse7 (= (mod .cse8 4) 0)) (.cse6 (= (mod .cse1 4) 0)) (.cse0 (select |c_#memory_int| |c_reader_fnThread1of1ForFork0_~r~0#1.base|)) (.cse19 (select |c_#memory_int| |c_ULTIMATE.start_writer_fn_~r~1#1.base|))) (and (= |c_reader_fnThread1of1ForFork0_~r~0#1.base| |c_ULTIMATE.start_ring_enqueue_~r#1.base|) (= (select .cse0 4) 1) (= 0 |c_reader_fnThread1of1ForFork0_~last~0#1|) (or (<= 0 .cse1) (forall ((v_ArrVal_354 Int) (|v_ULTIMATE.start_ring_enqueue_#t~mem6#1_137| Int)) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_~r#1.base| (let ((.cse4 (select |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_~r#1.base|)) (.cse5 (+ |c_ULTIMATE.start_ring_enqueue_~r#1.offset| 20))) (store .cse4 .cse5 (+ (- 4) (mod (+ (select .cse4 .cse5) 1) 4))))))) (let ((.cse2 (select .cse3 |c_ULTIMATE.start_writer_fn_~r~1#1.base|))) (or (< |v_ULTIMATE.start_ring_enqueue_#t~mem6#1_137| (select .cse2 (+ |c_ULTIMATE.start_writer_fn_~r~1#1.offset| 20))) (= (+ |c_reader_fnThread1of1ForFork0_~last~0#1| 1) (select (select (store .cse3 |c_ULTIMATE.start_writer_fn_~r~1#1.base| (store .cse2 (+ |c_ULTIMATE.start_writer_fn_~r~1#1.offset| (* |v_ULTIMATE.start_ring_enqueue_#t~mem6#1_137| 4) 4) v_ArrVal_354)) |c_reader_fnThread1of1ForFork0_~r~0#1.base|) (+ (* (select (select .cse3 |c_reader_fnThread1of1ForFork0_~r~0#1.base|) |c_reader_fnThread1of1ForFork0_~r~0#1.offset|) 4) |c_reader_fnThread1of1ForFork0_~r~0#1.offset| 4))))))) .cse6) (= |c_ULTIMATE.start_writer_fn_~r~1#1.offset| 0) (= |c_reader_fnThread1of1ForFork0_~r~0#1.base| |c_ULTIMATE.start_writer_fn_~r~1#1.base|) (or .cse7 (<= 0 .cse8) (forall ((v_ArrVal_354 Int) (|v_ULTIMATE.start_ring_enqueue_#t~mem6#1_137| Int)) (let ((.cse9 (store |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_~r#1.base| (let ((.cse12 (+ |c_ULTIMATE.start_ring_enqueue_~r#1.offset| 20))) (let ((.cse11 (let ((.cse13 (select |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_~r#1.base|))) (store .cse13 (+ |c_ULTIMATE.start_ring_enqueue_~r#1.offset| 4 (* (select .cse13 .cse12) 4)) |c_ULTIMATE.start_ring_enqueue_~x#1|)))) (store .cse11 .cse12 (+ (- 4) (mod (+ 1 (select .cse11 .cse12)) 4)))))))) (let ((.cse10 (select .cse9 |c_ULTIMATE.start_writer_fn_~r~1#1.base|))) (or (= (+ |c_reader_fnThread1of1ForFork0_~last~0#1| 1) (select (select (store .cse9 |c_ULTIMATE.start_writer_fn_~r~1#1.base| (store .cse10 (+ |c_ULTIMATE.start_writer_fn_~r~1#1.offset| (* |v_ULTIMATE.start_ring_enqueue_#t~mem6#1_137| 4) 4) v_ArrVal_354)) |c_reader_fnThread1of1ForFork0_~r~0#1.base|) (+ (* (select (select .cse9 |c_reader_fnThread1of1ForFork0_~r~0#1.base|) |c_reader_fnThread1of1ForFork0_~r~0#1.offset|) 4) |c_reader_fnThread1of1ForFork0_~r~0#1.offset| 4))) (< |v_ULTIMATE.start_ring_enqueue_#t~mem6#1_137| (select .cse10 (+ |c_ULTIMATE.start_writer_fn_~r~1#1.offset| 20)))))))) (or (and (< .cse8 0) (not .cse7)) (forall ((v_ArrVal_354 Int) (|v_ULTIMATE.start_ring_enqueue_#t~mem6#1_137| Int)) (let ((.cse15 (store |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_~r#1.base| (let ((.cse17 (+ |c_ULTIMATE.start_ring_enqueue_~r#1.offset| 20))) (let ((.cse16 (let ((.cse18 (select |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_~r#1.base|))) (store .cse18 (+ |c_ULTIMATE.start_ring_enqueue_~r#1.offset| 4 (* (select .cse18 .cse17) 4)) |c_ULTIMATE.start_ring_enqueue_~x#1|)))) (store .cse16 .cse17 (mod (+ 1 (select .cse16 .cse17)) 4))))))) (let ((.cse14 (select .cse15 |c_ULTIMATE.start_writer_fn_~r~1#1.base|))) (or (< |v_ULTIMATE.start_ring_enqueue_#t~mem6#1_137| (select .cse14 (+ |c_ULTIMATE.start_writer_fn_~r~1#1.offset| 20))) (= (select (select (store .cse15 |c_ULTIMATE.start_writer_fn_~r~1#1.base| (store .cse14 (+ |c_ULTIMATE.start_writer_fn_~r~1#1.offset| (* |v_ULTIMATE.start_ring_enqueue_#t~mem6#1_137| 4) 4) v_ArrVal_354)) |c_reader_fnThread1of1ForFork0_~r~0#1.base|) (+ |c_reader_fnThread1of1ForFork0_~r~0#1.offset| (* (select (select .cse15 |c_reader_fnThread1of1ForFork0_~r~0#1.base|) |c_reader_fnThread1of1ForFork0_~r~0#1.offset|) 4) 4)) (+ |c_reader_fnThread1of1ForFork0_~last~0#1| 1))))))) (= (select .cse19 (+ |c_ULTIMATE.start_writer_fn_~r~1#1.offset| 4)) 1) (= (select .cse0 0) 0) (or (and (< .cse1 0) (not .cse6)) (forall ((v_ArrVal_354 Int) (|v_ULTIMATE.start_ring_enqueue_#t~mem6#1_137| Int)) (let ((.cse20 (store |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_~r#1.base| (let ((.cse22 (select |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_~r#1.base|)) (.cse23 (+ |c_ULTIMATE.start_ring_enqueue_~r#1.offset| 20))) (store .cse22 .cse23 (mod (+ (select .cse22 .cse23) 1) 4)))))) (let ((.cse21 (select .cse20 |c_ULTIMATE.start_writer_fn_~r~1#1.base|))) (or (= (select (select (store .cse20 |c_ULTIMATE.start_writer_fn_~r~1#1.base| (store .cse21 (+ |c_ULTIMATE.start_writer_fn_~r~1#1.offset| (* |v_ULTIMATE.start_ring_enqueue_#t~mem6#1_137| 4) 4) v_ArrVal_354)) |c_reader_fnThread1of1ForFork0_~r~0#1.base|) (+ |c_reader_fnThread1of1ForFork0_~r~0#1.offset| (* (select (select .cse20 |c_reader_fnThread1of1ForFork0_~r~0#1.base|) |c_reader_fnThread1of1ForFork0_~r~0#1.offset|) 4) 4)) (+ |c_reader_fnThread1of1ForFork0_~last~0#1| 1)) (< |v_ULTIMATE.start_ring_enqueue_#t~mem6#1_137| (select .cse21 (+ |c_ULTIMATE.start_writer_fn_~r~1#1.offset| 20)))))))) (= (select .cse0 20) 1) (= |c_ULTIMATE.start_ring_enqueue_~r#1.offset| 0) (= |c_reader_fnThread1of1ForFork0_~r~0#1.offset| 0) (= (select .cse19 (+ |c_ULTIMATE.start_writer_fn_~r~1#1.offset| 20)) 1)))))) is different from false [2021-11-25 18:45:36,900 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_reader_fnThread1of1ForFork0_~r~0#1.base|))) (and (= |c_reader_fnThread1of1ForFork0_~r~0#1.base| |c_ULTIMATE.start_ring_enqueue_~r#1.base|) (= (select .cse0 4) 1) (= 0 |c_reader_fnThread1of1ForFork0_~last~0#1|) (forall ((v_ArrVal_354 Int) (|v_ULTIMATE.start_ring_enqueue_#t~mem6#1_137| Int)) (let ((.cse1 (select |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_~r#1.base|))) (or (= (+ |c_reader_fnThread1of1ForFork0_~last~0#1| 1) (select (select (store |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_~r#1.base| (store .cse1 (+ (* |v_ULTIMATE.start_ring_enqueue_#t~mem6#1_137| 4) |c_ULTIMATE.start_ring_enqueue_~r#1.offset| 4) v_ArrVal_354)) |c_reader_fnThread1of1ForFork0_~r~0#1.base|) (+ |c_reader_fnThread1of1ForFork0_~r~0#1.offset| (* (select (select |c_#memory_int| |c_reader_fnThread1of1ForFork0_~r~0#1.base|) |c_reader_fnThread1of1ForFork0_~r~0#1.offset|) 4) 4))) (< |v_ULTIMATE.start_ring_enqueue_#t~mem6#1_137| (select .cse1 (+ |c_ULTIMATE.start_ring_enqueue_~r#1.offset| 20)))))) (= (select .cse0 0) 0) (= (select .cse0 20) 1) (= |c_ULTIMATE.start_ring_enqueue_~r#1.offset| 0) (= |c_reader_fnThread1of1ForFork0_~r~0#1.offset| 0))) is different from false [2021-11-25 18:45:37,757 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse26 (select |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_~r#1.base|)) (.cse28 (+ |c_ULTIMATE.start_ring_enqueue_~r#1.offset| 20))) (let ((.cse27 (select .cse26 .cse28))) (let ((.cse31 (+ .cse27 1))) (let ((.cse30 (mod .cse31 4))) (let ((.cse6 (= .cse30 0))) (let ((.cse0 (select |c_#memory_int| |c_reader_fnThread1of1ForFork0_~r~0#1.base|)) (.cse8 (< .cse31 0)) (.cse9 (not .cse6)) (.cse1 (<= 0 .cse31)) (.cse7 (select |c_#memory_int| |c_ULTIMATE.start_writer_fn_~r~1#1.base|))) (and (= |c_reader_fnThread1of1ForFork0_~r~0#1.base| |c_ULTIMATE.start_ring_enqueue_~r#1.base|) (= (select .cse0 4) 1) (= 0 |c_reader_fnThread1of1ForFork0_~last~0#1|) (or .cse1 (forall ((v_ArrVal_354 Int) (|v_ULTIMATE.start_ring_enqueue_#t~mem6#1_137| Int)) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_~r#1.base| (let ((.cse4 (select |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_~r#1.base|)) (.cse5 (+ |c_ULTIMATE.start_ring_enqueue_~r#1.offset| 20))) (store .cse4 .cse5 (+ (- 4) (mod (+ (select .cse4 .cse5) 1) 4))))))) (let ((.cse2 (select .cse3 |c_ULTIMATE.start_writer_fn_~r~1#1.base|))) (or (< |v_ULTIMATE.start_ring_enqueue_#t~mem6#1_137| (select .cse2 (+ |c_ULTIMATE.start_writer_fn_~r~1#1.offset| 20))) (= (+ |c_reader_fnThread1of1ForFork0_~last~0#1| 1) (select (select (store .cse3 |c_ULTIMATE.start_writer_fn_~r~1#1.base| (store .cse2 (+ |c_ULTIMATE.start_writer_fn_~r~1#1.offset| (* |v_ULTIMATE.start_ring_enqueue_#t~mem6#1_137| 4) 4) v_ArrVal_354)) |c_reader_fnThread1of1ForFork0_~r~0#1.base|) (+ (* (select (select .cse3 |c_reader_fnThread1of1ForFork0_~r~0#1.base|) |c_reader_fnThread1of1ForFork0_~r~0#1.offset|) 4) |c_reader_fnThread1of1ForFork0_~r~0#1.offset| 4))))))) .cse6) (= |c_ULTIMATE.start_writer_fn_~r~1#1.offset| 0) (= |c_reader_fnThread1of1ForFork0_~r~0#1.base| |c_ULTIMATE.start_writer_fn_~r~1#1.base|) (= (select .cse7 (+ |c_ULTIMATE.start_writer_fn_~r~1#1.offset| 4)) 1) (= (select .cse0 0) 0) (or (and .cse8 .cse9) (forall ((v_ArrVal_354 Int) (|v_ULTIMATE.start_ring_enqueue_#t~mem6#1_137| Int)) (let ((.cse10 (store |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_~r#1.base| (let ((.cse12 (select |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_~r#1.base|)) (.cse13 (+ |c_ULTIMATE.start_ring_enqueue_~r#1.offset| 20))) (store .cse12 .cse13 (mod (+ (select .cse12 .cse13) 1) 4)))))) (let ((.cse11 (select .cse10 |c_ULTIMATE.start_writer_fn_~r~1#1.base|))) (or (= (select (select (store .cse10 |c_ULTIMATE.start_writer_fn_~r~1#1.base| (store .cse11 (+ |c_ULTIMATE.start_writer_fn_~r~1#1.offset| (* |v_ULTIMATE.start_ring_enqueue_#t~mem6#1_137| 4) 4) v_ArrVal_354)) |c_reader_fnThread1of1ForFork0_~r~0#1.base|) (+ |c_reader_fnThread1of1ForFork0_~r~0#1.offset| (* (select (select .cse10 |c_reader_fnThread1of1ForFork0_~r~0#1.base|) |c_reader_fnThread1of1ForFork0_~r~0#1.offset|) 4) 4)) (+ |c_reader_fnThread1of1ForFork0_~last~0#1| 1)) (< |v_ULTIMATE.start_ring_enqueue_#t~mem6#1_137| (select .cse11 (+ |c_ULTIMATE.start_writer_fn_~r~1#1.offset| 20)))))))) (= (select .cse0 20) 1) (let ((.cse29 (select .cse26 |c_ULTIMATE.start_ring_enqueue_~r#1.offset|))) (or (let ((.cse15 (+ 1 (select (store .cse26 (+ |c_ULTIMATE.start_ring_enqueue_~r#1.offset| 4 (* .cse27 4)) |c_ULTIMATE.start_ring_enqueue_~x#1|) .cse28)))) (let ((.cse14 (= (mod .cse15 4) 0))) (and (or .cse14 (<= 0 .cse15) (forall ((v_ArrVal_354 Int) (|v_ULTIMATE.start_ring_enqueue_#t~mem6#1_137| Int)) (let ((.cse16 (store |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_~r#1.base| (let ((.cse19 (+ |c_ULTIMATE.start_ring_enqueue_~r#1.offset| 20))) (let ((.cse18 (let ((.cse20 (select |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_~r#1.base|))) (store .cse20 (+ |c_ULTIMATE.start_ring_enqueue_~r#1.offset| 4 (* (select .cse20 .cse19) 4)) |c_ULTIMATE.start_ring_enqueue_~x#1|)))) (store .cse18 .cse19 (+ (- 4) (mod (+ 1 (select .cse18 .cse19)) 4)))))))) (let ((.cse17 (select .cse16 |c_ULTIMATE.start_writer_fn_~r~1#1.base|))) (or (= (+ |c_reader_fnThread1of1ForFork0_~last~0#1| 1) (select (select (store .cse16 |c_ULTIMATE.start_writer_fn_~r~1#1.base| (store .cse17 (+ |c_ULTIMATE.start_writer_fn_~r~1#1.offset| (* |v_ULTIMATE.start_ring_enqueue_#t~mem6#1_137| 4) 4) v_ArrVal_354)) |c_reader_fnThread1of1ForFork0_~r~0#1.base|) (+ (* (select (select .cse16 |c_reader_fnThread1of1ForFork0_~r~0#1.base|) |c_reader_fnThread1of1ForFork0_~r~0#1.offset|) 4) |c_reader_fnThread1of1ForFork0_~r~0#1.offset| 4))) (< |v_ULTIMATE.start_ring_enqueue_#t~mem6#1_137| (select .cse17 (+ |c_ULTIMATE.start_writer_fn_~r~1#1.offset| 20)))))))) (or (and (< .cse15 0) (not .cse14)) (forall ((v_ArrVal_354 Int) (|v_ULTIMATE.start_ring_enqueue_#t~mem6#1_137| Int)) (let ((.cse22 (store |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_~r#1.base| (let ((.cse24 (+ |c_ULTIMATE.start_ring_enqueue_~r#1.offset| 20))) (let ((.cse23 (let ((.cse25 (select |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_~r#1.base|))) (store .cse25 (+ |c_ULTIMATE.start_ring_enqueue_~r#1.offset| 4 (* (select .cse25 .cse24) 4)) |c_ULTIMATE.start_ring_enqueue_~x#1|)))) (store .cse23 .cse24 (mod (+ 1 (select .cse23 .cse24)) 4))))))) (let ((.cse21 (select .cse22 |c_ULTIMATE.start_writer_fn_~r~1#1.base|))) (or (< |v_ULTIMATE.start_ring_enqueue_#t~mem6#1_137| (select .cse21 (+ |c_ULTIMATE.start_writer_fn_~r~1#1.offset| 20))) (= (select (select (store .cse22 |c_ULTIMATE.start_writer_fn_~r~1#1.base| (store .cse21 (+ |c_ULTIMATE.start_writer_fn_~r~1#1.offset| (* |v_ULTIMATE.start_ring_enqueue_#t~mem6#1_137| 4) 4) v_ArrVal_354)) |c_reader_fnThread1of1ForFork0_~r~0#1.base|) (+ |c_reader_fnThread1of1ForFork0_~r~0#1.offset| (* (select (select .cse22 |c_reader_fnThread1of1ForFork0_~r~0#1.base|) |c_reader_fnThread1of1ForFork0_~r~0#1.offset|) 4) 4)) (+ |c_reader_fnThread1of1ForFork0_~last~0#1| 1)))))))))) (and .cse8 (= (+ .cse29 4) .cse30) .cse9) (and (= .cse29 .cse30) (or .cse1 .cse6)))) (= |c_ULTIMATE.start_ring_enqueue_~r#1.offset| 0) (= |c_reader_fnThread1of1ForFork0_~r~0#1.offset| 0) (= (select .cse7 (+ |c_ULTIMATE.start_writer_fn_~r~1#1.offset| 20)) 1)))))))) is different from false [2021-11-25 18:45:39,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:45:39,185 INFO L93 Difference]: Finished difference Result 499 states and 1112 transitions. [2021-11-25 18:45:39,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2021-11-25 18:45:39,186 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 46 states have (on average 1.434782608695652) internal successors, (66), 46 states have internal predecessors, (66), 0 states have call successors, (0), 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 23 [2021-11-25 18:45:39,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:45:39,190 INFO L225 Difference]: With dead ends: 499 [2021-11-25 18:45:39,190 INFO L226 Difference]: Without dead ends: 499 [2021-11-25 18:45:39,192 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 17 SyntacticMatches, 9 SemanticMatches, 72 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 1328 ImplicationChecksByTransitivity, 112.4s TimeCoverageRelationStatistics Valid=562, Invalid=4262, Unknown=22, NotChecked=556, Total=5402 [2021-11-25 18:45:39,193 INFO L933 BasicCegarLoop]: 9 mSDtfsCounter, 220 mSDsluCounter, 220 mSDsCounter, 0 mSdLazyCounter, 1047 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 220 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 2321 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 1047 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1252 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2021-11-25 18:45:39,193 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [220 Valid, 186 Invalid, 2321 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 1047 Invalid, 0 Unknown, 1252 Unchecked, 0.9s Time] [2021-11-25 18:45:39,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 499 states. [2021-11-25 18:45:39,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 499 to 405. [2021-11-25 18:45:39,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 405 states, 402 states have (on average 2.291044776119403) internal successors, (921), 404 states have internal predecessors, (921), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:45:39,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 405 states to 405 states and 921 transitions. [2021-11-25 18:45:39,207 INFO L78 Accepts]: Start accepts. Automaton has 405 states and 921 transitions. Word has length 23 [2021-11-25 18:45:39,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:45:39,208 INFO L470 AbstractCegarLoop]: Abstraction has 405 states and 921 transitions. [2021-11-25 18:45:39,208 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 46 states have (on average 1.434782608695652) internal successors, (66), 46 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:45:39,209 INFO L276 IsEmpty]: Start isEmpty. Operand 405 states and 921 transitions. [2021-11-25 18:45:39,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-11-25 18:45:39,210 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:45:39,210 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 18:45:39,243 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57ca2f2b-7a1b-4211-a914-b6836eaa190b/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-11-25 18:45:39,437 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57ca2f2b-7a1b-4211-a914-b6836eaa190b/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2021-11-25 18:45:39,438 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2021-11-25 18:45:39,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:45:39,438 INFO L85 PathProgramCache]: Analyzing trace with hash -1587183499, now seen corresponding path program 11 times [2021-11-25 18:45:39,438 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:45:39,438 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [492812649] [2021-11-25 18:45:39,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:45:39,439 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:45:39,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:45:40,798 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 18:45:40,798 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:45:40,798 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [492812649] [2021-11-25 18:45:40,798 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [492812649] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 18:45:40,798 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [429264880] [2021-11-25 18:45:40,798 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-25 18:45:40,799 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:45:40,799 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57ca2f2b-7a1b-4211-a914-b6836eaa190b/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 18:45:40,799 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57ca2f2b-7a1b-4211-a914-b6836eaa190b/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 18:45:40,800 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57ca2f2b-7a1b-4211-a914-b6836eaa190b/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-11-25 18:45:40,920 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-11-25 18:45:40,920 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-25 18:45:40,923 WARN L261 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 121 conjunts are in the unsatisfiable core [2021-11-25 18:45:40,926 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 18:45:40,945 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:45:40,945 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 [2021-11-25 18:45:40,948 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:45:40,949 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 [2021-11-25 18:45:40,953 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2021-11-25 18:45:41,561 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-25 18:45:41,562 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:45:41,563 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:45:41,563 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-25 18:45:41,579 INFO L354 Elim1Store]: treesize reduction 38, result has 30.9 percent of original size [2021-11-25 18:45:41,580 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 67 treesize of output 50 [2021-11-25 18:45:41,735 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:45:41,747 INFO L354 Elim1Store]: treesize reduction 39, result has 15.2 percent of original size [2021-11-25 18:45:41,748 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 72 treesize of output 53 [2021-11-25 18:45:42,298 INFO L354 Elim1Store]: treesize reduction 87, result has 27.5 percent of original size [2021-11-25 18:45:42,299 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 70 treesize of output 72 [2021-11-25 18:45:42,415 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:45:42,416 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:45:42,418 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 18:45:42,418 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 42 treesize of output 18 [2021-11-25 18:45:42,427 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 18:45:42,428 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 18:45:55,192 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_411 Int) (v_ArrVal_410 Int)) (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~#r~2#1.base|))) (or (= v_ArrVal_410 (select .cse0 |c_ULTIMATE.start_main_~#r~2#1.offset|)) (= (let ((.cse1 (let ((.cse2 (+ |c_ULTIMATE.start_main_~#r~2#1.offset| 20))) (store (store .cse0 (+ |c_ULTIMATE.start_main_~#r~2#1.offset| (* (select .cse0 .cse2) 4) 4) 1) .cse2 v_ArrVal_410)))) (select (store .cse1 (+ |c_ULTIMATE.start_main_~#r~2#1.offset| 4 (* v_ArrVal_410 4)) v_ArrVal_411) (+ |c_ULTIMATE.start_main_~#r~2#1.offset| (* (select .cse1 |c_ULTIMATE.start_main_~#r~2#1.offset|) 4) 4))) 1)))) is different from false [2021-11-25 18:45:55,194 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 18:45:55,194 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [429264880] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 18:45:55,194 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [823813941] [2021-11-25 18:45:55,195 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:1603) 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:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) 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) [2021-11-25 18:45:55,196 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 18:45:55,196 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 15, 15] total 43 [2021-11-25 18:45:55,196 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1070188049] [2021-11-25 18:45:55,196 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 18:45:55,197 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2021-11-25 18:45:55,197 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:45:55,197 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2021-11-25 18:45:55,198 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=154, Invalid=1736, Unknown=6, NotChecked=84, Total=1980 [2021-11-25 18:45:55,199 INFO L87 Difference]: Start difference. First operand 405 states and 921 transitions. Second operand has 45 states, 44 states have (on average 1.4545454545454546) internal successors, (64), 44 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:45:58,659 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| |c_reader_fnThread1of1ForFork0_~r~0#1.base|))) (let ((.cse17 (select .cse2 |c_reader_fnThread1of1ForFork0_~r~0#1.offset|))) (let ((.cse1 (* |c_reader_fnThread1of1ForFork0_ring_empty_#t~mem11#1| 4)) (.cse3 (select |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_~r#1.base|)) (.cse5 (+ (* 4 .cse17) 4)) (.cse0 (select |c_#memory_int| |c_ULTIMATE.start_writer_fn_~r~1#1.base|)) (.cse4 (+ (* .cse17 4) 4))) (and (= |c_reader_fnThread1of1ForFork0_~r~0#1.base| |c_ULTIMATE.start_ring_enqueue_~r#1.base|) (= 0 |c_reader_fnThread1of1ForFork0_~last~0#1|) (= (select .cse0 (+ |c_ULTIMATE.start_writer_fn_~r~1#1.offset| .cse1 4)) 1) (= (select .cse2 (+ .cse1 4)) 1) (= (select .cse3 .cse4) 1) (<= .cse5 (* 4 (select .cse3 (+ |c_ULTIMATE.start_ring_enqueue_~r#1.offset| 20)))) (<= .cse5 (* 4 (select .cse0 (+ |c_ULTIMATE.start_writer_fn_~r~1#1.offset| 20)))) (= |c_ULTIMATE.start_writer_fn_~r~1#1.offset| 0) (= |c_reader_fnThread1of1ForFork0_~r~0#1.base| |c_ULTIMATE.start_writer_fn_~r~1#1.base|) (= |c_reader_fnThread1of1ForFork0_ring_empty_#t~mem11#1| (select (select |c_#memory_int| |c_reader_fnThread1of1ForFork0_ring_empty_~r#1.base|) |c_reader_fnThread1of1ForFork0_ring_empty_~r#1.offset|)) (<= 0 (* 4 |c_reader_fnThread1of1ForFork0_ring_empty_#t~mem11#1|)) (forall ((v_ArrVal_411 Int) (v_ArrVal_410 Int)) (let ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_~r#1.base| (let ((.cse10 (+ |c_ULTIMATE.start_ring_enqueue_~r#1.offset| 20))) (store (let ((.cse9 (select |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_~r#1.base|))) (store .cse9 (+ |c_ULTIMATE.start_ring_enqueue_~r#1.offset| 4 (* (select .cse9 .cse10) 4)) |c_ULTIMATE.start_ring_enqueue_~x#1|)) .cse10 v_ArrVal_410))))) (let ((.cse6 (select .cse7 |c_reader_fnThread1of1ForFork0_~r~0#1.base|))) (or (= (select .cse6 (+ |c_reader_fnThread1of1ForFork0_~r~0#1.offset| 20)) (select (select |c_#memory_int| |c_reader_fnThread1of1ForFork0_~r~0#1.base|) |c_reader_fnThread1of1ForFork0_~r~0#1.offset|)) (= (select (select (store .cse7 |c_ULTIMATE.start_writer_fn_~r~1#1.base| (let ((.cse8 (select .cse7 |c_ULTIMATE.start_writer_fn_~r~1#1.base|))) (store .cse8 (+ |c_ULTIMATE.start_writer_fn_~r~1#1.offset| (* (select .cse8 (+ |c_ULTIMATE.start_writer_fn_~r~1#1.offset| 20)) 4) 4) v_ArrVal_411))) |c_reader_fnThread1of1ForFork0_~r~0#1.base|) (+ |c_reader_fnThread1of1ForFork0_~r~0#1.offset| (* (select .cse6 |c_reader_fnThread1of1ForFork0_~r~0#1.offset|) 4) 4)) (+ |c_reader_fnThread1of1ForFork0_~last~0#1| 1)))))) (= |c_reader_fnThread1of1ForFork0_ring_empty_~r#1.offset| |c_reader_fnThread1of1ForFork0_~r~0#1.offset|) (forall ((v_ArrVal_411 Int) (v_ArrVal_410 Int)) (let ((.cse11 (store |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_~r#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_~r#1.base|) (+ |c_ULTIMATE.start_ring_enqueue_~r#1.offset| 20) v_ArrVal_410)))) (or (= (select (select .cse11 |c_reader_fnThread1of1ForFork0_ring_empty_~r#1.base|) (+ |c_reader_fnThread1of1ForFork0_ring_empty_~r#1.offset| 20)) |c_reader_fnThread1of1ForFork0_ring_empty_#t~mem11#1|) (= (+ |c_reader_fnThread1of1ForFork0_~last~0#1| 1) (select (select (store .cse11 |c_ULTIMATE.start_writer_fn_~r~1#1.base| (let ((.cse12 (select .cse11 |c_ULTIMATE.start_writer_fn_~r~1#1.base|))) (store .cse12 (+ |c_ULTIMATE.start_writer_fn_~r~1#1.offset| (* (select .cse12 (+ |c_ULTIMATE.start_writer_fn_~r~1#1.offset| 20)) 4) 4) v_ArrVal_411))) |c_reader_fnThread1of1ForFork0_~r~0#1.base|) (+ (* (select (select .cse11 |c_reader_fnThread1of1ForFork0_~r~0#1.base|) |c_reader_fnThread1of1ForFork0_~r~0#1.offset|) 4) |c_reader_fnThread1of1ForFork0_~r~0#1.offset| 4)))))) (forall ((v_ArrVal_411 Int) (v_ArrVal_410 Int)) (let ((.cse13 (store |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_~r#1.base| (let ((.cse16 (+ |c_ULTIMATE.start_ring_enqueue_~r#1.offset| 20))) (store (let ((.cse15 (select |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_~r#1.base|))) (store .cse15 (+ |c_ULTIMATE.start_ring_enqueue_~r#1.offset| 4 (* (select .cse15 .cse16) 4)) |c_ULTIMATE.start_ring_enqueue_~x#1|)) .cse16 v_ArrVal_410))))) (or (= |c_reader_fnThread1of1ForFork0_ring_empty_#t~mem11#1| (select (select .cse13 |c_reader_fnThread1of1ForFork0_ring_empty_~r#1.base|) (+ |c_reader_fnThread1of1ForFork0_ring_empty_~r#1.offset| 20))) (= (select (select (store .cse13 |c_ULTIMATE.start_writer_fn_~r~1#1.base| (let ((.cse14 (select .cse13 |c_ULTIMATE.start_writer_fn_~r~1#1.base|))) (store .cse14 (+ |c_ULTIMATE.start_writer_fn_~r~1#1.offset| (* (select .cse14 (+ |c_ULTIMATE.start_writer_fn_~r~1#1.offset| 20)) 4) 4) v_ArrVal_411))) |c_reader_fnThread1of1ForFork0_~r~0#1.base|) (+ |c_reader_fnThread1of1ForFork0_~r~0#1.offset| (* (select (select .cse13 |c_reader_fnThread1of1ForFork0_~r~0#1.base|) |c_reader_fnThread1of1ForFork0_~r~0#1.offset|) 4) 4)) (+ |c_reader_fnThread1of1ForFork0_~last~0#1| 1))))) (= (select .cse0 .cse4) 1) (= |c_reader_fnThread1of1ForFork0_~r~0#1.base| |c_reader_fnThread1of1ForFork0_ring_empty_~r#1.base|) (= |c_ULTIMATE.start_ring_enqueue_~r#1.offset| 0) (<= |c_reader_fnThread1of1ForFork0_ring_empty_#t~mem11#1| 0) (= |c_reader_fnThread1of1ForFork0_~r~0#1.offset| 0))))) is different from false [2021-11-25 18:45:59,354 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| |c_reader_fnThread1of1ForFork0_~r~0#1.base|))) (let ((.cse17 (select .cse2 |c_reader_fnThread1of1ForFork0_~r~0#1.offset|))) (let ((.cse1 (* |c_reader_fnThread1of1ForFork0_ring_empty_#t~mem11#1| 4)) (.cse3 (select |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_~r#1.base|)) (.cse5 (+ (* 4 .cse17) 4)) (.cse0 (select |c_#memory_int| |c_ULTIMATE.start_writer_fn_~r~1#1.base|)) (.cse4 (+ (* .cse17 4) 4))) (and (= |c_reader_fnThread1of1ForFork0_~r~0#1.base| |c_ULTIMATE.start_ring_enqueue_~r#1.base|) (= 0 |c_reader_fnThread1of1ForFork0_~last~0#1|) (= (select .cse0 (+ |c_ULTIMATE.start_writer_fn_~r~1#1.offset| .cse1 4)) 1) (= (select .cse2 (+ .cse1 4)) 1) (= (select .cse3 .cse4) 1) (<= .cse5 (* 4 (select .cse0 (+ |c_ULTIMATE.start_writer_fn_~r~1#1.offset| 20)))) (= |c_ULTIMATE.start_writer_fn_~r~1#1.offset| 0) (= |c_reader_fnThread1of1ForFork0_~r~0#1.base| |c_ULTIMATE.start_writer_fn_~r~1#1.base|) (= |c_reader_fnThread1of1ForFork0_ring_empty_#t~mem11#1| (select (select |c_#memory_int| |c_reader_fnThread1of1ForFork0_ring_empty_~r#1.base|) |c_reader_fnThread1of1ForFork0_ring_empty_~r#1.offset|)) (<= 0 (* 4 |c_reader_fnThread1of1ForFork0_ring_empty_#t~mem11#1|)) (forall ((v_ArrVal_411 Int) (v_ArrVal_410 Int)) (let ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_~r#1.base| (let ((.cse10 (+ |c_ULTIMATE.start_ring_enqueue_~r#1.offset| 20))) (store (let ((.cse9 (select |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_~r#1.base|))) (store .cse9 (+ |c_ULTIMATE.start_ring_enqueue_~r#1.offset| 4 (* (select .cse9 .cse10) 4)) |c_ULTIMATE.start_ring_enqueue_~x#1|)) .cse10 v_ArrVal_410))))) (let ((.cse6 (select .cse7 |c_reader_fnThread1of1ForFork0_~r~0#1.base|))) (or (= (select .cse6 (+ |c_reader_fnThread1of1ForFork0_~r~0#1.offset| 20)) (select (select |c_#memory_int| |c_reader_fnThread1of1ForFork0_~r~0#1.base|) |c_reader_fnThread1of1ForFork0_~r~0#1.offset|)) (= (select (select (store .cse7 |c_ULTIMATE.start_writer_fn_~r~1#1.base| (let ((.cse8 (select .cse7 |c_ULTIMATE.start_writer_fn_~r~1#1.base|))) (store .cse8 (+ |c_ULTIMATE.start_writer_fn_~r~1#1.offset| (* (select .cse8 (+ |c_ULTIMATE.start_writer_fn_~r~1#1.offset| 20)) 4) 4) v_ArrVal_411))) |c_reader_fnThread1of1ForFork0_~r~0#1.base|) (+ |c_reader_fnThread1of1ForFork0_~r~0#1.offset| (* (select .cse6 |c_reader_fnThread1of1ForFork0_~r~0#1.offset|) 4) 4)) (+ |c_reader_fnThread1of1ForFork0_~last~0#1| 1)))))) (= |c_reader_fnThread1of1ForFork0_ring_empty_~r#1.offset| |c_reader_fnThread1of1ForFork0_~r~0#1.offset|) (forall ((v_ArrVal_411 Int) (v_ArrVal_410 Int)) (let ((.cse11 (store |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_~r#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_~r#1.base|) (+ |c_ULTIMATE.start_ring_enqueue_~r#1.offset| 20) v_ArrVal_410)))) (or (= (select (select .cse11 |c_reader_fnThread1of1ForFork0_ring_empty_~r#1.base|) (+ |c_reader_fnThread1of1ForFork0_ring_empty_~r#1.offset| 20)) |c_reader_fnThread1of1ForFork0_ring_empty_#t~mem11#1|) (= (+ |c_reader_fnThread1of1ForFork0_~last~0#1| 1) (select (select (store .cse11 |c_ULTIMATE.start_writer_fn_~r~1#1.base| (let ((.cse12 (select .cse11 |c_ULTIMATE.start_writer_fn_~r~1#1.base|))) (store .cse12 (+ |c_ULTIMATE.start_writer_fn_~r~1#1.offset| (* (select .cse12 (+ |c_ULTIMATE.start_writer_fn_~r~1#1.offset| 20)) 4) 4) v_ArrVal_411))) |c_reader_fnThread1of1ForFork0_~r~0#1.base|) (+ (* (select (select .cse11 |c_reader_fnThread1of1ForFork0_~r~0#1.base|) |c_reader_fnThread1of1ForFork0_~r~0#1.offset|) 4) |c_reader_fnThread1of1ForFork0_~r~0#1.offset| 4)))))) (= |c_ULTIMATE.start_ring_enqueue_#t~mem4#1| (select .cse3 (+ |c_ULTIMATE.start_ring_enqueue_~r#1.offset| 20))) (forall ((v_ArrVal_411 Int) (v_ArrVal_410 Int)) (let ((.cse13 (store |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_~r#1.base| (let ((.cse16 (+ |c_ULTIMATE.start_ring_enqueue_~r#1.offset| 20))) (store (let ((.cse15 (select |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_~r#1.base|))) (store .cse15 (+ |c_ULTIMATE.start_ring_enqueue_~r#1.offset| 4 (* (select .cse15 .cse16) 4)) |c_ULTIMATE.start_ring_enqueue_~x#1|)) .cse16 v_ArrVal_410))))) (or (= |c_reader_fnThread1of1ForFork0_ring_empty_#t~mem11#1| (select (select .cse13 |c_reader_fnThread1of1ForFork0_ring_empty_~r#1.base|) (+ |c_reader_fnThread1of1ForFork0_ring_empty_~r#1.offset| 20))) (= (select (select (store .cse13 |c_ULTIMATE.start_writer_fn_~r~1#1.base| (let ((.cse14 (select .cse13 |c_ULTIMATE.start_writer_fn_~r~1#1.base|))) (store .cse14 (+ |c_ULTIMATE.start_writer_fn_~r~1#1.offset| (* (select .cse14 (+ |c_ULTIMATE.start_writer_fn_~r~1#1.offset| 20)) 4) 4) v_ArrVal_411))) |c_reader_fnThread1of1ForFork0_~r~0#1.base|) (+ |c_reader_fnThread1of1ForFork0_~r~0#1.offset| (* (select (select .cse13 |c_reader_fnThread1of1ForFork0_~r~0#1.base|) |c_reader_fnThread1of1ForFork0_~r~0#1.offset|) 4) 4)) (+ |c_reader_fnThread1of1ForFork0_~last~0#1| 1))))) (<= .cse5 (* 4 |c_ULTIMATE.start_ring_enqueue_#t~mem4#1|)) (= (select .cse0 .cse4) 1) (= |c_reader_fnThread1of1ForFork0_~r~0#1.base| |c_reader_fnThread1of1ForFork0_ring_empty_~r#1.base|) (= |c_ULTIMATE.start_ring_enqueue_~r#1.offset| 0) (<= |c_reader_fnThread1of1ForFork0_ring_empty_#t~mem11#1| 0) (= |c_reader_fnThread1of1ForFork0_~r~0#1.offset| 0))))) is different from false [2021-11-25 18:46:04,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:46:04,631 INFO L93 Difference]: Finished difference Result 655 states and 1486 transitions. [2021-11-25 18:46:04,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2021-11-25 18:46:04,631 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 44 states have (on average 1.4545454545454546) internal successors, (64), 44 states have internal predecessors, (64), 0 states have call successors, (0), 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 23 [2021-11-25 18:46:04,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:46:04,637 INFO L225 Difference]: With dead ends: 655 [2021-11-25 18:46:04,637 INFO L226 Difference]: Without dead ends: 655 [2021-11-25 18:46:04,641 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 29 SyntacticMatches, 5 SemanticMatches, 88 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 1730 ImplicationChecksByTransitivity, 21.2s TimeCoverageRelationStatistics Valid=819, Invalid=6666, Unknown=9, NotChecked=516, Total=8010 [2021-11-25 18:46:04,642 INFO L933 BasicCegarLoop]: 4 mSDtfsCounter, 218 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 1929 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 218 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 3789 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 1929 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1771 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2021-11-25 18:46:04,642 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [218 Valid, 120 Invalid, 3789 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 1929 Invalid, 0 Unknown, 1771 Unchecked, 1.7s Time] [2021-11-25 18:46:04,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 655 states. [2021-11-25 18:46:04,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 655 to 469. [2021-11-25 18:46:04,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 469 states, 466 states have (on average 2.3218884120171674) internal successors, (1082), 468 states have internal predecessors, (1082), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:46:04,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 469 states to 469 states and 1082 transitions. [2021-11-25 18:46:04,662 INFO L78 Accepts]: Start accepts. Automaton has 469 states and 1082 transitions. Word has length 23 [2021-11-25 18:46:04,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:46:04,663 INFO L470 AbstractCegarLoop]: Abstraction has 469 states and 1082 transitions. [2021-11-25 18:46:04,663 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 44 states have (on average 1.4545454545454546) internal successors, (64), 44 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:46:04,663 INFO L276 IsEmpty]: Start isEmpty. Operand 469 states and 1082 transitions. [2021-11-25 18:46:04,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-11-25 18:46:04,664 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:46:04,665 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 18:46:04,709 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57ca2f2b-7a1b-4211-a914-b6836eaa190b/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-11-25 18:46:04,885 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57ca2f2b-7a1b-4211-a914-b6836eaa190b/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2021-11-25 18:46:04,886 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2021-11-25 18:46:04,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:46:04,886 INFO L85 PathProgramCache]: Analyzing trace with hash 1155374787, now seen corresponding path program 12 times [2021-11-25 18:46:04,886 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:46:04,886 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [708409933] [2021-11-25 18:46:04,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:46:04,887 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:46:04,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:46:06,868 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 18:46:06,868 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:46:06,868 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [708409933] [2021-11-25 18:46:06,868 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [708409933] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 18:46:06,869 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1050058521] [2021-11-25 18:46:06,869 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-11-25 18:46:06,869 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:46:06,869 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57ca2f2b-7a1b-4211-a914-b6836eaa190b/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 18:46:06,870 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57ca2f2b-7a1b-4211-a914-b6836eaa190b/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 18:46:06,896 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57ca2f2b-7a1b-4211-a914-b6836eaa190b/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-11-25 18:46:07,018 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-11-25 18:46:07,018 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-25 18:46:07,023 WARN L261 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 120 conjunts are in the unsatisfiable core [2021-11-25 18:46:07,027 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 18:46:07,050 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:46:07,051 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 [2021-11-25 18:46:07,059 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:46:07,060 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 [2021-11-25 18:46:07,066 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2021-11-25 18:46:07,617 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:46:07,617 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-25 18:46:07,633 INFO L354 Elim1Store]: treesize reduction 38, result has 30.9 percent of original size [2021-11-25 18:46:07,633 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 [2021-11-25 18:46:07,787 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:46:07,788 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:46:07,788 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:46:07,798 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 0 case distinctions, treesize of input 49 treesize of output 39 [2021-11-25 18:46:08,089 INFO L354 Elim1Store]: treesize reduction 48, result has 31.4 percent of original size [2021-11-25 18:46:08,089 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 4 new quantified variables, introduced 6 case distinctions, treesize of input 41 treesize of output 45 [2021-11-25 18:46:08,188 INFO L354 Elim1Store]: treesize reduction 22, result has 12.0 percent of original size [2021-11-25 18:46:08,188 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 37 treesize of output 23 [2021-11-25 18:46:08,216 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 18:46:08,217 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 18:46:55,338 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 18:46:55,339 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1050058521] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 18:46:55,339 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1669316384] [2021-11-25 18:46:55,340 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:1603) 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:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) 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) [2021-11-25 18:46:55,340 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 18:46:55,340 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 15, 16] total 47 [2021-11-25 18:46:55,341 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1927325176] [2021-11-25 18:46:55,341 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 18:46:55,341 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2021-11-25 18:46:55,341 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:46:55,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2021-11-25 18:46:55,343 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=199, Invalid=2141, Unknown=12, NotChecked=0, Total=2352 [2021-11-25 18:46:55,343 INFO L87 Difference]: Start difference. First operand 469 states and 1082 transitions. Second operand has 49 states, 48 states have (on average 1.375) internal successors, (66), 48 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:47:14,652 WARN L227 SmtUtils]: Spent 11.97s on a formula simplification. DAG size of input: 116 DAG size of output: 69 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-11-25 18:47:26,915 WARN L227 SmtUtils]: Spent 5.12s on a formula simplification. DAG size of input: 103 DAG size of output: 67 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-11-25 18:47:43,168 WARN L227 SmtUtils]: Spent 5.43s on a formula simplification. DAG size of input: 78 DAG size of output: 54 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-11-25 18:48:10,317 WARN L227 SmtUtils]: Spent 6.00s on a formula simplification. DAG size of input: 92 DAG size of output: 56 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-11-25 18:48:32,059 WARN L227 SmtUtils]: Spent 11.63s on a formula simplification that was a NOOP. DAG size: 71 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-11-25 18:49:27,920 WARN L227 SmtUtils]: Spent 20.14s on a formula simplification. DAG size of input: 86 DAG size of output: 73 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-11-25 18:49:49,110 WARN L227 SmtUtils]: Spent 11.33s on a formula simplification that was a NOOP. DAG size: 84 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-11-25 18:50:22,553 WARN L227 SmtUtils]: Spent 18.90s on a formula simplification. DAG size of input: 99 DAG size of output: 86 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-11-25 18:50:50,794 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_466 Int)) (= (+ |c_reader_fnThread1of1ForFork0_~last~0#1| 1) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_~r#1.base| (let ((.cse1 (select |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_~r#1.base|))) (store .cse1 (+ |c_ULTIMATE.start_ring_enqueue_~r#1.offset| 4 (* (select .cse1 (+ |c_ULTIMATE.start_ring_enqueue_~r#1.offset| 20)) 4)) v_ArrVal_466))) |c_reader_fnThread1of1ForFork0_~r~0#1.base|))) (select .cse0 (+ |c_reader_fnThread1of1ForFork0_~r~0#1.offset| 4 (* (select .cse0 |c_reader_fnThread1of1ForFork0_~r~0#1.offset|) 4)))))) (forall ((v_ArrVal_466 Int)) (= (+ |c_reader_fnThread1of1ForFork0_~last~0#1| 1) (let ((.cse2 (select (store |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_~r#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_~r#1.base|) (+ (* |c_ULTIMATE.start_ring_enqueue_#t~mem6#1| 4) |c_ULTIMATE.start_ring_enqueue_~r#1.offset| 4) v_ArrVal_466)) |c_reader_fnThread1of1ForFork0_~r~0#1.base|))) (select .cse2 (+ (* (select .cse2 |c_reader_fnThread1of1ForFork0_~r~0#1.offset|) 4) |c_reader_fnThread1of1ForFork0_~r~0#1.offset| 4)))))) is different from false [2021-11-25 18:51:07,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:51:07,640 INFO L93 Difference]: Finished difference Result 816 states and 1870 transitions. [2021-11-25 18:51:07,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2021-11-25 18:51:07,641 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 48 states have (on average 1.375) internal successors, (66), 48 states have internal predecessors, (66), 0 states have call successors, (0), 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 23 [2021-11-25 18:51:07,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:51:07,647 INFO L225 Difference]: With dead ends: 816 [2021-11-25 18:51:07,647 INFO L226 Difference]: Without dead ends: 816 [2021-11-25 18:51:07,650 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 20 SyntacticMatches, 18 SemanticMatches, 102 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 3254 ImplicationChecksByTransitivity, 298.8s TimeCoverageRelationStatistics Valid=1201, Invalid=9246, Unknown=63, NotChecked=202, Total=10712 [2021-11-25 18:51:07,651 INFO L933 BasicCegarLoop]: 13 mSDtfsCounter, 352 mSDsluCounter, 262 mSDsCounter, 0 mSdLazyCounter, 1255 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 352 SdHoareTripleChecker+Valid, 241 SdHoareTripleChecker+Invalid, 3143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 1255 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1789 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2021-11-25 18:51:07,652 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [352 Valid, 241 Invalid, 3143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 1255 Invalid, 0 Unknown, 1789 Unchecked, 1.0s Time] [2021-11-25 18:51:07,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 816 states. [2021-11-25 18:51:07,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 816 to 612. [2021-11-25 18:51:07,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 612 states, 609 states have (on average 2.3563218390804597) internal successors, (1435), 611 states have internal predecessors, (1435), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:51:07,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 612 states to 612 states and 1435 transitions. [2021-11-25 18:51:07,675 INFO L78 Accepts]: Start accepts. Automaton has 612 states and 1435 transitions. Word has length 23 [2021-11-25 18:51:07,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:51:07,675 INFO L470 AbstractCegarLoop]: Abstraction has 612 states and 1435 transitions. [2021-11-25 18:51:07,675 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 48 states have (on average 1.375) internal successors, (66), 48 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:51:07,676 INFO L276 IsEmpty]: Start isEmpty. Operand 612 states and 1435 transitions. [2021-11-25 18:51:07,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-11-25 18:51:07,677 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:51:07,677 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 18:51:07,716 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57ca2f2b-7a1b-4211-a914-b6836eaa190b/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2021-11-25 18:51:07,897 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57ca2f2b-7a1b-4211-a914-b6836eaa190b/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:51:07,898 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2021-11-25 18:51:07,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:51:07,898 INFO L85 PathProgramCache]: Analyzing trace with hash 1405619187, now seen corresponding path program 13 times [2021-11-25 18:51:07,898 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:51:07,898 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1791470528] [2021-11-25 18:51:07,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:51:07,898 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:51:07,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:51:09,182 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 18:51:09,182 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:51:09,184 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1791470528] [2021-11-25 18:51:09,184 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1791470528] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 18:51:09,184 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1717419154] [2021-11-25 18:51:09,184 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-11-25 18:51:09,185 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:51:09,185 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57ca2f2b-7a1b-4211-a914-b6836eaa190b/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 18:51:09,185 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57ca2f2b-7a1b-4211-a914-b6836eaa190b/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 18:51:09,186 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57ca2f2b-7a1b-4211-a914-b6836eaa190b/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-11-25 18:51:09,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:51:09,295 WARN L261 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 120 conjunts are in the unsatisfiable core [2021-11-25 18:51:09,301 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 18:51:09,312 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:51:09,313 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 [2021-11-25 18:51:09,316 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:51:09,317 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 [2021-11-25 18:51:09,320 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2021-11-25 18:51:09,701 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:51:09,702 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-25 18:51:09,714 INFO L354 Elim1Store]: treesize reduction 38, result has 30.9 percent of original size [2021-11-25 18:51:09,714 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 [2021-11-25 18:51:09,862 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:51:09,863 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:51:09,864 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:51:09,866 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 0 case distinctions, treesize of input 52 treesize of output 42 [2021-11-25 18:51:10,154 INFO L354 Elim1Store]: treesize reduction 97, result has 24.2 percent of original size [2021-11-25 18:51:10,155 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 10 case distinctions, treesize of input 53 treesize of output 59 [2021-11-25 18:51:10,238 INFO L354 Elim1Store]: treesize reduction 14, result has 17.6 percent of original size [2021-11-25 18:51:10,238 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 [2021-11-25 18:51:10,246 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 18:51:10,246 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 18:51:15,457 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_ring_enqueue_#t~mem6#1_152| Int) (v_ArrVal_523 Int)) (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_writer_fn_~r~1#1.base|))) (or (< |v_ULTIMATE.start_ring_enqueue_#t~mem6#1_152| (select .cse0 (+ |c_ULTIMATE.start_writer_fn_~r~1#1.offset| 20))) (= (+ |c_reader_fnThread1of1ForFork0_~last~0#1| 1) (select (select (store |c_#memory_int| |c_ULTIMATE.start_writer_fn_~r~1#1.base| (store .cse0 (+ (* |v_ULTIMATE.start_ring_enqueue_#t~mem6#1_152| 4) |c_ULTIMATE.start_writer_fn_~r~1#1.offset| 4) v_ArrVal_523)) |c_reader_fnThread1of1ForFork0_~r~0#1.base|) (+ |c_reader_fnThread1of1ForFork0_~r~0#1.offset| (* (select (select |c_#memory_int| |c_reader_fnThread1of1ForFork0_~r~0#1.base|) |c_reader_fnThread1of1ForFork0_~r~0#1.offset|) 4) 4)))))) is different from false [2021-11-25 18:52:37,019 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2021-11-25 18:52:37,020 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1717419154] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 18:52:37,020 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1858554891] [2021-11-25 18:52:37,021 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:1603) 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:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) 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) [2021-11-25 18:52:37,021 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 18:52:37,021 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 15, 16] total 42 [2021-11-25 18:52:37,021 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [720117320] [2021-11-25 18:52:37,021 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 18:52:37,022 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2021-11-25 18:52:37,022 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:52:37,022 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2021-11-25 18:52:37,023 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=161, Invalid=1623, Unknown=26, NotChecked=82, Total=1892 [2021-11-25 18:52:37,023 INFO L87 Difference]: Start difference. First operand 612 states and 1435 transitions. Second operand has 44 states, 43 states have (on average 1.441860465116279) internal successors, (62), 43 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:52:39,185 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_~r#1.base|)) (.cse0 (select |c_#memory_int| |c_ULTIMATE.start_writer_fn_~r~1#1.base|))) (and (= |c_reader_fnThread1of1ForFork0_~r~0#1.base| |c_ULTIMATE.start_ring_enqueue_~r#1.base|) (= 0 |c_reader_fnThread1of1ForFork0_~last~0#1|) (= |c_ULTIMATE.start_writer_fn_~r~1#1.offset| 0) (= |c_reader_fnThread1of1ForFork0_~r~0#1.base| |c_ULTIMATE.start_writer_fn_~r~1#1.base|) (<= 4 (* 4 (select .cse0 20))) (<= 4 (* 4 (select .cse1 (+ |c_ULTIMATE.start_ring_enqueue_~r#1.offset| 20)))) (= (select .cse1 4) 1) (= (select (select |c_#memory_int| |c_reader_fnThread1of1ForFork0_~r~0#1.base|) |c_reader_fnThread1of1ForFork0_~r~0#1.offset|) 0) (= (select .cse0 4) 1) (forall ((|v_ULTIMATE.start_ring_enqueue_#t~mem6#1_152| Int) (v_ArrVal_523 Int)) (let ((.cse2 (select |c_#memory_int| |c_ULTIMATE.start_writer_fn_~r~1#1.base|))) (or (< |v_ULTIMATE.start_ring_enqueue_#t~mem6#1_152| (select .cse2 (+ |c_ULTIMATE.start_writer_fn_~r~1#1.offset| 20))) (= (+ |c_reader_fnThread1of1ForFork0_~last~0#1| 1) (select (select (store |c_#memory_int| |c_ULTIMATE.start_writer_fn_~r~1#1.base| (store .cse2 (+ (* |v_ULTIMATE.start_ring_enqueue_#t~mem6#1_152| 4) |c_ULTIMATE.start_writer_fn_~r~1#1.offset| 4) v_ArrVal_523)) |c_reader_fnThread1of1ForFork0_~r~0#1.base|) (+ |c_reader_fnThread1of1ForFork0_~r~0#1.offset| (* (select (select |c_#memory_int| |c_reader_fnThread1of1ForFork0_~r~0#1.base|) |c_reader_fnThread1of1ForFork0_~r~0#1.offset|) 4) 4)))))) (= |c_ULTIMATE.start_ring_enqueue_~r#1.offset| 0) (= |c_reader_fnThread1of1ForFork0_~r~0#1.offset| 0))) is different from false [2021-11-25 18:52:41,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:52:41,436 INFO L93 Difference]: Finished difference Result 884 states and 2054 transitions. [2021-11-25 18:52:41,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2021-11-25 18:52:41,437 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 43 states have (on average 1.441860465116279) internal successors, (62), 43 states have internal predecessors, (62), 0 states have call successors, (0), 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 23 [2021-11-25 18:52:41,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:52:41,444 INFO L225 Difference]: With dead ends: 884 [2021-11-25 18:52:41,444 INFO L226 Difference]: Without dead ends: 884 [2021-11-25 18:52:41,447 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 19 SyntacticMatches, 7 SemanticMatches, 72 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1278 ImplicationChecksByTransitivity, 88.6s TimeCoverageRelationStatistics Valid=602, Invalid=4491, Unknown=27, NotChecked=282, Total=5402 [2021-11-25 18:52:41,448 INFO L933 BasicCegarLoop]: 11 mSDtfsCounter, 212 mSDsluCounter, 260 mSDsCounter, 0 mSdLazyCounter, 1220 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 212 SdHoareTripleChecker+Valid, 248 SdHoareTripleChecker+Invalid, 2259 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 1220 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 983 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2021-11-25 18:52:41,448 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [212 Valid, 248 Invalid, 2259 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 1220 Invalid, 0 Unknown, 983 Unchecked, 1.0s Time] [2021-11-25 18:52:41,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 884 states. [2021-11-25 18:52:41,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 884 to 686. [2021-11-25 18:52:41,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 686 states, 683 states have (on average 2.3616398243045387) internal successors, (1613), 685 states have internal predecessors, (1613), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:52:41,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 686 states to 686 states and 1613 transitions. [2021-11-25 18:52:41,476 INFO L78 Accepts]: Start accepts. Automaton has 686 states and 1613 transitions. Word has length 23 [2021-11-25 18:52:41,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:52:41,476 INFO L470 AbstractCegarLoop]: Abstraction has 686 states and 1613 transitions. [2021-11-25 18:52:41,476 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 43 states have (on average 1.441860465116279) internal successors, (62), 43 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:52:41,477 INFO L276 IsEmpty]: Start isEmpty. Operand 686 states and 1613 transitions. [2021-11-25 18:52:41,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-11-25 18:52:41,478 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:52:41,479 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 18:52:41,521 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57ca2f2b-7a1b-4211-a914-b6836eaa190b/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2021-11-25 18:52:41,701 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57ca2f2b-7a1b-4211-a914-b6836eaa190b/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:52:41,702 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2021-11-25 18:52:41,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:52:41,702 INFO L85 PathProgramCache]: Analyzing trace with hash -1863112267, now seen corresponding path program 14 times [2021-11-25 18:52:41,702 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:52:41,702 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [873116095] [2021-11-25 18:52:41,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:52:41,703 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:52:41,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:52:43,169 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 18:52:43,169 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:52:43,169 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [873116095] [2021-11-25 18:52:43,169 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [873116095] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 18:52:43,169 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [212220045] [2021-11-25 18:52:43,170 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-25 18:52:43,170 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:52:43,170 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57ca2f2b-7a1b-4211-a914-b6836eaa190b/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 18:52:43,170 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57ca2f2b-7a1b-4211-a914-b6836eaa190b/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 18:52:43,171 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57ca2f2b-7a1b-4211-a914-b6836eaa190b/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2021-11-25 18:52:43,318 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-11-25 18:52:43,318 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-25 18:52:43,321 WARN L261 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 114 conjunts are in the unsatisfiable core [2021-11-25 18:52:43,324 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 18:52:43,339 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:52:43,339 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 [2021-11-25 18:52:43,343 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:52:43,343 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 [2021-11-25 18:52:43,346 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2021-11-25 18:52:43,763 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:52:43,763 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-25 18:52:43,777 INFO L354 Elim1Store]: treesize reduction 38, result has 30.9 percent of original size [2021-11-25 18:52:43,778 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 [2021-11-25 18:52:43,923 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:52:43,924 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:52:43,936 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:52:43,937 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 0 case distinctions, treesize of input 52 treesize of output 42 [2021-11-25 18:52:44,208 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:52:44,209 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:52:44,211 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:52:44,246 INFO L354 Elim1Store]: treesize reduction 84, result has 27.6 percent of original size [2021-11-25 18:52:44,247 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 6 case distinctions, treesize of input 51 treesize of output 56 [2021-11-25 18:52:44,358 INFO L354 Elim1Store]: treesize reduction 14, result has 17.6 percent of original size [2021-11-25 18:52:44,359 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 [2021-11-25 18:52:44,391 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 18:52:44,391 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 18:52:49,593 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_ring_enqueue_#t~mem6#1_157| Int)) (or (forall ((v_ArrVal_577 Int)) (= (+ |c_reader_fnThread1of1ForFork0_~last~0#1| 1) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_~r#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_~r#1.base|) (+ |c_ULTIMATE.start_ring_enqueue_~r#1.offset| (* |v_ULTIMATE.start_ring_enqueue_#t~mem6#1_157| 4) 4) v_ArrVal_577)) |c_reader_fnThread1of1ForFork0_~r~0#1.base|))) (select .cse0 (+ (* (select .cse0 |c_reader_fnThread1of1ForFork0_~r~0#1.offset|) 4) |c_reader_fnThread1of1ForFork0_~r~0#1.offset| 4))))) (< |v_ULTIMATE.start_ring_enqueue_#t~mem6#1_157| (select (select |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_~r#1.base|) (+ |c_ULTIMATE.start_ring_enqueue_~r#1.offset| 20))))) is different from false [2021-11-25 18:52:50,882 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_577 Int) (|v_ULTIMATE.start_ring_enqueue_#t~mem6#1_157| Int)) (let ((.cse1 (select |c_#memory_int| |c_ULTIMATE.start_writer_fn_~r~1#1.base|))) (or (= (+ |c_reader_fnThread1of1ForFork0_~last~0#1| 1) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_writer_fn_~r~1#1.base| (store .cse1 (+ |c_ULTIMATE.start_writer_fn_~r~1#1.offset| (* |v_ULTIMATE.start_ring_enqueue_#t~mem6#1_157| 4) 4) v_ArrVal_577)) |c_reader_fnThread1of1ForFork0_~r~0#1.base|))) (select .cse0 (+ |c_reader_fnThread1of1ForFork0_~r~0#1.offset| (* (select .cse0 |c_reader_fnThread1of1ForFork0_~r~0#1.offset|) 4) 4)))) (< |v_ULTIMATE.start_ring_enqueue_#t~mem6#1_157| (select .cse1 (+ |c_ULTIMATE.start_writer_fn_~r~1#1.offset| 20)))))) is different from false [2021-11-25 18:53:01,718 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_577 Int) (v_ArrVal_575 Int) (|v_ULTIMATE.start_ring_enqueue_#t~mem6#1_157| Int)) (let ((.cse2 (select |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_~r#1.base|)) (.cse3 (+ |c_ULTIMATE.start_ring_enqueue_~r#1.offset| 20))) (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_~r#1.base| (store .cse2 .cse3 v_ArrVal_575)))) (let ((.cse4 (select .cse6 |c_ULTIMATE.start_writer_fn_~r~1#1.base|))) (or (let ((.cse1 (+ (select .cse2 .cse3) 1))) (let ((.cse0 (mod .cse1 4))) (and (< v_ArrVal_575 .cse0) (or (<= 0 .cse1) (= .cse0 0) (< (+ v_ArrVal_575 4) .cse0))))) (< |v_ULTIMATE.start_ring_enqueue_#t~mem6#1_157| (select .cse4 (+ |c_ULTIMATE.start_writer_fn_~r~1#1.offset| 20))) (= (+ |c_reader_fnThread1of1ForFork0_~last~0#1| 1) (let ((.cse5 (select (store .cse6 |c_ULTIMATE.start_writer_fn_~r~1#1.base| (store .cse4 (+ |c_ULTIMATE.start_writer_fn_~r~1#1.offset| (* |v_ULTIMATE.start_ring_enqueue_#t~mem6#1_157| 4) 4) v_ArrVal_577)) |c_reader_fnThread1of1ForFork0_~r~0#1.base|))) (select .cse5 (+ |c_reader_fnThread1of1ForFork0_~r~0#1.offset| (* (select .cse5 |c_reader_fnThread1of1ForFork0_~r~0#1.offset|) 4) 4))))))))) is different from false [2021-11-25 18:53:30,718 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2021-11-25 18:53:30,719 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [212220045] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 18:53:30,719 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [454945478] [2021-11-25 18:53:30,720 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:1603) 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:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) 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) [2021-11-25 18:53:30,721 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 18:53:30,721 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 15, 16] total 45 [2021-11-25 18:53:30,721 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1541927072] [2021-11-25 18:53:30,722 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 18:53:30,722 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2021-11-25 18:53:30,722 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:53:30,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2021-11-25 18:53:30,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=184, Invalid=1703, Unknown=17, NotChecked=258, Total=2162 [2021-11-25 18:53:30,724 INFO L87 Difference]: Start difference. First operand 686 states and 1613 transitions. Second operand has 47 states, 46 states have (on average 1.434782608695652) internal successors, (66), 46 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:53:33,264 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_reader_fnThread1of1ForFork0_#in~arg#1.base|)) (.cse1 (select |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_~r#1.base|))) (and (= 0 (select .cse0 |c_ULTIMATE.start_main_~#r~2#1.offset|)) (= |c_ULTIMATE.start_main_~#r~2#1.base| |c_reader_fnThread1of1ForFork0_#in~arg#1.base|) (= (select .cse0 20) 0) (= |c_ULTIMATE.start_writer_fn_~i~1#1| 0) (= 0 |c_reader_fnThread1of1ForFork0_#in~arg#1.offset|) (= (select .cse1 (+ |c_ULTIMATE.start_ring_enqueue_~r#1.offset| 20)) 0) (forall ((v_ArrVal_577 Int) (v_ArrVal_575 Int) (|v_ULTIMATE.start_ring_enqueue_#t~mem6#1_157| Int)) (let ((.cse8 (+ |c_ULTIMATE.start_ring_enqueue_~r#1.offset| 20))) (let ((.cse7 (let ((.cse9 (select |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_~r#1.base|))) (store .cse9 (+ |c_ULTIMATE.start_ring_enqueue_~r#1.offset| 4 (* (select .cse9 .cse8) 4)) |c_ULTIMATE.start_ring_enqueue_~x#1|)))) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_~r#1.base| (store .cse7 .cse8 v_ArrVal_575)))) (let ((.cse4 (select .cse3 |c_ULTIMATE.start_writer_fn_~r~1#1.base|))) (or (= (+ |c_reader_fnThread1of1ForFork0_~last~0#1| 1) (let ((.cse2 (select (store .cse3 |c_ULTIMATE.start_writer_fn_~r~1#1.base| (store .cse4 (+ |c_ULTIMATE.start_writer_fn_~r~1#1.offset| (* |v_ULTIMATE.start_ring_enqueue_#t~mem6#1_157| 4) 4) v_ArrVal_577)) |c_reader_fnThread1of1ForFork0_~r~0#1.base|))) (select .cse2 (+ (* (select .cse2 |c_reader_fnThread1of1ForFork0_~r~0#1.offset|) 4) |c_reader_fnThread1of1ForFork0_~r~0#1.offset| 4)))) (let ((.cse6 (+ 1 (select .cse7 .cse8)))) (let ((.cse5 (mod .cse6 4))) (and (< v_ArrVal_575 .cse5) (or (= .cse5 0) (<= 0 .cse6) (< (+ v_ArrVal_575 4) .cse5))))) (< |v_ULTIMATE.start_ring_enqueue_#t~mem6#1_157| (select .cse4 (+ |c_ULTIMATE.start_writer_fn_~r~1#1.offset| 20))))))))) (= (select .cse1 |c_ULTIMATE.start_ring_enqueue_~r#1.offset|) 0) (= |c_ULTIMATE.start_main_~#r~2#1.offset| |c_reader_fnThread1of1ForFork0_#in~arg#1.offset|) (= |c_ULTIMATE.start_ring_enqueue_~r#1.offset| 0) (= |c_ULTIMATE.start_ring_enqueue_~x#1| 1) (= |c_ULTIMATE.start_writer_fn_~r~1#1.base| |c_reader_fnThread1of1ForFork0_#in~arg#1.base|) (= |c_ULTIMATE.start_writer_fn_~r~1#1.base| |c_ULTIMATE.start_ring_enqueue_~r#1.base|) (= |c_ULTIMATE.start_writer_fn_~r~1#1.offset| |c_reader_fnThread1of1ForFork0_#in~arg#1.offset|))) is different from false [2021-11-25 18:53:34,390 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse7 (select |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_~r#1.base|))) (and (= |c_ULTIMATE.start_writer_fn_~r~1#1.offset| |c_ULTIMATE.start_ring_enqueue_~r#1.offset|) (= 0 |c_reader_fnThread1of1ForFork0_~last~0#1|) (= |c_reader_fnThread1of1ForFork0_~r~0#1.base| |c_ULTIMATE.start_writer_fn_~r~1#1.base|) (forall ((v_ArrVal_577 Int) (v_ArrVal_575 Int) (|v_ULTIMATE.start_ring_enqueue_#t~mem6#1_157| Int)) (let ((.cse2 (select |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_~r#1.base|)) (.cse3 (+ |c_ULTIMATE.start_ring_enqueue_~r#1.offset| 20))) (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_~r#1.base| (store .cse2 .cse3 v_ArrVal_575)))) (let ((.cse4 (select .cse6 |c_ULTIMATE.start_writer_fn_~r~1#1.base|))) (or (let ((.cse1 (+ (select .cse2 .cse3) 1))) (let ((.cse0 (mod .cse1 4))) (and (< v_ArrVal_575 .cse0) (or (<= 0 .cse1) (= .cse0 0) (< (+ v_ArrVal_575 4) .cse0))))) (< |v_ULTIMATE.start_ring_enqueue_#t~mem6#1_157| (select .cse4 (+ |c_ULTIMATE.start_writer_fn_~r~1#1.offset| 20))) (= (+ |c_reader_fnThread1of1ForFork0_~last~0#1| 1) (let ((.cse5 (select (store .cse6 |c_ULTIMATE.start_writer_fn_~r~1#1.base| (store .cse4 (+ |c_ULTIMATE.start_writer_fn_~r~1#1.offset| (* |v_ULTIMATE.start_ring_enqueue_#t~mem6#1_157| 4) 4) v_ArrVal_577)) |c_reader_fnThread1of1ForFork0_~r~0#1.base|))) (select .cse5 (+ |c_reader_fnThread1of1ForFork0_~r~0#1.offset| (* (select .cse5 |c_reader_fnThread1of1ForFork0_~r~0#1.offset|) 4) 4))))))))) (= (select .cse7 (+ |c_ULTIMATE.start_ring_enqueue_~r#1.offset| 4)) 1) (= (select .cse7 (+ |c_ULTIMATE.start_ring_enqueue_~r#1.offset| 20)) 0) (= (select (select |c_#memory_int| |c_reader_fnThread1of1ForFork0_~r~0#1.base|) |c_ULTIMATE.start_writer_fn_~r~1#1.offset|) 0) (= |c_ULTIMATE.start_writer_fn_~r~1#1.offset| |c_reader_fnThread1of1ForFork0_~r~0#1.offset|) (= |c_reader_fnThread1of1ForFork0_~r~0#1.offset| 0) (= |c_ULTIMATE.start_writer_fn_~r~1#1.base| |c_ULTIMATE.start_ring_enqueue_~r#1.base|))) is different from false [2021-11-25 18:53:35,418 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_~r#1.base|))) (and (= |c_reader_fnThread1of1ForFork0_ring_empty_~r#1.base| |c_ULTIMATE.start_ring_enqueue_~r#1.base|) (= 0 |c_reader_fnThread1of1ForFork0_~last~0#1|) (= |c_ULTIMATE.start_writer_fn_~r~1#1.offset| 0) (= |c_reader_fnThread1of1ForFork0_~r~0#1.base| |c_ULTIMATE.start_writer_fn_~r~1#1.base|) (= (select .cse0 4) 1) (= |c_reader_fnThread1of1ForFork0_ring_empty_~r#1.offset| 0) (= |c_ULTIMATE.start_writer_fn_~i~1#1| 0) (forall ((v_ArrVal_577 Int) (v_ArrVal_575 Int) (|v_ULTIMATE.start_ring_enqueue_#t~mem6#1_157| Int)) (let ((.cse3 (select |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_~r#1.base|)) (.cse4 (+ |c_ULTIMATE.start_ring_enqueue_~r#1.offset| 20))) (let ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_~r#1.base| (store .cse3 .cse4 v_ArrVal_575)))) (let ((.cse5 (select .cse7 |c_ULTIMATE.start_writer_fn_~r~1#1.base|))) (or (let ((.cse2 (+ (select .cse3 .cse4) 1))) (let ((.cse1 (mod .cse2 4))) (and (< v_ArrVal_575 .cse1) (or (<= 0 .cse2) (= .cse1 0) (< (+ v_ArrVal_575 4) .cse1))))) (< |v_ULTIMATE.start_ring_enqueue_#t~mem6#1_157| (select .cse5 (+ |c_ULTIMATE.start_writer_fn_~r~1#1.offset| 20))) (= (+ |c_reader_fnThread1of1ForFork0_~last~0#1| 1) (let ((.cse6 (select (store .cse7 |c_ULTIMATE.start_writer_fn_~r~1#1.base| (store .cse5 (+ |c_ULTIMATE.start_writer_fn_~r~1#1.offset| (* |v_ULTIMATE.start_ring_enqueue_#t~mem6#1_157| 4) 4) v_ArrVal_577)) |c_reader_fnThread1of1ForFork0_~r~0#1.base|))) (select .cse6 (+ |c_reader_fnThread1of1ForFork0_~r~0#1.offset| (* (select .cse6 |c_reader_fnThread1of1ForFork0_~r~0#1.offset|) 4) 4))))))))) (= (select .cse0 (+ |c_ULTIMATE.start_ring_enqueue_~r#1.offset| 20)) 0) (= |c_ULTIMATE.start_ring_enqueue_~r#1.offset| 0) (= (select .cse0 |c_ULTIMATE.start_writer_fn_~r~1#1.offset|) 0) (= |c_reader_fnThread1of1ForFork0_~r~0#1.offset| 0) (= |c_ULTIMATE.start_writer_fn_~r~1#1.base| |c_ULTIMATE.start_ring_enqueue_~r#1.base|))) is different from false [2021-11-25 18:53:36,186 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| |c_reader_fnThread1of1ForFork0_~r~0#1.base|)) (.cse3 (select |c_#memory_int| |c_ULTIMATE.start_writer_fn_~r~1#1.base|))) (and (= |c_reader_fnThread1of1ForFork0_~r~0#1.base| |c_ULTIMATE.start_ring_enqueue_~r#1.base|) (= 0 |c_reader_fnThread1of1ForFork0_~last~0#1|) (forall ((v_ArrVal_577 Int) (|v_ULTIMATE.start_ring_enqueue_#t~mem6#1_157| Int)) (let ((.cse1 (select |c_#memory_int| |c_ULTIMATE.start_writer_fn_~r~1#1.base|))) (or (= (+ |c_reader_fnThread1of1ForFork0_~last~0#1| 1) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_writer_fn_~r~1#1.base| (store .cse1 (+ |c_ULTIMATE.start_writer_fn_~r~1#1.offset| (* |v_ULTIMATE.start_ring_enqueue_#t~mem6#1_157| 4) 4) v_ArrVal_577)) |c_reader_fnThread1of1ForFork0_~r~0#1.base|))) (select .cse0 (+ |c_reader_fnThread1of1ForFork0_~r~0#1.offset| (* (select .cse0 |c_reader_fnThread1of1ForFork0_~r~0#1.offset|) 4) 4)))) (< |v_ULTIMATE.start_ring_enqueue_#t~mem6#1_157| (select .cse1 (+ |c_ULTIMATE.start_writer_fn_~r~1#1.offset| 20)))))) (= |c_reader_fnThread1of1ForFork0_~r~0#1.base| |c_ULTIMATE.start_writer_fn_~r~1#1.base|) (<= 1 (select .cse2 (+ |c_reader_fnThread1of1ForFork0_~r~0#1.offset| 20))) (= (select .cse3 (+ |c_ULTIMATE.start_writer_fn_~r~1#1.offset| 4)) 1) (= |c_ULTIMATE.start_ring_enqueue_~r#1.offset| |c_reader_fnThread1of1ForFork0_~r~0#1.offset|) (= (select .cse2 |c_ULTIMATE.start_writer_fn_~r~1#1.offset|) 0) (= (select .cse2 |c_reader_fnThread1of1ForFork0_~r~0#1.offset|) 0) (= (select .cse2 (+ |c_reader_fnThread1of1ForFork0_~r~0#1.offset| 4)) 1) (= |c_ULTIMATE.start_writer_fn_~r~1#1.offset| |c_reader_fnThread1of1ForFork0_~r~0#1.offset|) (<= 1 (select .cse3 (+ |c_ULTIMATE.start_writer_fn_~r~1#1.offset| 20))) (= |c_reader_fnThread1of1ForFork0_~r~0#1.offset| 0))) is different from false [2021-11-25 18:53:38,295 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| |c_reader_fnThread1of1ForFork0_~r~0#1.base|))) (and (= |c_reader_fnThread1of1ForFork0_~r~0#1.base| |c_ULTIMATE.start_ring_enqueue_~r#1.base|) (= 0 |c_reader_fnThread1of1ForFork0_~last~0#1|) (forall ((|v_ULTIMATE.start_ring_enqueue_#t~mem6#1_157| Int)) (or (forall ((v_ArrVal_577 Int)) (= (+ |c_reader_fnThread1of1ForFork0_~last~0#1| 1) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_~r#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_~r#1.base|) (+ |c_ULTIMATE.start_ring_enqueue_~r#1.offset| (* |v_ULTIMATE.start_ring_enqueue_#t~mem6#1_157| 4) 4) v_ArrVal_577)) |c_reader_fnThread1of1ForFork0_~r~0#1.base|))) (select .cse0 (+ (* (select .cse0 |c_reader_fnThread1of1ForFork0_~r~0#1.offset|) 4) |c_reader_fnThread1of1ForFork0_~r~0#1.offset| 4))))) (< |v_ULTIMATE.start_ring_enqueue_#t~mem6#1_157| (select (select |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_~r#1.base|) (+ |c_ULTIMATE.start_ring_enqueue_~r#1.offset| 20))))) (<= 1 (select .cse1 (+ |c_reader_fnThread1of1ForFork0_~r~0#1.offset| 20))) (= |c_ULTIMATE.start_ring_enqueue_~r#1.offset| |c_reader_fnThread1of1ForFork0_~r~0#1.offset|) (= (select .cse1 |c_reader_fnThread1of1ForFork0_~r~0#1.offset|) 0) (= (select .cse1 (+ |c_reader_fnThread1of1ForFork0_~r~0#1.offset| 4)) 1) (= |c_reader_fnThread1of1ForFork0_~r~0#1.offset| 0))) is different from false [2021-11-25 18:53:39,112 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_~r#1.base|)) (.cse2 (select |c_#memory_int| |c_ULTIMATE.start_writer_fn_~r~1#1.base|))) (and (= |c_reader_fnThread1of1ForFork0_~r~0#1.base| |c_ULTIMATE.start_ring_enqueue_~r#1.base|) (= 0 |c_reader_fnThread1of1ForFork0_~last~0#1|) (forall ((v_ArrVal_577 Int) (|v_ULTIMATE.start_ring_enqueue_#t~mem6#1_157| Int)) (let ((.cse1 (select |c_#memory_int| |c_ULTIMATE.start_writer_fn_~r~1#1.base|))) (or (= (+ |c_reader_fnThread1of1ForFork0_~last~0#1| 1) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_writer_fn_~r~1#1.base| (store .cse1 (+ |c_ULTIMATE.start_writer_fn_~r~1#1.offset| (* |v_ULTIMATE.start_ring_enqueue_#t~mem6#1_157| 4) 4) v_ArrVal_577)) |c_reader_fnThread1of1ForFork0_~r~0#1.base|))) (select .cse0 (+ |c_reader_fnThread1of1ForFork0_~r~0#1.offset| (* (select .cse0 |c_reader_fnThread1of1ForFork0_~r~0#1.offset|) 4) 4)))) (< |v_ULTIMATE.start_ring_enqueue_#t~mem6#1_157| (select .cse1 (+ |c_ULTIMATE.start_writer_fn_~r~1#1.offset| 20)))))) (<= 1 (select .cse2 20)) (<= 1 (select .cse3 (+ |c_ULTIMATE.start_ring_enqueue_~r#1.offset| 20))) (= |c_reader_fnThread1of1ForFork0_~r~0#1.base| |c_ULTIMATE.start_writer_fn_~r~1#1.base|) (= (select .cse3 4) 1) (= |c_reader_fnThread1of1ForFork0_ring_empty_~r#1.offset| 0) (= (select .cse3 |c_ULTIMATE.start_ring_enqueue_~r#1.offset|) 0) (= (select .cse2 4) 1) (= |c_ULTIMATE.start_ring_enqueue_~r#1.offset| 0) (= |c_ULTIMATE.start_writer_fn_~r~1#1.offset| |c_reader_fnThread1of1ForFork0_~r~0#1.offset|) (= |c_reader_fnThread1of1ForFork0_~r~0#1.offset| 0) (= (select .cse2 |c_ULTIMATE.start_writer_fn_~r~1#1.offset|) 0))) is different from false [2021-11-25 18:53:41,136 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_~r#1.base|))) (and (= |c_reader_fnThread1of1ForFork0_~r~0#1.base| |c_ULTIMATE.start_ring_enqueue_~r#1.base|) (= 0 |c_reader_fnThread1of1ForFork0_~last~0#1|) (forall ((|v_ULTIMATE.start_ring_enqueue_#t~mem6#1_157| Int)) (or (forall ((v_ArrVal_577 Int)) (= (+ |c_reader_fnThread1of1ForFork0_~last~0#1| 1) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_~r#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_~r#1.base|) (+ |c_ULTIMATE.start_ring_enqueue_~r#1.offset| (* |v_ULTIMATE.start_ring_enqueue_#t~mem6#1_157| 4) 4) v_ArrVal_577)) |c_reader_fnThread1of1ForFork0_~r~0#1.base|))) (select .cse0 (+ (* (select .cse0 |c_reader_fnThread1of1ForFork0_~r~0#1.offset|) 4) |c_reader_fnThread1of1ForFork0_~r~0#1.offset| 4))))) (< |v_ULTIMATE.start_ring_enqueue_#t~mem6#1_157| (select (select |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_~r#1.base|) (+ |c_ULTIMATE.start_ring_enqueue_~r#1.offset| 20))))) (<= 1 (select .cse1 (+ |c_ULTIMATE.start_ring_enqueue_~r#1.offset| 20))) (= (select .cse1 4) 1) (= |c_reader_fnThread1of1ForFork0_ring_empty_~r#1.offset| 0) (= (select .cse1 |c_ULTIMATE.start_ring_enqueue_~r#1.offset|) 0) (= |c_ULTIMATE.start_ring_enqueue_~r#1.offset| 0) (= |c_reader_fnThread1of1ForFork0_~r~0#1.offset| 0))) is different from false [2021-11-25 18:53:43,140 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_~r#1.base|))) (and (= |c_reader_fnThread1of1ForFork0_~r~0#1.base| |c_ULTIMATE.start_ring_enqueue_~r#1.base|) (= 0 |c_reader_fnThread1of1ForFork0_~last~0#1|) (forall ((|v_ULTIMATE.start_ring_enqueue_#t~mem6#1_157| Int)) (or (forall ((v_ArrVal_577 Int)) (= (+ |c_reader_fnThread1of1ForFork0_~last~0#1| 1) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_~r#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_~r#1.base|) (+ |c_ULTIMATE.start_ring_enqueue_~r#1.offset| (* |v_ULTIMATE.start_ring_enqueue_#t~mem6#1_157| 4) 4) v_ArrVal_577)) |c_reader_fnThread1of1ForFork0_~r~0#1.base|))) (select .cse0 (+ (* (select .cse0 |c_reader_fnThread1of1ForFork0_~r~0#1.offset|) 4) |c_reader_fnThread1of1ForFork0_~r~0#1.offset| 4))))) (< |v_ULTIMATE.start_ring_enqueue_#t~mem6#1_157| (select (select |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_~r#1.base|) (+ |c_ULTIMATE.start_ring_enqueue_~r#1.offset| 20))))) (= (select .cse1 4) 1) (= |c_reader_fnThread1of1ForFork0_ring_empty_~r#1.offset| 0) (= |c_ULTIMATE.start_ring_enqueue_#t~mem4#1| (select .cse1 (+ |c_ULTIMATE.start_ring_enqueue_~r#1.offset| 20))) (= (select .cse1 |c_ULTIMATE.start_ring_enqueue_~r#1.offset|) 0) (= |c_ULTIMATE.start_ring_enqueue_~r#1.offset| 0) (= |c_reader_fnThread1of1ForFork0_~r~0#1.offset| 0) (<= 1 |c_ULTIMATE.start_ring_enqueue_#t~mem4#1|))) is different from false [2021-11-25 18:53:44,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:53:44,416 INFO L93 Difference]: Finished difference Result 942 states and 2188 transitions. [2021-11-25 18:53:44,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2021-11-25 18:53:44,417 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 46 states have (on average 1.434782608695652) internal successors, (66), 46 states have internal predecessors, (66), 0 states have call successors, (0), 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 23 [2021-11-25 18:53:44,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:53:44,422 INFO L225 Difference]: With dead ends: 942 [2021-11-25 18:53:44,422 INFO L226 Difference]: Without dead ends: 942 [2021-11-25 18:53:44,424 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 14 SyntacticMatches, 11 SemanticMatches, 75 ConstructedPredicates, 11 IntricatePredicates, 0 DeprecatedPredicates, 1171 ImplicationChecksByTransitivity, 58.2s TimeCoverageRelationStatistics Valid=508, Invalid=3801, Unknown=25, NotChecked=1518, Total=5852 [2021-11-25 18:53:44,425 INFO L933 BasicCegarLoop]: 9 mSDtfsCounter, 145 mSDsluCounter, 197 mSDsCounter, 0 mSdLazyCounter, 903 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 2315 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 903 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1387 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2021-11-25 18:53:44,425 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [145 Valid, 165 Invalid, 2315 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 903 Invalid, 0 Unknown, 1387 Unchecked, 0.7s Time] [2021-11-25 18:53:44,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 942 states. [2021-11-25 18:53:44,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 942 to 783. [2021-11-25 18:53:44,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 783 states, 780 states have (on average 2.364102564102564) internal successors, (1844), 782 states have internal predecessors, (1844), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:53:44,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 783 states to 783 states and 1844 transitions. [2021-11-25 18:53:44,451 INFO L78 Accepts]: Start accepts. Automaton has 783 states and 1844 transitions. Word has length 23 [2021-11-25 18:53:44,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:53:44,451 INFO L470 AbstractCegarLoop]: Abstraction has 783 states and 1844 transitions. [2021-11-25 18:53:44,451 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 46 states have (on average 1.434782608695652) internal successors, (66), 46 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:53:44,452 INFO L276 IsEmpty]: Start isEmpty. Operand 783 states and 1844 transitions. [2021-11-25 18:53:44,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-11-25 18:53:44,453 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:53:44,454 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 18:53:44,492 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57ca2f2b-7a1b-4211-a914-b6836eaa190b/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2021-11-25 18:53:44,669 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57ca2f2b-7a1b-4211-a914-b6836eaa190b/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:53:44,670 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2021-11-25 18:53:44,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:53:44,670 INFO L85 PathProgramCache]: Analyzing trace with hash -1595060827, now seen corresponding path program 15 times [2021-11-25 18:53:44,670 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:53:44,670 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [754768273] [2021-11-25 18:53:44,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:53:44,670 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:53:44,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:53:45,909 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 18:53:45,909 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:53:45,909 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [754768273] [2021-11-25 18:53:45,909 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [754768273] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 18:53:45,910 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [620951793] [2021-11-25 18:53:45,910 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-11-25 18:53:45,910 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:53:45,910 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57ca2f2b-7a1b-4211-a914-b6836eaa190b/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 18:53:45,917 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57ca2f2b-7a1b-4211-a914-b6836eaa190b/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 18:53:45,936 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57ca2f2b-7a1b-4211-a914-b6836eaa190b/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2021-11-25 18:53:46,037 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-11-25 18:53:46,037 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-25 18:53:46,040 WARN L261 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 120 conjunts are in the unsatisfiable core [2021-11-25 18:53:46,047 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 18:53:46,060 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:53:46,060 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 [2021-11-25 18:53:46,064 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:53:46,065 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 [2021-11-25 18:53:46,069 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2021-11-25 18:53:46,523 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:53:46,524 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-25 18:53:46,539 INFO L354 Elim1Store]: treesize reduction 38, result has 30.9 percent of original size [2021-11-25 18:53:46,539 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 [2021-11-25 18:53:46,691 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:53:46,701 INFO L354 Elim1Store]: treesize reduction 39, result has 15.2 percent of original size [2021-11-25 18:53:46,701 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 61 treesize of output 48 [2021-11-25 18:53:47,012 INFO L354 Elim1Store]: treesize reduction 97, result has 24.2 percent of original size [2021-11-25 18:53:47,012 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 10 case distinctions, treesize of input 53 treesize of output 59 [2021-11-25 18:53:47,084 INFO L354 Elim1Store]: treesize reduction 14, result has 17.6 percent of original size [2021-11-25 18:53:47,085 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 [2021-11-25 18:53:47,092 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 18:53:47,092 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 18:54:59,919 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_632 Int) (|v_ULTIMATE.start_ring_enqueue_#t~mem6#1_162| Int) (v_ArrVal_634 Int)) (let ((.cse4 (store (select |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_~r#1.base|) (+ (* |c_ULTIMATE.start_ring_enqueue_#t~mem6#1| 4) |c_ULTIMATE.start_ring_enqueue_~r#1.offset| 4) |c_ULTIMATE.start_ring_enqueue_~x#1|)) (.cse5 (+ |c_ULTIMATE.start_ring_enqueue_~r#1.offset| 20))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_~r#1.base| (store .cse4 .cse5 v_ArrVal_632)))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_writer_fn_~r~1#1.base|))) (or (= (+ |c_reader_fnThread1of1ForFork0_~last~0#1| 1) (select (select (store .cse0 |c_ULTIMATE.start_writer_fn_~r~1#1.base| (store .cse1 (+ (* |v_ULTIMATE.start_ring_enqueue_#t~mem6#1_162| 4) |c_ULTIMATE.start_writer_fn_~r~1#1.offset| 4) v_ArrVal_634)) |c_reader_fnThread1of1ForFork0_~r~0#1.base|) (+ |c_reader_fnThread1of1ForFork0_~r~0#1.offset| (* (select (select .cse0 |c_reader_fnThread1of1ForFork0_~r~0#1.base|) |c_reader_fnThread1of1ForFork0_~r~0#1.offset|) 4) 4))) (let ((.cse3 (+ (select .cse4 .cse5) 1))) (let ((.cse2 (mod .cse3 4))) (and (or (= .cse2 0) (< (+ v_ArrVal_632 4) .cse2) (<= 0 .cse3)) (< v_ArrVal_632 .cse2)))) (< |v_ULTIMATE.start_ring_enqueue_#t~mem6#1_162| (select .cse1 (+ |c_ULTIMATE.start_writer_fn_~r~1#1.offset| 20)))))))) is different from false [2021-11-25 18:55:23,051 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2021-11-25 18:55:23,051 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [620951793] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 18:55:23,051 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1859567112] [2021-11-25 18:55:23,052 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:1603) 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:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) 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) [2021-11-25 18:55:23,053 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 18:55:23,054 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 15, 16] total 42 [2021-11-25 18:55:23,054 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1801918008] [2021-11-25 18:55:23,054 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 18:55:23,054 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2021-11-25 18:55:23,055 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:55:23,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2021-11-25 18:55:23,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=167, Invalid=1609, Unknown=34, NotChecked=82, Total=1892 [2021-11-25 18:55:23,056 INFO L87 Difference]: Start difference. First operand 783 states and 1844 transitions. Second operand has 44 states, 43 states have (on average 1.441860465116279) internal successors, (62), 43 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:55:27,233 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_reader_fnThread1of1ForFork0_#in~arg#1.base|)) (.cse8 (+ |c_ULTIMATE.start_writer_fn_~i~1#1| 1))) (and (= |c_ULTIMATE.start_main_~#r~2#1.base| |c_reader_fnThread1of1ForFork0_#in~arg#1.base|) (= (select .cse0 20) 0) (= |c_ULTIMATE.start_writer_fn_~r~1#1.offset| 0) (= |c_ULTIMATE.start_main_~#r~2#1.offset| 0) (= |c_ULTIMATE.start_writer_fn_~i~1#1| 0) (= 0 |c_reader_fnThread1of1ForFork0_#in~arg#1.offset|) (= (select (select |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_~r#1.base|) (+ |c_ULTIMATE.start_ring_enqueue_~r#1.offset| 20)) 0) (forall ((v_ArrVal_632 Int) (|v_ULTIMATE.start_ring_enqueue_#t~mem6#1_162| Int) (v_ArrVal_634 Int)) (let ((.cse4 (+ |c_ULTIMATE.start_ring_enqueue_~r#1.offset| 20))) (let ((.cse3 (let ((.cse7 (select |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_~r#1.base|))) (store .cse7 (+ |c_ULTIMATE.start_ring_enqueue_~r#1.offset| 4 (* (select .cse7 .cse4) 4)) |c_ULTIMATE.start_ring_enqueue_~x#1|)))) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_~r#1.base| (store .cse3 .cse4 v_ArrVal_632)))) (let ((.cse6 (select .cse5 |c_ULTIMATE.start_writer_fn_~r~1#1.base|))) (or (let ((.cse2 (+ 1 (select .cse3 .cse4)))) (let ((.cse1 (mod .cse2 4))) (and (or (= .cse1 0) (<= 0 .cse2) (< (+ v_ArrVal_632 4) .cse1)) (< v_ArrVal_632 .cse1)))) (= (+ |c_reader_fnThread1of1ForFork0_~last~0#1| 1) (select (select (store .cse5 |c_ULTIMATE.start_writer_fn_~r~1#1.base| (store .cse6 (+ (* |v_ULTIMATE.start_ring_enqueue_#t~mem6#1_162| 4) |c_ULTIMATE.start_writer_fn_~r~1#1.offset| 4) v_ArrVal_634)) |c_reader_fnThread1of1ForFork0_~r~0#1.base|) (+ |c_reader_fnThread1of1ForFork0_~r~0#1.offset| (* (select (select .cse5 |c_reader_fnThread1of1ForFork0_~r~0#1.base|) |c_reader_fnThread1of1ForFork0_~r~0#1.offset|) 4) 4))) (< |v_ULTIMATE.start_ring_enqueue_#t~mem6#1_162| (select .cse6 (+ |c_ULTIMATE.start_writer_fn_~r~1#1.offset| 20))))))))) (= |c_ULTIMATE.start_ring_enqueue_~r#1.offset| 0) (= (select .cse0 |c_reader_fnThread1of1ForFork0_#in~arg#1.offset|) 0) (= |c_ULTIMATE.start_writer_fn_~r~1#1.base| |c_reader_fnThread1of1ForFork0_#in~arg#1.base|) (<= |c_ULTIMATE.start_ring_enqueue_~x#1| .cse8) (= |c_ULTIMATE.start_writer_fn_~r~1#1.base| |c_ULTIMATE.start_ring_enqueue_~r#1.base|) (<= .cse8 |c_ULTIMATE.start_ring_enqueue_~x#1|))) is different from false [2021-11-25 18:55:45,617 WARN L227 SmtUtils]: Spent 18.22s on a formula simplification. DAG size of input: 87 DAG size of output: 79 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-11-25 18:55:56,802 WARN L227 SmtUtils]: Spent 10.99s on a formula simplification. DAG size of input: 86 DAG size of output: 80 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-11-25 18:55:59,074 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_ring_enqueue_#t~mem6#1_162| Int) (v_ArrVal_634 Int)) (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_~r#1.base|))) (or (< |v_ULTIMATE.start_ring_enqueue_#t~mem6#1_162| (select .cse0 (+ |c_ULTIMATE.start_ring_enqueue_~r#1.offset| 20))) (= (+ |c_reader_fnThread1of1ForFork0_~last~0#1| 1) (select (select (store |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_~r#1.base| (store .cse0 (+ (* |v_ULTIMATE.start_ring_enqueue_#t~mem6#1_162| 4) |c_ULTIMATE.start_ring_enqueue_~r#1.offset| 4) v_ArrVal_634)) |c_reader_fnThread1of1ForFork0_~r~0#1.base|) (+ |c_reader_fnThread1of1ForFork0_~r~0#1.offset| (* (select (select |c_#memory_int| |c_reader_fnThread1of1ForFork0_~r~0#1.base|) |c_reader_fnThread1of1ForFork0_~r~0#1.offset|) 4) 4)))))) (forall ((|v_ULTIMATE.start_ring_enqueue_#t~mem6#1_162| Int) (v_ArrVal_634 Int)) (let ((.cse1 (select |c_#memory_int| |c_ULTIMATE.start_writer_fn_~r~1#1.base|))) (or (< |v_ULTIMATE.start_ring_enqueue_#t~mem6#1_162| (select .cse1 (+ |c_ULTIMATE.start_writer_fn_~r~1#1.offset| 20))) (= (+ |c_reader_fnThread1of1ForFork0_~last~0#1| 1) (select (select (store |c_#memory_int| |c_ULTIMATE.start_writer_fn_~r~1#1.base| (store .cse1 (+ (* |v_ULTIMATE.start_ring_enqueue_#t~mem6#1_162| 4) |c_ULTIMATE.start_writer_fn_~r~1#1.offset| 4) v_ArrVal_634)) |c_reader_fnThread1of1ForFork0_~r~0#1.base|) (+ |c_reader_fnThread1of1ForFork0_~r~0#1.offset| (* (select (select |c_#memory_int| |c_reader_fnThread1of1ForFork0_~r~0#1.base|) |c_reader_fnThread1of1ForFork0_~r~0#1.offset|) 4) 4))))))) is different from false [2021-11-25 18:56:29,946 WARN L227 SmtUtils]: Spent 21.81s on a formula simplification. DAG size of input: 55 DAG size of output: 53 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-11-25 18:57:00,038 WARN L227 SmtUtils]: Spent 20.00s on a formula simplification. DAG size of input: 57 DAG size of output: 55 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)