./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix052_power.oepc_power.opt_pso.oepc_rmo.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version dbf71c69 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_afbd90d8-c332-40a8-be44-f10894630e42/bin/utaipan-G1rejxKTta/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_afbd90d8-c332-40a8-be44-f10894630e42/bin/utaipan-G1rejxKTta/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_afbd90d8-c332-40a8-be44-f10894630e42/bin/utaipan-G1rejxKTta/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_afbd90d8-c332-40a8-be44-f10894630e42/bin/utaipan-G1rejxKTta/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix052_power.oepc_power.opt_pso.oepc_rmo.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_afbd90d8-c332-40a8-be44-f10894630e42/bin/utaipan-G1rejxKTta/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_afbd90d8-c332-40a8-be44-f10894630e42/bin/utaipan-G1rejxKTta --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 ebf6aadb7b83b59f90765b7cb8b0362853c5f80603629c3d563bbb938a6df3b1 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-dbf71c6-m [2022-10-17 17:41:54,383 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-10-17 17:41:54,385 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-10-17 17:41:54,428 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-10-17 17:41:54,429 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-10-17 17:41:54,433 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-10-17 17:41:54,436 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-10-17 17:41:54,441 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-10-17 17:41:54,444 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-10-17 17:41:54,450 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-10-17 17:41:54,451 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-10-17 17:41:54,454 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-10-17 17:41:54,455 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-10-17 17:41:54,459 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-10-17 17:41:54,460 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-10-17 17:41:54,462 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-10-17 17:41:54,463 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-10-17 17:41:54,464 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-10-17 17:41:54,465 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-10-17 17:41:54,468 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-10-17 17:41:54,470 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-10-17 17:41:54,471 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-10-17 17:41:54,472 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-10-17 17:41:54,473 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-10-17 17:41:54,478 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-10-17 17:41:54,478 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-10-17 17:41:54,479 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-10-17 17:41:54,480 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-10-17 17:41:54,480 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-10-17 17:41:54,482 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-10-17 17:41:54,482 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-10-17 17:41:54,483 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-10-17 17:41:54,484 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-10-17 17:41:54,485 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-10-17 17:41:54,486 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-10-17 17:41:54,486 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-10-17 17:41:54,487 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-10-17 17:41:54,487 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-10-17 17:41:54,488 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-10-17 17:41:54,489 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-10-17 17:41:54,489 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-10-17 17:41:54,490 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_afbd90d8-c332-40a8-be44-f10894630e42/bin/utaipan-G1rejxKTta/config/svcomp-Reach-32bit-Taipan_Default.epf [2022-10-17 17:41:54,516 INFO L113 SettingsManager]: Loading preferences was successful [2022-10-17 17:41:54,517 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-10-17 17:41:54,517 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-10-17 17:41:54,517 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-10-17 17:41:54,518 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-10-17 17:41:54,518 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-10-17 17:41:54,518 INFO L138 SettingsManager]: * User list type=DISABLED [2022-10-17 17:41:54,518 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-10-17 17:41:54,519 INFO L138 SettingsManager]: * Explicit value domain=true [2022-10-17 17:41:54,519 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-10-17 17:41:54,519 INFO L138 SettingsManager]: * Octagon Domain=false [2022-10-17 17:41:54,519 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-10-17 17:41:54,519 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-10-17 17:41:54,519 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-10-17 17:41:54,520 INFO L138 SettingsManager]: * Interval Domain=false [2022-10-17 17:41:54,520 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-10-17 17:41:54,520 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-10-17 17:41:54,520 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-10-17 17:41:54,521 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-10-17 17:41:54,521 INFO L138 SettingsManager]: * sizeof long=4 [2022-10-17 17:41:54,521 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-10-17 17:41:54,522 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-10-17 17:41:54,522 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-10-17 17:41:54,522 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-10-17 17:41:54,522 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-10-17 17:41:54,522 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-10-17 17:41:54,522 INFO L138 SettingsManager]: * sizeof long double=12 [2022-10-17 17:41:54,523 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-10-17 17:41:54,523 INFO L138 SettingsManager]: * Use constant arrays=true [2022-10-17 17:41:54,523 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-10-17 17:41:54,523 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-10-17 17:41:54,523 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-10-17 17:41:54,524 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-17 17:41:54,524 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-10-17 17:41:54,524 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-10-17 17:41:54,524 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-10-17 17:41:54,524 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-10-17 17:41:54,525 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-10-17 17:41:54,525 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-10-17 17:41:54,525 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-10-17 17:41:54,525 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-10-17 17:41:54,525 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_afbd90d8-c332-40a8-be44-f10894630e42/bin/utaipan-G1rejxKTta/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_afbd90d8-c332-40a8-be44-f10894630e42/bin/utaipan-G1rejxKTta 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 -> ebf6aadb7b83b59f90765b7cb8b0362853c5f80603629c3d563bbb938a6df3b1 [2022-10-17 17:41:54,823 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-10-17 17:41:54,859 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-10-17 17:41:54,862 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-10-17 17:41:54,864 INFO L271 PluginConnector]: Initializing CDTParser... [2022-10-17 17:41:54,865 INFO L275 PluginConnector]: CDTParser initialized [2022-10-17 17:41:54,867 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_afbd90d8-c332-40a8-be44-f10894630e42/bin/utaipan-G1rejxKTta/../../sv-benchmarks/c/pthread-wmm/mix052_power.oepc_power.opt_pso.oepc_rmo.oepc.i [2022-10-17 17:41:54,938 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_afbd90d8-c332-40a8-be44-f10894630e42/bin/utaipan-G1rejxKTta/data/e8847b1f5/531207e6b27848c49a0bfc0c03e354da/FLAG1be7aeed5 [2022-10-17 17:41:55,458 INFO L306 CDTParser]: Found 1 translation units. [2022-10-17 17:41:55,465 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_afbd90d8-c332-40a8-be44-f10894630e42/sv-benchmarks/c/pthread-wmm/mix052_power.oepc_power.opt_pso.oepc_rmo.oepc.i [2022-10-17 17:41:55,487 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_afbd90d8-c332-40a8-be44-f10894630e42/bin/utaipan-G1rejxKTta/data/e8847b1f5/531207e6b27848c49a0bfc0c03e354da/FLAG1be7aeed5 [2022-10-17 17:41:55,772 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_afbd90d8-c332-40a8-be44-f10894630e42/bin/utaipan-G1rejxKTta/data/e8847b1f5/531207e6b27848c49a0bfc0c03e354da [2022-10-17 17:41:55,775 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-10-17 17:41:55,777 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-10-17 17:41:55,778 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-10-17 17:41:55,779 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-10-17 17:41:55,792 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-10-17 17:41:55,793 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.10 05:41:55" (1/1) ... [2022-10-17 17:41:55,794 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@494f5269 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 05:41:55, skipping insertion in model container [2022-10-17 17:41:55,794 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.10 05:41:55" (1/1) ... [2022-10-17 17:41:55,801 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-10-17 17:41:55,874 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-10-17 17:41:56,058 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_afbd90d8-c332-40a8-be44-f10894630e42/sv-benchmarks/c/pthread-wmm/mix052_power.oepc_power.opt_pso.oepc_rmo.oepc.i[979,992] [2022-10-17 17:41:56,266 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-17 17:41:56,275 INFO L203 MainTranslator]: Completed pre-run [2022-10-17 17:41:56,288 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_afbd90d8-c332-40a8-be44-f10894630e42/sv-benchmarks/c/pthread-wmm/mix052_power.oepc_power.opt_pso.oepc_rmo.oepc.i[979,992] [2022-10-17 17:41:56,336 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-17 17:41:56,385 INFO L208 MainTranslator]: Completed translation [2022-10-17 17:41:56,385 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 05:41:56 WrapperNode [2022-10-17 17:41:56,385 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-10-17 17:41:56,387 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-10-17 17:41:56,387 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-10-17 17:41:56,387 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-10-17 17:41:56,395 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 05:41:56" (1/1) ... [2022-10-17 17:41:56,443 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 05:41:56" (1/1) ... [2022-10-17 17:41:56,481 INFO L138 Inliner]: procedures = 176, calls = 54, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 176 [2022-10-17 17:41:56,484 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-10-17 17:41:56,486 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-10-17 17:41:56,486 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-10-17 17:41:56,486 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-10-17 17:41:56,497 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 05:41:56" (1/1) ... [2022-10-17 17:41:56,497 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 05:41:56" (1/1) ... [2022-10-17 17:41:56,514 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 05:41:56" (1/1) ... [2022-10-17 17:41:56,528 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 05:41:56" (1/1) ... [2022-10-17 17:41:56,539 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 05:41:56" (1/1) ... [2022-10-17 17:41:56,555 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 05:41:56" (1/1) ... [2022-10-17 17:41:56,559 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 05:41:56" (1/1) ... [2022-10-17 17:41:56,574 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 05:41:56" (1/1) ... [2022-10-17 17:41:56,580 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-10-17 17:41:56,581 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-10-17 17:41:56,581 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-10-17 17:41:56,581 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-10-17 17:41:56,587 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 05:41:56" (1/1) ... [2022-10-17 17:41:56,598 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-17 17:41:56,617 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_afbd90d8-c332-40a8-be44-f10894630e42/bin/utaipan-G1rejxKTta/z3 [2022-10-17 17:41:56,638 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_afbd90d8-c332-40a8-be44-f10894630e42/bin/utaipan-G1rejxKTta/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-10-17 17:41:56,668 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_afbd90d8-c332-40a8-be44-f10894630e42/bin/utaipan-G1rejxKTta/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-10-17 17:41:56,687 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-10-17 17:41:56,687 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-10-17 17:41:56,687 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-10-17 17:41:56,687 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-10-17 17:41:56,687 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-10-17 17:41:56,688 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-10-17 17:41:56,688 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-10-17 17:41:56,688 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-10-17 17:41:56,688 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-10-17 17:41:56,688 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-10-17 17:41:56,689 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-10-17 17:41:56,689 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-10-17 17:41:56,689 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-10-17 17:41:56,689 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-10-17 17:41:56,689 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-10-17 17:41:56,691 WARN L209 CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-10-17 17:41:56,906 INFO L235 CfgBuilder]: Building ICFG [2022-10-17 17:41:56,924 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-10-17 17:41:57,601 INFO L276 CfgBuilder]: Performing block encoding [2022-10-17 17:41:58,251 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-10-17 17:41:58,251 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-10-17 17:41:58,254 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.10 05:41:58 BoogieIcfgContainer [2022-10-17 17:41:58,254 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-10-17 17:41:58,258 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-10-17 17:41:58,259 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-10-17 17:41:58,262 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-10-17 17:41:58,263 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.10 05:41:55" (1/3) ... [2022-10-17 17:41:58,264 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d4ac8a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.10 05:41:58, skipping insertion in model container [2022-10-17 17:41:58,264 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 05:41:56" (2/3) ... [2022-10-17 17:41:58,265 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d4ac8a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.10 05:41:58, skipping insertion in model container [2022-10-17 17:41:58,265 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.10 05:41:58" (3/3) ... [2022-10-17 17:41:58,267 INFO L112 eAbstractionObserver]: Analyzing ICFG mix052_power.oepc_power.opt_pso.oepc_rmo.oepc.i [2022-10-17 17:41:58,276 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-10-17 17:41:58,288 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-10-17 17:41:58,290 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-10-17 17:41:58,290 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-10-17 17:41:58,379 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-10-17 17:41:58,434 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-10-17 17:41:58,451 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 123 places, 115 transitions, 245 flow [2022-10-17 17:41:58,454 INFO L112 LiptonReduction]: Starting Lipton reduction on Petri net that has 123 places, 115 transitions, 245 flow [2022-10-17 17:41:58,456 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 123 places, 115 transitions, 245 flow [2022-10-17 17:41:58,509 INFO L130 PetriNetUnfolder]: 2/112 cut-off events. [2022-10-17 17:41:58,510 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-10-17 17:41:58,513 INFO L83 FinitePrefix]: Finished finitePrefix Result has 122 conditions, 112 events. 2/112 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 55 event pairs, 0 based on Foata normal form. 0/108 useless extension candidates. Maximal degree in co-relation 73. Up to 2 conditions per place. [2022-10-17 17:41:58,516 INFO L118 LiptonReduction]: Number of co-enabled transitions 2096 [2022-10-17 17:42:03,332 INFO L133 LiptonReduction]: Checked pairs total: 5327 [2022-10-17 17:42:03,332 INFO L135 LiptonReduction]: Total number of compositions: 99 [2022-10-17 17:42:03,342 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 36 places, 26 transitions, 67 flow [2022-10-17 17:42:03,422 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 724 states, 721 states have (on average 3.116504854368932) internal successors, (2247), 723 states have internal predecessors, (2247), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 17:42:03,440 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-10-17 17:42:03,447 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@374b46f7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-10-17 17:42:03,447 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-10-17 17:42:03,453 INFO L276 IsEmpty]: Start isEmpty. Operand has 724 states, 721 states have (on average 3.116504854368932) internal successors, (2247), 723 states have internal predecessors, (2247), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 17:42:03,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-10-17 17:42:03,458 INFO L187 NwaCegarLoop]: Found error trace [2022-10-17 17:42:03,458 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-10-17 17:42:03,459 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-10-17 17:42:03,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-17 17:42:03,465 INFO L85 PathProgramCache]: Analyzing trace with hash 1115925, now seen corresponding path program 1 times [2022-10-17 17:42:03,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-10-17 17:42:03,475 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1253698115] [2022-10-17 17:42:03,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-17 17:42:03,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 17:42:03,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 17:42:03,942 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-17 17:42:03,943 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-10-17 17:42:03,943 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1253698115] [2022-10-17 17:42:03,944 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1253698115] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-17 17:42:03,944 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-17 17:42:03,944 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-10-17 17:42:03,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2114105145] [2022-10-17 17:42:03,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-17 17:42:03,951 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-17 17:42:03,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-10-17 17:42:03,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-17 17:42:03,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-17 17:42:03,980 INFO L87 Difference]: Start difference. First operand has 724 states, 721 states have (on average 3.116504854368932) internal successors, (2247), 723 states have internal predecessors, (2247), 0 states have call successors, (0), 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 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 17:42:04,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-17 17:42:04,141 INFO L93 Difference]: Finished difference Result 587 states and 1790 transitions. [2022-10-17 17:42:04,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-17 17:42:04,144 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 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 3 [2022-10-17 17:42:04,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-17 17:42:04,173 INFO L225 Difference]: With dead ends: 587 [2022-10-17 17:42:04,174 INFO L226 Difference]: Without dead ends: 562 [2022-10-17 17:42:04,175 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-17 17:42:04,179 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 12 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-17 17:42:04,181 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 4 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-17 17:42:04,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 562 states. [2022-10-17 17:42:04,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 562 to 562. [2022-10-17 17:42:04,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 562 states, 561 states have (on average 3.0748663101604277) internal successors, (1725), 561 states have internal predecessors, (1725), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 17:42:04,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 562 states to 562 states and 1725 transitions. [2022-10-17 17:42:04,279 INFO L78 Accepts]: Start accepts. Automaton has 562 states and 1725 transitions. Word has length 3 [2022-10-17 17:42:04,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-17 17:42:04,280 INFO L495 AbstractCegarLoop]: Abstraction has 562 states and 1725 transitions. [2022-10-17 17:42:04,280 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 17:42:04,280 INFO L276 IsEmpty]: Start isEmpty. Operand 562 states and 1725 transitions. [2022-10-17 17:42:04,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-10-17 17:42:04,282 INFO L187 NwaCegarLoop]: Found error trace [2022-10-17 17:42:04,282 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-17 17:42:04,283 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-10-17 17:42:04,283 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-10-17 17:42:04,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-17 17:42:04,286 INFO L85 PathProgramCache]: Analyzing trace with hash 307824273, now seen corresponding path program 1 times [2022-10-17 17:42:04,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-10-17 17:42:04,286 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [258071759] [2022-10-17 17:42:04,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-17 17:42:04,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 17:42:04,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 17:42:04,590 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-17 17:42:04,591 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-10-17 17:42:04,591 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [258071759] [2022-10-17 17:42:04,591 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [258071759] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-17 17:42:04,592 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-17 17:42:04,592 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-10-17 17:42:04,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1176039244] [2022-10-17 17:42:04,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-17 17:42:04,593 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-17 17:42:04,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-10-17 17:42:04,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-17 17:42:04,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-17 17:42:04,595 INFO L87 Difference]: Start difference. First operand 562 states and 1725 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 17:42:04,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-17 17:42:04,702 INFO L93 Difference]: Finished difference Result 852 states and 2499 transitions. [2022-10-17 17:42:04,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-17 17:42:04,703 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 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 9 [2022-10-17 17:42:04,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-17 17:42:04,713 INFO L225 Difference]: With dead ends: 852 [2022-10-17 17:42:04,714 INFO L226 Difference]: Without dead ends: 771 [2022-10-17 17:42:04,715 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-17 17:42:04,717 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 8 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-17 17:42:04,718 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 3 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-17 17:42:04,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 771 states. [2022-10-17 17:42:04,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 771 to 702. [2022-10-17 17:42:04,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 702 states, 701 states have (on average 2.9985734664764623) internal successors, (2102), 701 states have internal predecessors, (2102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 17:42:04,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 702 states to 702 states and 2102 transitions. [2022-10-17 17:42:04,787 INFO L78 Accepts]: Start accepts. Automaton has 702 states and 2102 transitions. Word has length 9 [2022-10-17 17:42:04,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-17 17:42:04,788 INFO L495 AbstractCegarLoop]: Abstraction has 702 states and 2102 transitions. [2022-10-17 17:42:04,788 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 17:42:04,789 INFO L276 IsEmpty]: Start isEmpty. Operand 702 states and 2102 transitions. [2022-10-17 17:42:04,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-10-17 17:42:04,793 INFO L187 NwaCegarLoop]: Found error trace [2022-10-17 17:42:04,793 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-17 17:42:04,794 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-10-17 17:42:04,794 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-10-17 17:42:04,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-17 17:42:04,796 INFO L85 PathProgramCache]: Analyzing trace with hash -439934280, now seen corresponding path program 1 times [2022-10-17 17:42:04,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-10-17 17:42:04,802 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1561899609] [2022-10-17 17:42:04,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-17 17:42:04,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 17:42:04,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 17:42:05,061 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-17 17:42:05,061 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-10-17 17:42:05,062 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1561899609] [2022-10-17 17:42:05,062 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1561899609] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-17 17:42:05,062 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-17 17:42:05,062 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-17 17:42:05,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [857649075] [2022-10-17 17:42:05,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-17 17:42:05,063 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-17 17:42:05,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-10-17 17:42:05,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-17 17:42:05,063 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-17 17:42:05,064 INFO L87 Difference]: Start difference. First operand 702 states and 2102 transitions. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 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) [2022-10-17 17:42:05,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-17 17:42:05,141 INFO L93 Difference]: Finished difference Result 478 states and 1214 transitions. [2022-10-17 17:42:05,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-17 17:42:05,141 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 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 [2022-10-17 17:42:05,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-17 17:42:05,145 INFO L225 Difference]: With dead ends: 478 [2022-10-17 17:42:05,146 INFO L226 Difference]: Without dead ends: 478 [2022-10-17 17:42:05,147 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-17 17:42:05,151 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 8 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-17 17:42:05,153 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 4 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-17 17:42:05,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 478 states. [2022-10-17 17:42:05,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 478 to 478. [2022-10-17 17:42:05,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 478 states, 477 states have (on average 2.5450733752620547) internal successors, (1214), 477 states have internal predecessors, (1214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 17:42:05,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 478 states to 478 states and 1214 transitions. [2022-10-17 17:42:05,177 INFO L78 Accepts]: Start accepts. Automaton has 478 states and 1214 transitions. Word has length 10 [2022-10-17 17:42:05,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-17 17:42:05,179 INFO L495 AbstractCegarLoop]: Abstraction has 478 states and 1214 transitions. [2022-10-17 17:42:05,179 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 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) [2022-10-17 17:42:05,180 INFO L276 IsEmpty]: Start isEmpty. Operand 478 states and 1214 transitions. [2022-10-17 17:42:05,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-10-17 17:42:05,187 INFO L187 NwaCegarLoop]: Found error trace [2022-10-17 17:42:05,187 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-17 17:42:05,187 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-10-17 17:42:05,188 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-10-17 17:42:05,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-17 17:42:05,188 INFO L85 PathProgramCache]: Analyzing trace with hash -1096747094, now seen corresponding path program 1 times [2022-10-17 17:42:05,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-10-17 17:42:05,189 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1915301939] [2022-10-17 17:42:05,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-17 17:42:05,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 17:42:05,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 17:42:05,446 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-17 17:42:05,446 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-10-17 17:42:05,446 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1915301939] [2022-10-17 17:42:05,447 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1915301939] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-17 17:42:05,447 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-17 17:42:05,447 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-17 17:42:05,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1949512115] [2022-10-17 17:42:05,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-17 17:42:05,448 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-17 17:42:05,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-10-17 17:42:05,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-17 17:42:05,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-10-17 17:42:05,449 INFO L87 Difference]: Start difference. First operand 478 states and 1214 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 17:42:05,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-17 17:42:05,568 INFO L93 Difference]: Finished difference Result 300 states and 688 transitions. [2022-10-17 17:42:05,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-17 17:42:05,569 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-10-17 17:42:05,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-17 17:42:05,571 INFO L225 Difference]: With dead ends: 300 [2022-10-17 17:42:05,571 INFO L226 Difference]: Without dead ends: 300 [2022-10-17 17:42:05,572 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-10-17 17:42:05,573 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 25 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-17 17:42:05,573 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 6 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-17 17:42:05,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2022-10-17 17:42:05,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 288. [2022-10-17 17:42:05,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 288 states, 287 states have (on average 2.2857142857142856) internal successors, (656), 287 states have internal predecessors, (656), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 17:42:05,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 656 transitions. [2022-10-17 17:42:05,586 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 656 transitions. Word has length 13 [2022-10-17 17:42:05,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-17 17:42:05,586 INFO L495 AbstractCegarLoop]: Abstraction has 288 states and 656 transitions. [2022-10-17 17:42:05,586 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 17:42:05,586 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 656 transitions. [2022-10-17 17:42:05,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-10-17 17:42:05,588 INFO L187 NwaCegarLoop]: Found error trace [2022-10-17 17:42:05,588 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-17 17:42:05,588 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-10-17 17:42:05,588 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-10-17 17:42:05,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-17 17:42:05,589 INFO L85 PathProgramCache]: Analyzing trace with hash 1913218638, now seen corresponding path program 1 times [2022-10-17 17:42:05,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-10-17 17:42:05,594 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1785212931] [2022-10-17 17:42:05,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-17 17:42:05,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 17:42:05,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 17:42:05,812 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-17 17:42:05,812 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-10-17 17:42:05,813 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1785212931] [2022-10-17 17:42:05,813 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1785212931] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-17 17:42:05,813 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-17 17:42:05,816 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-17 17:42:05,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [706534605] [2022-10-17 17:42:05,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-17 17:42:05,817 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-17 17:42:05,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-10-17 17:42:05,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-17 17:42:05,817 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-17 17:42:05,818 INFO L87 Difference]: Start difference. First operand 288 states and 656 transitions. Second operand has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 17:42:05,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-17 17:42:05,932 INFO L93 Difference]: Finished difference Result 394 states and 885 transitions. [2022-10-17 17:42:05,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-17 17:42:05,932 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-10-17 17:42:05,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-17 17:42:05,934 INFO L225 Difference]: With dead ends: 394 [2022-10-17 17:42:05,934 INFO L226 Difference]: Without dead ends: 239 [2022-10-17 17:42:05,936 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-17 17:42:05,938 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 8 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-17 17:42:05,939 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 4 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-17 17:42:05,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2022-10-17 17:42:05,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 225. [2022-10-17 17:42:05,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 225 states, 224 states have (on average 2.200892857142857) internal successors, (493), 224 states have internal predecessors, (493), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 17:42:05,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 493 transitions. [2022-10-17 17:42:05,948 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 493 transitions. Word has length 17 [2022-10-17 17:42:05,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-17 17:42:05,949 INFO L495 AbstractCegarLoop]: Abstraction has 225 states and 493 transitions. [2022-10-17 17:42:05,949 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 17:42:05,949 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 493 transitions. [2022-10-17 17:42:05,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-10-17 17:42:05,950 INFO L187 NwaCegarLoop]: Found error trace [2022-10-17 17:42:05,950 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-17 17:42:05,950 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-10-17 17:42:05,950 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-10-17 17:42:05,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-17 17:42:05,951 INFO L85 PathProgramCache]: Analyzing trace with hash -1059916880, now seen corresponding path program 2 times [2022-10-17 17:42:05,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-10-17 17:42:05,951 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1512878530] [2022-10-17 17:42:05,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-17 17:42:05,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 17:42:06,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 17:42:06,263 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-17 17:42:06,264 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-10-17 17:42:06,264 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1512878530] [2022-10-17 17:42:06,264 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1512878530] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-17 17:42:06,264 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-17 17:42:06,264 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-10-17 17:42:06,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1100032081] [2022-10-17 17:42:06,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-17 17:42:06,265 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-10-17 17:42:06,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-10-17 17:42:06,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-10-17 17:42:06,266 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-10-17 17:42:06,266 INFO L87 Difference]: Start difference. First operand 225 states and 493 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 17:42:06,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-17 17:42:06,375 INFO L93 Difference]: Finished difference Result 190 states and 425 transitions. [2022-10-17 17:42:06,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-10-17 17:42:06,376 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-10-17 17:42:06,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-17 17:42:06,377 INFO L225 Difference]: With dead ends: 190 [2022-10-17 17:42:06,377 INFO L226 Difference]: Without dead ends: 134 [2022-10-17 17:42:06,378 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-10-17 17:42:06,379 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 63 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 5 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-17 17:42:06,380 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 5 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-17 17:42:06,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2022-10-17 17:42:06,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 134. [2022-10-17 17:42:06,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 133 states have (on average 2.2030075187969924) internal successors, (293), 133 states have internal predecessors, (293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 17:42:06,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 293 transitions. [2022-10-17 17:42:06,387 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 293 transitions. Word has length 17 [2022-10-17 17:42:06,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-17 17:42:06,387 INFO L495 AbstractCegarLoop]: Abstraction has 134 states and 293 transitions. [2022-10-17 17:42:06,387 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 17:42:06,387 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 293 transitions. [2022-10-17 17:42:06,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-10-17 17:42:06,388 INFO L187 NwaCegarLoop]: Found error trace [2022-10-17 17:42:06,388 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-17 17:42:06,389 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-10-17 17:42:06,390 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-10-17 17:42:06,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-17 17:42:06,390 INFO L85 PathProgramCache]: Analyzing trace with hash 909023402, now seen corresponding path program 1 times [2022-10-17 17:42:06,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-10-17 17:42:06,391 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2057853039] [2022-10-17 17:42:06,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-17 17:42:06,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 17:42:06,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 17:42:06,804 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-17 17:42:06,804 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-10-17 17:42:06,804 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2057853039] [2022-10-17 17:42:06,805 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2057853039] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-17 17:42:06,806 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-17 17:42:06,806 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-17 17:42:06,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [79499857] [2022-10-17 17:42:06,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-17 17:42:06,808 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-17 17:42:06,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-10-17 17:42:06,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-17 17:42:06,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-17 17:42:06,809 INFO L87 Difference]: Start difference. First operand 134 states and 293 transitions. Second operand has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 17:42:06,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-17 17:42:06,926 INFO L93 Difference]: Finished difference Result 181 states and 391 transitions. [2022-10-17 17:42:06,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-10-17 17:42:06,926 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 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 [2022-10-17 17:42:06,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-17 17:42:06,927 INFO L225 Difference]: With dead ends: 181 [2022-10-17 17:42:06,928 INFO L226 Difference]: Without dead ends: 119 [2022-10-17 17:42:06,928 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-10-17 17:42:06,929 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 25 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-17 17:42:06,929 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 4 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-17 17:42:06,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2022-10-17 17:42:06,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 110. [2022-10-17 17:42:06,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 109 states have (on average 2.1376146788990824) internal successors, (233), 109 states have internal predecessors, (233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 17:42:06,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 233 transitions. [2022-10-17 17:42:06,935 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 233 transitions. Word has length 21 [2022-10-17 17:42:06,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-17 17:42:06,935 INFO L495 AbstractCegarLoop]: Abstraction has 110 states and 233 transitions. [2022-10-17 17:42:06,935 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 17:42:06,936 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 233 transitions. [2022-10-17 17:42:06,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-10-17 17:42:06,937 INFO L187 NwaCegarLoop]: Found error trace [2022-10-17 17:42:06,937 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-17 17:42:06,948 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-10-17 17:42:06,949 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-10-17 17:42:06,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-17 17:42:06,949 INFO L85 PathProgramCache]: Analyzing trace with hash -1971951804, now seen corresponding path program 2 times [2022-10-17 17:42:06,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-10-17 17:42:06,949 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1897223475] [2022-10-17 17:42:06,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-17 17:42:06,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 17:42:07,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 17:42:07,297 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-17 17:42:07,298 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-10-17 17:42:07,298 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1897223475] [2022-10-17 17:42:07,298 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1897223475] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-17 17:42:07,299 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-17 17:42:07,299 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-17 17:42:07,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2071989465] [2022-10-17 17:42:07,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-17 17:42:07,300 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-17 17:42:07,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-10-17 17:42:07,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-17 17:42:07,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-17 17:42:07,301 INFO L87 Difference]: Start difference. First operand 110 states and 233 transitions. Second operand has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 17:42:07,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-17 17:42:07,420 INFO L93 Difference]: Finished difference Result 148 states and 310 transitions. [2022-10-17 17:42:07,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-17 17:42:07,421 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 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 [2022-10-17 17:42:07,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-17 17:42:07,422 INFO L225 Difference]: With dead ends: 148 [2022-10-17 17:42:07,422 INFO L226 Difference]: Without dead ends: 102 [2022-10-17 17:42:07,422 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-10-17 17:42:07,423 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 19 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-17 17:42:07,424 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 6 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-17 17:42:07,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2022-10-17 17:42:07,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2022-10-17 17:42:07,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 101 states have (on average 2.108910891089109) internal successors, (213), 101 states have internal predecessors, (213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 17:42:07,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 213 transitions. [2022-10-17 17:42:07,430 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 213 transitions. Word has length 21 [2022-10-17 17:42:07,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-17 17:42:07,430 INFO L495 AbstractCegarLoop]: Abstraction has 102 states and 213 transitions. [2022-10-17 17:42:07,430 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 17:42:07,430 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 213 transitions. [2022-10-17 17:42:07,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-10-17 17:42:07,431 INFO L187 NwaCegarLoop]: Found error trace [2022-10-17 17:42:07,431 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-17 17:42:07,432 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-10-17 17:42:07,432 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-10-17 17:42:07,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-17 17:42:07,432 INFO L85 PathProgramCache]: Analyzing trace with hash -1700667402, now seen corresponding path program 3 times [2022-10-17 17:42:07,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-10-17 17:42:07,433 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1573358982] [2022-10-17 17:42:07,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-17 17:42:07,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 17:42:07,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-10-17 17:42:07,538 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-10-17 17:42:07,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-10-17 17:42:07,696 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2022-10-17 17:42:07,697 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-10-17 17:42:07,698 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-10-17 17:42:07,701 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2022-10-17 17:42:07,701 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2022-10-17 17:42:07,701 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2022-10-17 17:42:07,702 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2022-10-17 17:42:07,702 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-10-17 17:42:07,702 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-10-17 17:42:07,705 INFO L444 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1, 1, 1] [2022-10-17 17:42:07,712 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-10-17 17:42:07,712 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-10-17 17:42:07,863 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.10 05:42:07 BasicIcfg [2022-10-17 17:42:07,864 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-10-17 17:42:07,865 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-10-17 17:42:07,865 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-10-17 17:42:07,865 INFO L275 PluginConnector]: Witness Printer initialized [2022-10-17 17:42:07,865 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.10 05:41:58" (3/4) ... [2022-10-17 17:42:07,867 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-10-17 17:42:07,996 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_afbd90d8-c332-40a8-be44-f10894630e42/bin/utaipan-G1rejxKTta/witness.graphml [2022-10-17 17:42:07,996 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-10-17 17:42:07,997 INFO L158 Benchmark]: Toolchain (without parser) took 12220.43ms. Allocated memory was 117.4MB in the beginning and 222.3MB in the end (delta: 104.9MB). Free memory was 74.3MB in the beginning and 85.8MB in the end (delta: -11.6MB). Peak memory consumption was 91.7MB. Max. memory is 16.1GB. [2022-10-17 17:42:07,997 INFO L158 Benchmark]: CDTParser took 0.32ms. Allocated memory is still 117.4MB. Free memory is still 92.7MB. There was no memory consumed. Max. memory is 16.1GB. [2022-10-17 17:42:07,998 INFO L158 Benchmark]: CACSL2BoogieTranslator took 607.36ms. Allocated memory is still 117.4MB. Free memory was 74.1MB in the beginning and 77.2MB in the end (delta: -3.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-10-17 17:42:07,999 INFO L158 Benchmark]: Boogie Procedure Inliner took 98.60ms. Allocated memory is still 117.4MB. Free memory was 77.2MB in the beginning and 74.7MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-10-17 17:42:07,999 INFO L158 Benchmark]: Boogie Preprocessor took 93.86ms. Allocated memory is still 117.4MB. Free memory was 74.7MB in the beginning and 72.2MB in the end (delta: 2.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-10-17 17:42:07,999 INFO L158 Benchmark]: RCFGBuilder took 1674.05ms. Allocated memory is still 117.4MB. Free memory was 72.2MB in the beginning and 63.6MB in the end (delta: 8.6MB). Peak memory consumption was 41.8MB. Max. memory is 16.1GB. [2022-10-17 17:42:08,000 INFO L158 Benchmark]: TraceAbstraction took 9605.41ms. Allocated memory was 117.4MB in the beginning and 222.3MB in the end (delta: 104.9MB). Free memory was 62.9MB in the beginning and 100.5MB in the end (delta: -37.6MB). Peak memory consumption was 66.6MB. Max. memory is 16.1GB. [2022-10-17 17:42:08,000 INFO L158 Benchmark]: Witness Printer took 132.00ms. Allocated memory is still 222.3MB. Free memory was 100.5MB in the beginning and 85.8MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2022-10-17 17:42:08,003 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.32ms. Allocated memory is still 117.4MB. Free memory is still 92.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 607.36ms. Allocated memory is still 117.4MB. Free memory was 74.1MB in the beginning and 77.2MB in the end (delta: -3.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 98.60ms. Allocated memory is still 117.4MB. Free memory was 77.2MB in the beginning and 74.7MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 93.86ms. Allocated memory is still 117.4MB. Free memory was 74.7MB in the beginning and 72.2MB in the end (delta: 2.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 1674.05ms. Allocated memory is still 117.4MB. Free memory was 72.2MB in the beginning and 63.6MB in the end (delta: 8.6MB). Peak memory consumption was 41.8MB. Max. memory is 16.1GB. * TraceAbstraction took 9605.41ms. Allocated memory was 117.4MB in the beginning and 222.3MB in the end (delta: 104.9MB). Free memory was 62.9MB in the beginning and 100.5MB in the end (delta: -37.6MB). Peak memory consumption was 66.6MB. Max. memory is 16.1GB. * Witness Printer took 132.00ms. Allocated memory is still 222.3MB. Free memory was 100.5MB in the beginning and 85.8MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.9s, 123 PlacesBefore, 36 PlacesAfterwards, 115 TransitionsBefore, 26 TransitionsAfterwards, 2096 CoEnabledTransitionPairs, 7 FixpointIterations, 41 TrivialSequentialCompositions, 52 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 4 ConcurrentYvCompositions, 2 ChoiceCompositions, 99 TotalNumberOfCompositions, 5327 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2603, positive: 2428, positive conditional: 0, positive unconditional: 2428, negative: 175, negative conditional: 0, negative unconditional: 175, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1449, positive: 1398, positive conditional: 0, positive unconditional: 1398, negative: 51, negative conditional: 0, negative unconditional: 51, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1449, positive: 1389, positive conditional: 0, positive unconditional: 1389, negative: 60, negative conditional: 0, negative unconditional: 60, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 60, positive: 9, positive conditional: 0, positive unconditional: 9, negative: 51, negative conditional: 0, negative unconditional: 51, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 454, positive: 28, positive conditional: 0, positive unconditional: 28, negative: 426, negative conditional: 0, negative unconditional: 426, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2603, positive: 1030, positive conditional: 0, positive unconditional: 1030, negative: 124, negative conditional: 0, negative unconditional: 124, unknown: 1449, unknown conditional: 0, unknown unconditional: 1449] , Statistics on independence cache: Total cache size (in pairs): 118, Positive cache size: 98, Positive conditional cache size: 0, Positive unconditional cache size: 98, Negative cache size: 20, Negative conditional cache size: 0, Negative unconditional cache size: 20 - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p1_EAX = 0; [L713] 0 int __unbuffered_p2_EAX = 0; [L714] 0 _Bool main$tmp_guard0; [L715] 0 _Bool main$tmp_guard1; [L717] 0 int x = 0; [L719] 0 int y = 0; [L721] 0 int z = 0; [L722] 0 _Bool z$flush_delayed; [L723] 0 int z$mem_tmp; [L724] 0 _Bool z$r_buff0_thd0; [L725] 0 _Bool z$r_buff0_thd1; [L726] 0 _Bool z$r_buff0_thd2; [L727] 0 _Bool z$r_buff0_thd3; [L728] 0 _Bool z$r_buff1_thd0; [L729] 0 _Bool z$r_buff1_thd1; [L730] 0 _Bool z$r_buff1_thd2; [L731] 0 _Bool z$r_buff1_thd3; [L732] 0 _Bool z$read_delayed; [L733] 0 int *z$read_delayed_var; [L734] 0 int z$w_buff0; [L735] 0 _Bool z$w_buff0_used; [L736] 0 int z$w_buff1; [L737] 0 _Bool z$w_buff1_used; [L738] 0 _Bool weak$$choice0; [L739] 0 _Bool weak$$choice2; [L833] 0 pthread_t t1385; [L834] FCALL, FORK 0 pthread_create(&t1385, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1385, ((void *)0), P0, ((void *)0))=-3, t1385={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L743] 1 z$w_buff1 = z$w_buff0 [L744] 1 z$w_buff0 = 1 [L745] 1 z$w_buff1_used = z$w_buff0_used [L746] 1 z$w_buff0_used = (_Bool)1 [L747] CALL 1 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L747] RET 1 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L748] 1 z$r_buff1_thd0 = z$r_buff0_thd0 [L749] 1 z$r_buff1_thd1 = z$r_buff0_thd1 [L750] 1 z$r_buff1_thd2 = z$r_buff0_thd2 [L751] 1 z$r_buff1_thd3 = z$r_buff0_thd3 [L752] 1 z$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L835] 0 pthread_t t1386; [L836] FCALL, FORK 0 pthread_create(&t1386, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1386, ((void *)0), P1, ((void *)0))=-2, t1385={5:0}, t1386={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L837] 0 pthread_t t1387; [L838] FCALL, FORK 0 pthread_create(&t1387, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1387, ((void *)0), P2, ((void *)0))=-1, t1385={5:0}, t1386={6:0}, t1387={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L755] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L772] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L775] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L778] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L778] EXPR 2 z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z [L778] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L778] 2 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L779] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L779] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L780] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L780] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L781] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L781] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L782] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 [L782] 2 z$r_buff1_thd2 = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 [L785] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L787] 2 return 0; [L792] 3 y = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L795] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L796] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L797] 3 z$flush_delayed = weak$$choice2 [L798] 3 z$mem_tmp = z [L799] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L799] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L800] EXPR 3 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L800] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0) [L800] EXPR 3 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L800] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L801] EXPR 3 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L801] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1) [L801] EXPR 3 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L801] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L802] EXPR 3 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L802] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used) [L802] EXPR 3 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L802] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L803] EXPR 3 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L803] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0) [L803] EXPR 3 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L803] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L804] EXPR 3 weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L804] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3) [L804] EXPR 3 weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L804] 3 z$r_buff0_thd3 = weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L805] EXPR 3 weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L805] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0) [L805] EXPR 3 weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L805] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L806] 3 __unbuffered_p2_EAX = z [L807] EXPR 3 z$flush_delayed ? z$mem_tmp : z [L807] 3 z = z$flush_delayed ? z$mem_tmp : z [L808] 3 z$flush_delayed = (_Bool)0 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L811] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L811] EXPR 3 z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z [L811] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L811] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L812] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L812] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L813] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L813] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L814] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L814] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L815] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L815] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L818] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L820] 3 return 0; [L758] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L758] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L759] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L759] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L760] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L760] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L761] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L761] 1 z$r_buff0_thd1 = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L762] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 [L762] 1 z$r_buff1_thd1 = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 [L765] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L767] 1 return 0; [L840] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L842] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L842] RET 0 assume_abort_if_not(main$tmp_guard0) [L844] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L844] EXPR 0 z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z [L844] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L844] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L845] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L845] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L846] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L846] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L847] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L847] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L848] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L848] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L851] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 0) [L853] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=1, \old(expression)=0, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 838]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 836]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 834]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 142 locations, 6 error locations. Started 1 CEGAR loops. OverallTime: 9.3s, OverallIterations: 9, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 1.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 5.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 168 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 168 mSDsluCounter, 36 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 175 mSDsCounter, 20 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 394 IncrementalHoareTripleChecker+Invalid, 414 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 20 mSolverCounterUnsat, 20 mSDtfsCounter, 394 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 22 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=724occurred in iteration=0, InterpolantAutomatonStates: 30, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 8 MinimizatonAttempts, 104 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 132 NumberOfCodeBlocks, 132 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 103 ConstructedInterpolants, 0 QuantifiedInterpolants, 411 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-10-17 17:42:08,067 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_afbd90d8-c332-40a8-be44-f10894630e42/bin/utaipan-G1rejxKTta/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE