./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/safe019_power.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6b4ec56b Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_417cc7ff-4de4-4099-9cc1-4c85084e6151/bin/utaipan-6cKwYrpEi9/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_417cc7ff-4de4-4099-9cc1-4c85084e6151/bin/utaipan-6cKwYrpEi9/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_417cc7ff-4de4-4099-9cc1-4c85084e6151/bin/utaipan-6cKwYrpEi9/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_417cc7ff-4de4-4099-9cc1-4c85084e6151/bin/utaipan-6cKwYrpEi9/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-wmm/safe019_power.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_417cc7ff-4de4-4099-9cc1-4c85084e6151/bin/utaipan-6cKwYrpEi9/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_417cc7ff-4de4-4099-9cc1-4c85084e6151/bin/utaipan-6cKwYrpEi9 --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 e9fa0a1b11704376245a2fedbc5c4fb7e02255cba008bc8067c3e06529a17976 --- 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-6b4ec56 [2022-11-20 19:52:56,579 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-20 19:52:56,582 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-20 19:52:56,625 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-20 19:52:56,625 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-20 19:52:56,629 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-20 19:52:56,631 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-20 19:52:56,634 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-20 19:52:56,637 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-20 19:52:56,643 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-20 19:52:56,644 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-20 19:52:56,646 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-20 19:52:56,647 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-20 19:52:56,650 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-20 19:52:56,651 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-20 19:52:56,653 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-20 19:52:56,655 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-20 19:52:56,656 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-20 19:52:56,658 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-20 19:52:56,665 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-20 19:52:56,666 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-20 19:52:56,669 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-20 19:52:56,670 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-20 19:52:56,672 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-20 19:52:56,682 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-20 19:52:56,683 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-20 19:52:56,684 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-20 19:52:56,686 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-20 19:52:56,686 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-20 19:52:56,688 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-20 19:52:56,688 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-20 19:52:56,689 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-20 19:52:56,691 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-20 19:52:56,692 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-20 19:52:56,694 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-20 19:52:56,695 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-20 19:52:56,695 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-20 19:52:56,696 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-20 19:52:56,696 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-20 19:52:56,698 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-20 19:52:56,699 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-20 19:52:56,700 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_417cc7ff-4de4-4099-9cc1-4c85084e6151/bin/utaipan-6cKwYrpEi9/config/svcomp-Reach-32bit-Taipan_Default.epf [2022-11-20 19:52:56,740 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-20 19:52:56,741 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-20 19:52:56,741 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-20 19:52:56,742 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-20 19:52:56,742 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-20 19:52:56,743 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-20 19:52:56,743 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-20 19:52:56,743 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-20 19:52:56,743 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-20 19:52:56,744 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-20 19:52:56,745 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-20 19:52:56,745 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-20 19:52:56,745 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-20 19:52:56,745 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-20 19:52:56,746 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-20 19:52:56,746 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-20 19:52:56,746 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-20 19:52:56,746 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-20 19:52:56,747 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-20 19:52:56,748 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-20 19:52:56,748 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-20 19:52:56,748 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-20 19:52:56,748 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-20 19:52:56,749 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-20 19:52:56,749 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-20 19:52:56,749 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-20 19:52:56,750 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-20 19:52:56,750 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-20 19:52:56,750 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-20 19:52:56,750 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-20 19:52:56,751 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-20 19:52:56,751 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-20 19:52:56,751 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 19:52:56,752 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-20 19:52:56,752 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-20 19:52:56,752 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-20 19:52:56,752 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-20 19:52:56,753 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-20 19:52:56,753 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-20 19:52:56,753 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-20 19:52:56,753 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-20 19:52:56,754 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_417cc7ff-4de4-4099-9cc1-4c85084e6151/bin/utaipan-6cKwYrpEi9/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_417cc7ff-4de4-4099-9cc1-4c85084e6151/bin/utaipan-6cKwYrpEi9 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 -> e9fa0a1b11704376245a2fedbc5c4fb7e02255cba008bc8067c3e06529a17976 [2022-11-20 19:52:57,072 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-20 19:52:57,106 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-20 19:52:57,109 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-20 19:52:57,110 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-20 19:52:57,111 INFO L275 PluginConnector]: CDTParser initialized [2022-11-20 19:52:57,112 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_417cc7ff-4de4-4099-9cc1-4c85084e6151/bin/utaipan-6cKwYrpEi9/../../sv-benchmarks/c/pthread-wmm/safe019_power.oepc.i [2022-11-20 19:53:00,102 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-20 19:53:00,513 INFO L351 CDTParser]: Found 1 translation units. [2022-11-20 19:53:00,518 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_417cc7ff-4de4-4099-9cc1-4c85084e6151/sv-benchmarks/c/pthread-wmm/safe019_power.oepc.i [2022-11-20 19:53:00,538 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_417cc7ff-4de4-4099-9cc1-4c85084e6151/bin/utaipan-6cKwYrpEi9/data/eab55781e/aaf0d64de9194551b02f54c1c46762e8/FLAGb8004f7ec [2022-11-20 19:53:00,559 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_417cc7ff-4de4-4099-9cc1-4c85084e6151/bin/utaipan-6cKwYrpEi9/data/eab55781e/aaf0d64de9194551b02f54c1c46762e8 [2022-11-20 19:53:00,562 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-20 19:53:00,564 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-20 19:53:00,568 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-20 19:53:00,568 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-20 19:53:00,572 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-20 19:53:00,572 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 07:53:00" (1/1) ... [2022-11-20 19:53:00,574 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@167289d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:53:00, skipping insertion in model container [2022-11-20 19:53:00,575 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 07:53:00" (1/1) ... [2022-11-20 19:53:00,582 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-20 19:53:00,646 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-20 19:53:00,848 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_417cc7ff-4de4-4099-9cc1-4c85084e6151/sv-benchmarks/c/pthread-wmm/safe019_power.oepc.i[995,1008] [2022-11-20 19:53:01,187 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 19:53:01,198 INFO L203 MainTranslator]: Completed pre-run [2022-11-20 19:53:01,213 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_417cc7ff-4de4-4099-9cc1-4c85084e6151/sv-benchmarks/c/pthread-wmm/safe019_power.oepc.i[995,1008] [2022-11-20 19:53:01,308 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 19:53:01,362 INFO L208 MainTranslator]: Completed translation [2022-11-20 19:53:01,363 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:53:01 WrapperNode [2022-11-20 19:53:01,363 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-20 19:53:01,365 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-20 19:53:01,365 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-20 19:53:01,365 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-20 19:53:01,372 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:53:01" (1/1) ... [2022-11-20 19:53:01,416 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:53:01" (1/1) ... [2022-11-20 19:53:01,460 INFO L138 Inliner]: procedures = 177, calls = 87, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 182 [2022-11-20 19:53:01,469 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-20 19:53:01,470 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-20 19:53:01,470 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-20 19:53:01,471 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-20 19:53:01,481 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:53:01" (1/1) ... [2022-11-20 19:53:01,481 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:53:01" (1/1) ... [2022-11-20 19:53:01,502 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:53:01" (1/1) ... [2022-11-20 19:53:01,503 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:53:01" (1/1) ... [2022-11-20 19:53:01,512 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:53:01" (1/1) ... [2022-11-20 19:53:01,527 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:53:01" (1/1) ... [2022-11-20 19:53:01,529 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:53:01" (1/1) ... [2022-11-20 19:53:01,534 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:53:01" (1/1) ... [2022-11-20 19:53:01,553 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-20 19:53:01,554 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-20 19:53:01,554 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-20 19:53:01,554 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-20 19:53:01,555 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:53:01" (1/1) ... [2022-11-20 19:53:01,562 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 19:53:01,589 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_417cc7ff-4de4-4099-9cc1-4c85084e6151/bin/utaipan-6cKwYrpEi9/z3 [2022-11-20 19:53:01,609 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_417cc7ff-4de4-4099-9cc1-4c85084e6151/bin/utaipan-6cKwYrpEi9/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-20 19:53:01,617 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_417cc7ff-4de4-4099-9cc1-4c85084e6151/bin/utaipan-6cKwYrpEi9/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-20 19:53:01,653 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-20 19:53:01,653 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-20 19:53:01,653 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-20 19:53:01,653 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-20 19:53:01,654 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-20 19:53:01,654 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-20 19:53:01,654 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-11-20 19:53:01,654 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-11-20 19:53:01,654 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-11-20 19:53:01,655 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-11-20 19:53:01,655 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-11-20 19:53:01,655 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-11-20 19:53:01,655 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2022-11-20 19:53:01,655 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2022-11-20 19:53:01,656 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-20 19:53:01,656 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-20 19:53:01,656 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-20 19:53:01,656 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-20 19:53:01,658 WARN L209 CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-20 19:53:01,867 INFO L235 CfgBuilder]: Building ICFG [2022-11-20 19:53:01,869 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-20 19:53:02,509 INFO L276 CfgBuilder]: Performing block encoding [2022-11-20 19:53:03,084 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-20 19:53:03,084 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-20 19:53:03,087 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 07:53:03 BoogieIcfgContainer [2022-11-20 19:53:03,087 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-20 19:53:03,090 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-20 19:53:03,090 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-20 19:53:03,093 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-20 19:53:03,099 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 07:53:00" (1/3) ... [2022-11-20 19:53:03,102 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@224d08bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 07:53:03, skipping insertion in model container [2022-11-20 19:53:03,102 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:53:01" (2/3) ... [2022-11-20 19:53:03,104 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@224d08bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 07:53:03, skipping insertion in model container [2022-11-20 19:53:03,104 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 07:53:03" (3/3) ... [2022-11-20 19:53:03,106 INFO L112 eAbstractionObserver]: Analyzing ICFG safe019_power.oepc.i [2022-11-20 19:53:03,123 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-20 19:53:03,135 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-20 19:53:03,135 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-20 19:53:03,135 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-20 19:53:03,223 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-20 19:53:03,271 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-20 19:53:03,292 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 161 places, 150 transitions, 320 flow [2022-11-20 19:53:03,297 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 161 places, 150 transitions, 320 flow [2022-11-20 19:53:03,299 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 161 places, 150 transitions, 320 flow [2022-11-20 19:53:03,418 INFO L130 PetriNetUnfolder]: 2/146 cut-off events. [2022-11-20 19:53:03,418 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-20 19:53:03,424 INFO L83 FinitePrefix]: Finished finitePrefix Result has 159 conditions, 146 events. 2/146 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 57 event pairs, 0 based on Foata normal form. 0/143 useless extension candidates. Maximal degree in co-relation 86. Up to 2 conditions per place. [2022-11-20 19:53:03,426 INFO L119 LiptonReduction]: Number of co-enabled transitions 2600 [2022-11-20 19:53:15,279 INFO L134 LiptonReduction]: Checked pairs total: 6236 [2022-11-20 19:53:15,279 INFO L136 LiptonReduction]: Total number of compositions: 133 [2022-11-20 19:53:15,287 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 42 places, 30 transitions, 80 flow [2022-11-20 19:53:15,457 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 1354 states, 1353 states have (on average 3.858093126385809) internal successors, (5220), 1353 states have internal predecessors, (5220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 19:53:15,482 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-20 19:53:15,498 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;@2ac0f5ab, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-20 19:53:15,499 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2022-11-20 19:53:15,508 INFO L276 IsEmpty]: Start isEmpty. Operand has 1354 states, 1353 states have (on average 3.858093126385809) internal successors, (5220), 1353 states have internal predecessors, (5220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 19:53:15,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-20 19:53:15,528 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 19:53:15,528 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 19:53:15,529 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-20 19:53:15,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 19:53:15,534 INFO L85 PathProgramCache]: Analyzing trace with hash 443969393, now seen corresponding path program 1 times [2022-11-20 19:53:15,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 19:53:15,544 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1609686857] [2022-11-20 19:53:15,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 19:53:15,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 19:53:15,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 19:53:15,775 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 19:53:15,775 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 19:53:15,776 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1609686857] [2022-11-20 19:53:15,776 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1609686857] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 19:53:15,777 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 19:53:15,777 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 19:53:15,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1762067812] [2022-11-20 19:53:15,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 19:53:15,783 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-20 19:53:15,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 19:53:15,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-20 19:53:15,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-20 19:53:15,813 INFO L87 Difference]: Start difference. First operand has 1354 states, 1353 states have (on average 3.858093126385809) internal successors, (5220), 1353 states have internal predecessors, (5220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 5.0) 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-11-20 19:53:15,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 19:53:15,952 INFO L93 Difference]: Finished difference Result 1354 states and 4980 transitions. [2022-11-20 19:53:15,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-20 19:53:15,954 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.0) 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-11-20 19:53:15,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 19:53:15,992 INFO L225 Difference]: With dead ends: 1354 [2022-11-20 19:53:15,992 INFO L226 Difference]: Without dead ends: 1354 [2022-11-20 19:53:15,993 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-20 19:53:15,997 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 19:53:15,998 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 19:53:16,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1354 states. [2022-11-20 19:53:16,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1354 to 1354. [2022-11-20 19:53:16,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1354 states, 1353 states have (on average 3.680709534368071) internal successors, (4980), 1353 states have internal predecessors, (4980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 19:53:16,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1354 states to 1354 states and 4980 transitions. [2022-11-20 19:53:16,152 INFO L78 Accepts]: Start accepts. Automaton has 1354 states and 4980 transitions. Word has length 10 [2022-11-20 19:53:16,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 19:53:16,154 INFO L495 AbstractCegarLoop]: Abstraction has 1354 states and 4980 transitions. [2022-11-20 19:53:16,156 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.0) 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-11-20 19:53:16,157 INFO L276 IsEmpty]: Start isEmpty. Operand 1354 states and 4980 transitions. [2022-11-20 19:53:16,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-20 19:53:16,159 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 19:53:16,160 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 19:53:16,160 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-20 19:53:16,160 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-20 19:53:16,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 19:53:16,161 INFO L85 PathProgramCache]: Analyzing trace with hash 1452231001, now seen corresponding path program 1 times [2022-11-20 19:53:16,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 19:53:16,161 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1344849270] [2022-11-20 19:53:16,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 19:53:16,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 19:53:16,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 19:53:16,978 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 19:53:16,978 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 19:53:16,979 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1344849270] [2022-11-20 19:53:16,979 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1344849270] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 19:53:16,979 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 19:53:16,979 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 19:53:16,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1421971634] [2022-11-20 19:53:16,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 19:53:16,981 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 19:53:16,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 19:53:16,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 19:53:16,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-20 19:53:16,983 INFO L87 Difference]: Start difference. First operand 1354 states and 4980 transitions. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 19:53:17,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 19:53:17,179 INFO L93 Difference]: Finished difference Result 1474 states and 5246 transitions. [2022-11-20 19:53:17,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 19:53:17,180 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 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 12 [2022-11-20 19:53:17,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 19:53:17,189 INFO L225 Difference]: With dead ends: 1474 [2022-11-20 19:53:17,190 INFO L226 Difference]: Without dead ends: 1234 [2022-11-20 19:53:17,190 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 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-11-20 19:53:17,191 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 30 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 19:53:17,192 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 10 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-20 19:53:17,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1234 states. [2022-11-20 19:53:17,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1234 to 1234. [2022-11-20 19:53:17,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1234 states, 1233 states have (on average 3.6285482562854825) internal successors, (4474), 1233 states have internal predecessors, (4474), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 19:53:17,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1234 states to 1234 states and 4474 transitions. [2022-11-20 19:53:17,245 INFO L78 Accepts]: Start accepts. Automaton has 1234 states and 4474 transitions. Word has length 12 [2022-11-20 19:53:17,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 19:53:17,245 INFO L495 AbstractCegarLoop]: Abstraction has 1234 states and 4474 transitions. [2022-11-20 19:53:17,245 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 19:53:17,246 INFO L276 IsEmpty]: Start isEmpty. Operand 1234 states and 4474 transitions. [2022-11-20 19:53:17,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-20 19:53:17,248 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 19:53:17,248 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 19:53:17,248 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-20 19:53:17,249 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-20 19:53:17,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 19:53:17,249 INFO L85 PathProgramCache]: Analyzing trace with hash 115504780, now seen corresponding path program 1 times [2022-11-20 19:53:17,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 19:53:17,250 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [859248618] [2022-11-20 19:53:17,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 19:53:17,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 19:53:17,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 19:53:17,630 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 19:53:17,630 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 19:53:17,630 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [859248618] [2022-11-20 19:53:17,631 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [859248618] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 19:53:17,631 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 19:53:17,631 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 19:53:17,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2063362122] [2022-11-20 19:53:17,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 19:53:17,632 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 19:53:17,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 19:53:17,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 19:53:17,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-20 19:53:17,633 INFO L87 Difference]: Start difference. First operand 1234 states and 4474 transitions. Second operand has 4 states, 3 states have (on average 4.333333333333333) 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-11-20 19:53:17,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 19:53:17,790 INFO L93 Difference]: Finished difference Result 1342 states and 4735 transitions. [2022-11-20 19:53:17,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 19:53:17,791 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.333333333333333) 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-11-20 19:53:17,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 19:53:17,799 INFO L225 Difference]: With dead ends: 1342 [2022-11-20 19:53:17,800 INFO L226 Difference]: Without dead ends: 1162 [2022-11-20 19:53:17,800 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 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-11-20 19:53:17,801 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 26 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 19:53:17,802 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 10 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 19:53:17,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1162 states. [2022-11-20 19:53:17,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1162 to 1162. [2022-11-20 19:53:17,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1162 states, 1161 states have (on average 3.6003445305770887) internal successors, (4180), 1161 states have internal predecessors, (4180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 19:53:17,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1162 states to 1162 states and 4180 transitions. [2022-11-20 19:53:17,851 INFO L78 Accepts]: Start accepts. Automaton has 1162 states and 4180 transitions. Word has length 13 [2022-11-20 19:53:17,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 19:53:17,852 INFO L495 AbstractCegarLoop]: Abstraction has 1162 states and 4180 transitions. [2022-11-20 19:53:17,852 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) 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-11-20 19:53:17,852 INFO L276 IsEmpty]: Start isEmpty. Operand 1162 states and 4180 transitions. [2022-11-20 19:53:17,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-20 19:53:17,854 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 19:53:17,855 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 19:53:17,855 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-20 19:53:17,855 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-20 19:53:17,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 19:53:17,856 INFO L85 PathProgramCache]: Analyzing trace with hash 143127706, now seen corresponding path program 1 times [2022-11-20 19:53:17,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 19:53:17,856 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [704138922] [2022-11-20 19:53:17,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 19:53:17,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 19:53:17,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 19:53:18,169 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 19:53:18,169 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 19:53:18,169 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [704138922] [2022-11-20 19:53:18,173 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [704138922] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 19:53:18,174 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 19:53:18,174 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 19:53:18,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [774291759] [2022-11-20 19:53:18,178 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 19:53:18,178 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 19:53:18,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 19:53:18,180 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 19:53:18,180 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-20 19:53:18,180 INFO L87 Difference]: Start difference. First operand 1162 states and 4180 transitions. Second operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 19:53:18,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 19:53:18,457 INFO L93 Difference]: Finished difference Result 1658 states and 5836 transitions. [2022-11-20 19:53:18,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-20 19:53:18,458 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 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 14 [2022-11-20 19:53:18,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 19:53:18,465 INFO L225 Difference]: With dead ends: 1658 [2022-11-20 19:53:18,466 INFO L226 Difference]: Without dead ends: 842 [2022-11-20 19:53:18,466 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-11-20 19:53:18,469 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 61 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 19:53:18,470 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 7 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-20 19:53:18,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 842 states. [2022-11-20 19:53:18,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 842 to 842. [2022-11-20 19:53:18,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 842 states, 841 states have (on average 3.4007134363852556) internal successors, (2860), 841 states have internal predecessors, (2860), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 19:53:18,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 842 states to 842 states and 2860 transitions. [2022-11-20 19:53:18,515 INFO L78 Accepts]: Start accepts. Automaton has 842 states and 2860 transitions. Word has length 14 [2022-11-20 19:53:18,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 19:53:18,515 INFO L495 AbstractCegarLoop]: Abstraction has 842 states and 2860 transitions. [2022-11-20 19:53:18,515 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 19:53:18,516 INFO L276 IsEmpty]: Start isEmpty. Operand 842 states and 2860 transitions. [2022-11-20 19:53:18,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-20 19:53:18,518 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 19:53:18,518 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 19:53:18,519 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-20 19:53:18,519 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-20 19:53:18,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 19:53:18,523 INFO L85 PathProgramCache]: Analyzing trace with hash -2124463178, now seen corresponding path program 1 times [2022-11-20 19:53:18,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 19:53:18,524 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [721462801] [2022-11-20 19:53:18,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 19:53:18,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 19:53:18,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 19:53:20,548 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 19:53:20,549 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 19:53:20,554 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [721462801] [2022-11-20 19:53:20,554 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [721462801] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 19:53:20,555 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 19:53:20,555 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-20 19:53:20,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [99822218] [2022-11-20 19:53:20,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 19:53:20,556 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-20 19:53:20,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 19:53:20,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-20 19:53:20,556 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2022-11-20 19:53:20,557 INFO L87 Difference]: Start difference. First operand 842 states and 2860 transitions. Second operand has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 19:53:20,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 19:53:20,799 INFO L93 Difference]: Finished difference Result 926 states and 3072 transitions. [2022-11-20 19:53:20,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 19:53:20,800 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 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 15 [2022-11-20 19:53:20,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 19:53:20,806 INFO L225 Difference]: With dead ends: 926 [2022-11-20 19:53:20,806 INFO L226 Difference]: Without dead ends: 830 [2022-11-20 19:53:20,807 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2022-11-20 19:53:20,808 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 42 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 19:53:20,808 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 7 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-20 19:53:20,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 830 states. [2022-11-20 19:53:20,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 830 to 830. [2022-11-20 19:53:20,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 830 states, 829 states have (on average 3.3896260554885402) internal successors, (2810), 829 states have internal predecessors, (2810), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 19:53:20,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 830 states to 830 states and 2810 transitions. [2022-11-20 19:53:20,842 INFO L78 Accepts]: Start accepts. Automaton has 830 states and 2810 transitions. Word has length 15 [2022-11-20 19:53:20,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 19:53:20,842 INFO L495 AbstractCegarLoop]: Abstraction has 830 states and 2810 transitions. [2022-11-20 19:53:20,843 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 19:53:20,843 INFO L276 IsEmpty]: Start isEmpty. Operand 830 states and 2810 transitions. [2022-11-20 19:53:20,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-20 19:53:20,845 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 19:53:20,845 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 19:53:20,845 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-20 19:53:20,846 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-20 19:53:20,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 19:53:20,846 INFO L85 PathProgramCache]: Analyzing trace with hash -1756675449, now seen corresponding path program 1 times [2022-11-20 19:53:20,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 19:53:20,847 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1298536699] [2022-11-20 19:53:20,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 19:53:20,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 19:53:20,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 19:53:21,464 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 19:53:21,464 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 19:53:21,465 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1298536699] [2022-11-20 19:53:21,465 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1298536699] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 19:53:21,465 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 19:53:21,465 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 19:53:21,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [159807147] [2022-11-20 19:53:21,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 19:53:21,466 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 19:53:21,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 19:53:21,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 19:53:21,467 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 19:53:21,467 INFO L87 Difference]: Start difference. First operand 830 states and 2810 transitions. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 2 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 19:53:21,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 19:53:21,564 INFO L93 Difference]: Finished difference Result 708 states and 2218 transitions. [2022-11-20 19:53:21,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 19:53:21,564 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 2 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-11-20 19:53:21,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 19:53:21,570 INFO L225 Difference]: With dead ends: 708 [2022-11-20 19:53:21,570 INFO L226 Difference]: Without dead ends: 708 [2022-11-20 19:53:21,570 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-11-20 19:53:21,572 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 4 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 19:53:21,572 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 4 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 19:53:21,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 708 states. [2022-11-20 19:53:21,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 708 to 708. [2022-11-20 19:53:21,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 708 states, 707 states have (on average 3.1371994342291374) internal successors, (2218), 707 states have internal predecessors, (2218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 19:53:21,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 708 states to 708 states and 2218 transitions. [2022-11-20 19:53:21,600 INFO L78 Accepts]: Start accepts. Automaton has 708 states and 2218 transitions. Word has length 16 [2022-11-20 19:53:21,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 19:53:21,601 INFO L495 AbstractCegarLoop]: Abstraction has 708 states and 2218 transitions. [2022-11-20 19:53:21,601 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 2 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 19:53:21,601 INFO L276 IsEmpty]: Start isEmpty. Operand 708 states and 2218 transitions. [2022-11-20 19:53:21,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-20 19:53:21,603 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 19:53:21,604 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 19:53:21,604 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-20 19:53:21,604 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-20 19:53:21,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 19:53:21,605 INFO L85 PathProgramCache]: Analyzing trace with hash 1372500782, now seen corresponding path program 1 times [2022-11-20 19:53:21,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 19:53:21,605 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1582343662] [2022-11-20 19:53:21,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 19:53:21,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 19:53:21,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 19:53:21,940 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 19:53:21,940 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 19:53:21,941 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1582343662] [2022-11-20 19:53:21,941 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1582343662] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 19:53:21,941 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 19:53:21,941 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 19:53:21,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1547188001] [2022-11-20 19:53:21,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 19:53:21,942 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 19:53:21,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 19:53:21,943 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 19:53:21,943 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-20 19:53:21,944 INFO L87 Difference]: Start difference. First operand 708 states and 2218 transitions. Second operand has 4 states, 4 states have (on average 4.25) 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-11-20 19:53:22,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 19:53:22,072 INFO L93 Difference]: Finished difference Result 486 states and 1342 transitions. [2022-11-20 19:53:22,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-20 19:53:22,073 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) 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-11-20 19:53:22,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 19:53:22,076 INFO L225 Difference]: With dead ends: 486 [2022-11-20 19:53:22,076 INFO L226 Difference]: Without dead ends: 486 [2022-11-20 19:53:22,076 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-11-20 19:53:22,077 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 33 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 19:53:22,077 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 6 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 19:53:22,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 486 states. [2022-11-20 19:53:22,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 486 to 486. [2022-11-20 19:53:22,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 486 states, 485 states have (on average 2.7670103092783505) internal successors, (1342), 485 states have internal predecessors, (1342), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 19:53:22,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 486 states to 486 states and 1342 transitions. [2022-11-20 19:53:22,095 INFO L78 Accepts]: Start accepts. Automaton has 486 states and 1342 transitions. Word has length 17 [2022-11-20 19:53:22,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 19:53:22,095 INFO L495 AbstractCegarLoop]: Abstraction has 486 states and 1342 transitions. [2022-11-20 19:53:22,096 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) 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-11-20 19:53:22,096 INFO L276 IsEmpty]: Start isEmpty. Operand 486 states and 1342 transitions. [2022-11-20 19:53:22,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-20 19:53:22,101 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 19:53:22,101 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 19:53:22,101 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-20 19:53:22,101 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-20 19:53:22,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 19:53:22,102 INFO L85 PathProgramCache]: Analyzing trace with hash 336121888, now seen corresponding path program 1 times [2022-11-20 19:53:22,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 19:53:22,102 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [862231587] [2022-11-20 19:53:22,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 19:53:22,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 19:53:22,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 19:53:22,420 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 19:53:22,420 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 19:53:22,420 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [862231587] [2022-11-20 19:53:22,420 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [862231587] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 19:53:22,421 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 19:53:22,421 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-20 19:53:22,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1799425128] [2022-11-20 19:53:22,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 19:53:22,422 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 19:53:22,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 19:53:22,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 19:53:22,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-11-20 19:53:22,423 INFO L87 Difference]: Start difference. First operand 486 states and 1342 transitions. Second operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 19:53:22,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 19:53:22,583 INFO L93 Difference]: Finished difference Result 342 states and 912 transitions. [2022-11-20 19:53:22,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 19:53:22,583 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 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 19 [2022-11-20 19:53:22,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 19:53:22,586 INFO L225 Difference]: With dead ends: 342 [2022-11-20 19:53:22,586 INFO L226 Difference]: Without dead ends: 342 [2022-11-20 19:53:22,586 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-11-20 19:53:22,587 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 70 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 19:53:22,587 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 8 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 19:53:22,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2022-11-20 19:53:22,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 342. [2022-11-20 19:53:22,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 342 states, 341 states have (on average 2.6744868035190614) internal successors, (912), 341 states have internal predecessors, (912), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 19:53:22,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 342 states to 342 states and 912 transitions. [2022-11-20 19:53:22,599 INFO L78 Accepts]: Start accepts. Automaton has 342 states and 912 transitions. Word has length 19 [2022-11-20 19:53:22,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 19:53:22,599 INFO L495 AbstractCegarLoop]: Abstraction has 342 states and 912 transitions. [2022-11-20 19:53:22,599 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 19:53:22,600 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 912 transitions. [2022-11-20 19:53:22,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-20 19:53:22,601 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 19:53:22,601 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 19:53:22,601 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-20 19:53:22,601 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-20 19:53:22,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 19:53:22,603 INFO L85 PathProgramCache]: Analyzing trace with hash 144504316, now seen corresponding path program 1 times [2022-11-20 19:53:22,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 19:53:22,603 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [876467327] [2022-11-20 19:53:22,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 19:53:22,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 19:53:22,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 19:53:22,982 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 19:53:22,982 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 19:53:22,982 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [876467327] [2022-11-20 19:53:22,983 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [876467327] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 19:53:22,983 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 19:53:22,983 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-20 19:53:22,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [273557358] [2022-11-20 19:53:22,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 19:53:22,984 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-20 19:53:22,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 19:53:22,984 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-20 19:53:22,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-20 19:53:22,985 INFO L87 Difference]: Start difference. First operand 342 states and 912 transitions. Second operand has 6 states, 6 states have (on average 3.5) internal successors, (21), 5 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-11-20 19:53:23,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 19:53:23,138 INFO L93 Difference]: Finished difference Result 302 states and 832 transitions. [2022-11-20 19:53:23,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-20 19:53:23,139 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 5 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-11-20 19:53:23,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 19:53:23,141 INFO L225 Difference]: With dead ends: 302 [2022-11-20 19:53:23,141 INFO L226 Difference]: Without dead ends: 302 [2022-11-20 19:53:23,141 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-20 19:53:23,142 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 87 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 19:53:23,142 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 8 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 19:53:23,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2022-11-20 19:53:23,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 302. [2022-11-20 19:53:23,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 302 states, 301 states have (on average 2.7641196013289036) internal successors, (832), 301 states have internal predecessors, (832), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 19:53:23,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 832 transitions. [2022-11-20 19:53:23,153 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 832 transitions. Word has length 21 [2022-11-20 19:53:23,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 19:53:23,153 INFO L495 AbstractCegarLoop]: Abstraction has 302 states and 832 transitions. [2022-11-20 19:53:23,153 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 5 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-11-20 19:53:23,154 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 832 transitions. [2022-11-20 19:53:23,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-20 19:53:23,155 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 19:53:23,155 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 19:53:23,155 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-20 19:53:23,155 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-20 19:53:23,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 19:53:23,156 INFO L85 PathProgramCache]: Analyzing trace with hash -1244213213, now seen corresponding path program 1 times [2022-11-20 19:53:23,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 19:53:23,156 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [301552394] [2022-11-20 19:53:23,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 19:53:23,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 19:53:23,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 19:53:24,806 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 19:53:24,807 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 19:53:24,807 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [301552394] [2022-11-20 19:53:24,807 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [301552394] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 19:53:24,807 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 19:53:24,808 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-20 19:53:24,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [465036199] [2022-11-20 19:53:24,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 19:53:24,808 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-20 19:53:24,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 19:53:24,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-20 19:53:24,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-11-20 19:53:24,809 INFO L87 Difference]: Start difference. First operand 302 states and 832 transitions. Second operand has 7 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 19:53:25,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 19:53:25,009 INFO L93 Difference]: Finished difference Result 443 states and 1212 transitions. [2022-11-20 19:53:25,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 19:53:25,010 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 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 24 [2022-11-20 19:53:25,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 19:53:25,012 INFO L225 Difference]: With dead ends: 443 [2022-11-20 19:53:25,012 INFO L226 Difference]: Without dead ends: 374 [2022-11-20 19:53:25,012 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-11-20 19:53:25,013 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 22 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 19:53:25,013 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 8 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-20 19:53:25,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374 states. [2022-11-20 19:53:25,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374 to 272. [2022-11-20 19:53:25,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 272 states, 271 states have (on average 2.6937269372693726) internal successors, (730), 271 states have internal predecessors, (730), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 19:53:25,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 730 transitions. [2022-11-20 19:53:25,026 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 730 transitions. Word has length 24 [2022-11-20 19:53:25,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 19:53:25,026 INFO L495 AbstractCegarLoop]: Abstraction has 272 states and 730 transitions. [2022-11-20 19:53:25,026 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 19:53:25,027 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 730 transitions. [2022-11-20 19:53:25,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-20 19:53:25,028 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 19:53:25,028 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 19:53:25,028 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-20 19:53:25,028 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-20 19:53:25,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 19:53:25,029 INFO L85 PathProgramCache]: Analyzing trace with hash -726100317, now seen corresponding path program 2 times [2022-11-20 19:53:25,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 19:53:25,029 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1264267925] [2022-11-20 19:53:25,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 19:53:25,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 19:53:25,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 19:53:26,643 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 19:53:26,643 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 19:53:26,643 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1264267925] [2022-11-20 19:53:26,643 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1264267925] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 19:53:26,644 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 19:53:26,644 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-20 19:53:26,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2109523338] [2022-11-20 19:53:26,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 19:53:26,644 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-20 19:53:26,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 19:53:26,645 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-20 19:53:26,645 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2022-11-20 19:53:26,645 INFO L87 Difference]: Start difference. First operand 272 states and 730 transitions. Second operand has 8 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 19:53:26,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 19:53:26,847 INFO L93 Difference]: Finished difference Result 423 states and 1147 transitions. [2022-11-20 19:53:26,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-20 19:53:26,847 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 0 states have call successors, (0), 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 24 [2022-11-20 19:53:26,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 19:53:26,849 INFO L225 Difference]: With dead ends: 423 [2022-11-20 19:53:26,849 INFO L226 Difference]: Without dead ends: 308 [2022-11-20 19:53:26,850 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2022-11-20 19:53:26,850 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 45 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 19:53:26,851 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 8 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-20 19:53:26,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2022-11-20 19:53:26,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 242. [2022-11-20 19:53:26,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 242 states, 241 states have (on average 2.66804979253112) internal successors, (643), 241 states have internal predecessors, (643), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 19:53:26,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 643 transitions. [2022-11-20 19:53:26,859 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 643 transitions. Word has length 24 [2022-11-20 19:53:26,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 19:53:26,860 INFO L495 AbstractCegarLoop]: Abstraction has 242 states and 643 transitions. [2022-11-20 19:53:26,860 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 19:53:26,860 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 643 transitions. [2022-11-20 19:53:26,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-20 19:53:26,861 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 19:53:26,861 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 19:53:26,862 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-20 19:53:26,862 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-20 19:53:26,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 19:53:26,862 INFO L85 PathProgramCache]: Analyzing trace with hash 1169200959, now seen corresponding path program 3 times [2022-11-20 19:53:26,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 19:53:26,863 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1516240670] [2022-11-20 19:53:26,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 19:53:26,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 19:53:26,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 19:53:26,952 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-20 19:53:27,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 19:53:27,064 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2022-11-20 19:53:27,064 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-20 19:53:27,065 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2022-11-20 19:53:27,070 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 5 remaining) [2022-11-20 19:53:27,071 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2022-11-20 19:53:27,071 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2022-11-20 19:53:27,071 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 5 remaining) [2022-11-20 19:53:27,072 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-20 19:53:27,074 INFO L444 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 19:53:27,080 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-20 19:53:27,080 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-20 19:53:27,203 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 07:53:27 BasicIcfg [2022-11-20 19:53:27,204 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-20 19:53:27,204 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-20 19:53:27,204 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-20 19:53:27,204 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-20 19:53:27,205 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 07:53:03" (3/4) ... [2022-11-20 19:53:27,207 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-11-20 19:53:27,348 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_417cc7ff-4de4-4099-9cc1-4c85084e6151/bin/utaipan-6cKwYrpEi9/witness.graphml [2022-11-20 19:53:27,348 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-20 19:53:27,349 INFO L158 Benchmark]: Toolchain (without parser) took 26785.05ms. Allocated memory was 121.6MB in the beginning and 383.8MB in the end (delta: 262.1MB). Free memory was 91.3MB in the beginning and 208.3MB in the end (delta: -117.0MB). Peak memory consumption was 146.8MB. Max. memory is 16.1GB. [2022-11-20 19:53:27,349 INFO L158 Benchmark]: CDTParser took 0.24ms. Allocated memory is still 92.3MB. Free memory is still 41.9MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-20 19:53:27,349 INFO L158 Benchmark]: CACSL2BoogieTranslator took 796.29ms. Allocated memory is still 121.6MB. Free memory was 91.3MB in the beginning and 65.8MB in the end (delta: 25.5MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2022-11-20 19:53:27,350 INFO L158 Benchmark]: Boogie Procedure Inliner took 105.10ms. Allocated memory is still 121.6MB. Free memory was 65.8MB in the beginning and 63.1MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-20 19:53:27,350 INFO L158 Benchmark]: Boogie Preprocessor took 83.10ms. Allocated memory is still 121.6MB. Free memory was 63.1MB in the beginning and 60.5MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-20 19:53:27,350 INFO L158 Benchmark]: RCFGBuilder took 1533.23ms. Allocated memory was 121.6MB in the beginning and 151.0MB in the end (delta: 29.4MB). Free memory was 60.5MB in the beginning and 109.3MB in the end (delta: -48.8MB). Peak memory consumption was 28.8MB. Max. memory is 16.1GB. [2022-11-20 19:53:27,351 INFO L158 Benchmark]: TraceAbstraction took 24113.80ms. Allocated memory was 151.0MB in the beginning and 383.8MB in the end (delta: 232.8MB). Free memory was 108.2MB in the beginning and 230.3MB in the end (delta: -122.1MB). Peak memory consumption was 113.8MB. Max. memory is 16.1GB. [2022-11-20 19:53:27,351 INFO L158 Benchmark]: Witness Printer took 144.12ms. Allocated memory is still 383.8MB. Free memory was 230.3MB in the beginning and 208.3MB in the end (delta: 22.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2022-11-20 19:53:27,353 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.24ms. Allocated memory is still 92.3MB. Free memory is still 41.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 796.29ms. Allocated memory is still 121.6MB. Free memory was 91.3MB in the beginning and 65.8MB in the end (delta: 25.5MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 105.10ms. Allocated memory is still 121.6MB. Free memory was 65.8MB in the beginning and 63.1MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 83.10ms. Allocated memory is still 121.6MB. Free memory was 63.1MB in the beginning and 60.5MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1533.23ms. Allocated memory was 121.6MB in the beginning and 151.0MB in the end (delta: 29.4MB). Free memory was 60.5MB in the beginning and 109.3MB in the end (delta: -48.8MB). Peak memory consumption was 28.8MB. Max. memory is 16.1GB. * TraceAbstraction took 24113.80ms. Allocated memory was 151.0MB in the beginning and 383.8MB in the end (delta: 232.8MB). Free memory was 108.2MB in the beginning and 230.3MB in the end (delta: -122.1MB). Peak memory consumption was 113.8MB. Max. memory is 16.1GB. * Witness Printer took 144.12ms. Allocated memory is still 383.8MB. Free memory was 230.3MB in the beginning and 208.3MB in the end (delta: 22.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 12.0s, 161 PlacesBefore, 42 PlacesAfterwards, 150 TransitionsBefore, 30 TransitionsAfterwards, 2600 CoEnabledTransitionPairs, 8 FixpointIterations, 64 TrivialSequentialCompositions, 59 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 9 ConcurrentYvCompositions, 1 ChoiceCompositions, 133 TotalNumberOfCompositions, 6236 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2861, independent: 2640, independent conditional: 0, independent unconditional: 2640, dependent: 221, dependent conditional: 0, dependent unconditional: 221, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1766, independent: 1710, independent conditional: 0, independent unconditional: 1710, dependent: 56, dependent conditional: 0, dependent unconditional: 56, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1766, independent: 1687, independent conditional: 0, independent unconditional: 1687, dependent: 79, dependent conditional: 0, dependent unconditional: 79, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 79, independent: 23, independent conditional: 0, independent unconditional: 23, dependent: 56, dependent conditional: 0, dependent unconditional: 56, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 685, independent: 32, independent conditional: 0, independent unconditional: 32, dependent: 652, dependent conditional: 0, dependent unconditional: 652, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2861, independent: 930, independent conditional: 0, independent unconditional: 930, dependent: 165, dependent conditional: 0, dependent unconditional: 165, unknown: 1766, unknown conditional: 0, unknown unconditional: 1766] , Statistics on independence cache: Total cache size (in pairs): 116, Positive cache size: 95, Positive conditional cache size: 0, Positive unconditional cache size: 95, Negative cache size: 21, Negative conditional cache size: 0, Negative unconditional cache size: 21, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - 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: 19]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L711] 0 int __unbuffered_cnt = 0; [L713] 0 int __unbuffered_p0_EAX = 0; [L714] 0 _Bool __unbuffered_p0_EAX$flush_delayed; [L715] 0 int __unbuffered_p0_EAX$mem_tmp; [L716] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd0; [L717] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd1; [L718] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd2; [L719] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd3; [L720] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd4; [L721] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd0; [L722] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd1; [L723] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd2; [L724] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd3; [L725] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd4; [L726] 0 _Bool __unbuffered_p0_EAX$read_delayed; [L727] 0 int *__unbuffered_p0_EAX$read_delayed_var; [L728] 0 int __unbuffered_p0_EAX$w_buff0; [L729] 0 _Bool __unbuffered_p0_EAX$w_buff0_used; [L730] 0 int __unbuffered_p0_EAX$w_buff1; [L731] 0 _Bool __unbuffered_p0_EAX$w_buff1_used; [L733] 0 int __unbuffered_p0_EBX = 0; [L735] 0 int __unbuffered_p2_EAX = 0; [L736] 0 _Bool main$tmp_guard0; [L737] 0 _Bool main$tmp_guard1; [L739] 0 int x = 0; [L741] 0 int y = 0; [L742] 0 _Bool y$flush_delayed; [L743] 0 int y$mem_tmp; [L744] 0 _Bool y$r_buff0_thd0; [L745] 0 _Bool y$r_buff0_thd1; [L746] 0 _Bool y$r_buff0_thd2; [L747] 0 _Bool y$r_buff0_thd3; [L748] 0 _Bool y$r_buff0_thd4; [L749] 0 _Bool y$r_buff1_thd0; [L750] 0 _Bool y$r_buff1_thd1; [L751] 0 _Bool y$r_buff1_thd2; [L752] 0 _Bool y$r_buff1_thd3; [L753] 0 _Bool y$r_buff1_thd4; [L754] 0 _Bool y$read_delayed; [L755] 0 int *y$read_delayed_var; [L756] 0 int y$w_buff0; [L757] 0 _Bool y$w_buff0_used; [L758] 0 int y$w_buff1; [L759] 0 _Bool y$w_buff1_used; [L760] 0 _Bool weak$$choice0; [L761] 0 _Bool weak$$choice1; [L762] 0 _Bool weak$$choice2; [L854] 0 pthread_t t2225; [L855] FCALL, FORK 0 pthread_create(&t2225, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2225, ((void *)0), P0, ((void *)0))=-3, t2225={7:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L856] 0 pthread_t t2226; [L766] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L767] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L768] 1 y$flush_delayed = weak$$choice2 [L769] EXPR 1 \read(y) [L769] 1 y$mem_tmp = y [L770] 1 weak$$choice1 = __VERIFIER_nondet_bool() [L771] EXPR 1 !y$w_buff0_used ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y : (weak$$choice1 ? y$w_buff0 : y$w_buff1)) : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y$w_buff1 : y$w_buff0) : (weak$$choice0 ? y$w_buff0 : y)))) [L771] EXPR 1 \read(y) [L771] EXPR 1 !y$w_buff0_used ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y : (weak$$choice1 ? y$w_buff0 : y$w_buff1)) : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y$w_buff1 : y$w_buff0) : (weak$$choice0 ? y$w_buff0 : y)))) [L771] 1 y = !y$w_buff0_used ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y : (weak$$choice1 ? y$w_buff0 : y$w_buff1)) : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y$w_buff1 : y$w_buff0) : (weak$$choice0 ? y$w_buff0 : y)))) [L772] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)))) [L773] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)))) [L774] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? weak$$choice0 || !weak$$choice1 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? weak$$choice0 : weak$$choice0)))) [L775] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? weak$$choice0 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L776] 1 y$r_buff0_thd1 = weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L777] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y$r_buff1_thd1 : (_Bool)0) : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L778] 1 __unbuffered_p0_EAX$read_delayed = (_Bool)1 [L779] 1 __unbuffered_p0_EAX$read_delayed_var = &y [L780] EXPR 1 \read(y) [L780] 1 __unbuffered_p0_EAX = y [L781] EXPR 1 y$flush_delayed ? y$mem_tmp : y [L781] 1 y = y$flush_delayed ? y$mem_tmp : y [L782] 1 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=255, weak$$choice2=1, x=0, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L857] FCALL, FORK 0 pthread_create(&t2226, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2226, ((void *)0), P1, ((void *)0))=-2, t2225={7:0}, t2226={5:0}, weak$$choice0=0, weak$$choice1=255, weak$$choice2=1, x=0, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L785] 1 __unbuffered_p0_EBX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=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$$choice1=255, weak$$choice2=1, x=0, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L858] 0 pthread_t t2227; [L859] FCALL, FORK 0 pthread_create(&t2227, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=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, pthread_create(&t2227, ((void *)0), P2, ((void *)0))=-1, t2225={7:0}, t2226={5:0}, t2227={6:0}, weak$$choice0=0, weak$$choice1=255, weak$$choice2=1, x=0, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L860] 0 pthread_t t2228; [L861] FCALL, FORK 0 pthread_create(&t2228, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2228, ((void *)0), P3, ((void *)0))=0, t2225={7:0}, t2226={5:0}, t2227={6:0}, t2228={8:0}, weak$$choice0=0, weak$$choice1=255, weak$$choice2=1, x=0, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L797] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0: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$$choice1=255, weak$$choice2=1, x=1, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L809] 3 __unbuffered_p2_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0: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$$choice1=255, weak$$choice2=1, x=1, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L812] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0: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$$choice1=255, weak$$choice2=1, x=1, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L815] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L815] EXPR 3 y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y [L815] EXPR 3 \read(y) [L815] EXPR 3 y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y [L815] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L815] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L816] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L817] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L818] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L819] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0: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$$choice1=255, weak$$choice2=1, x=1, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L802] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L804] 2 return 0; [L822] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L824] 3 return 0; [L829] 4 y = 2 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0: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$$choice1=255, weak$$choice2=1, x=1, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L832] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L832] EXPR 4 y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y [L832] EXPR 4 \read(y) [L832] EXPR 4 y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y [L832] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L832] 4 y = y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L833] 4 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$w_buff0_used [L834] 4 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$w_buff1_used [L835] 4 y$r_buff0_thd4 = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$r_buff0_thd4 [L836] 4 y$r_buff1_thd4 = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$r_buff1_thd4 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0: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$$choice1=255, weak$$choice2=1, x=1, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L839] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L841] 4 return 0; [L790] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L792] 1 return 0; [L863] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L865] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) VAL [\old(cond)=1, \result={0:0}, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cond=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=255, weak$$choice2=1, x=1, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L865] RET 0 assume_abort_if_not(main$tmp_guard0) [L867] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L867] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L867] EXPR 0 \read(y) [L867] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L867] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L867] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L868] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L869] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L870] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L871] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2225={7:0}, t2226={5:0}, t2227={6:0}, t2228={8:0}, weak$$choice0=0, weak$$choice1=255, weak$$choice2=1, x=1, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L874] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L875] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L876] 0 y$flush_delayed = weak$$choice2 [L877] EXPR 0 \read(y) [L877] 0 y$mem_tmp = y [L878] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L878] EXPR 0 \read(y) [L878] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L878] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L879] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L880] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L881] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L882] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L883] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L884] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L885] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L886] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L886] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L886] EXPR 0 \read(*__unbuffered_p0_EAX$read_delayed_var) [L886] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L886] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L886] 0 __unbuffered_p0_EAX = __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L887] EXPR 0 \read(y) [L887] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 2 && __unbuffered_p0_EBX == 0 && __unbuffered_p2_EAX == 1) [L888] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L888] 0 y = y$flush_delayed ? y$mem_tmp : y [L889] 0 y$flush_delayed = (_Bool)0 [L891] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] 0 reach_error() VAL [\old(expression)=0, \result={0:0}, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=2, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=3, weak$$choice1=1, weak$$choice2=255, x=1, y={3:0}, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - UnprovableResult [Line: 855]: 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: 859]: 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: 861]: 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: 857]: 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 9 procedures, 181 locations, 5 error locations. Started 1 CEGAR loops. OverallTime: 23.8s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.1s, AutomataDifference: 2.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 12.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 420 SdHoareTripleChecker+Valid, 1.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 420 mSDsluCounter, 78 SdHoareTripleChecker+Invalid, 1.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 50 mSDsCounter, 93 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 834 IncrementalHoareTripleChecker+Invalid, 927 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 93 mSolverCounterUnsat, 28 mSDtfsCounter, 834 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 50 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1354occurred in iteration=0, InterpolantAutomatonStates: 52, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 11 MinimizatonAttempts, 168 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 7.5s InterpolantComputationTime, 209 NumberOfCodeBlocks, 209 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 174 ConstructedInterpolants, 0 QuantifiedInterpolants, 1686 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 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-11-20 19:53:27,383 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_417cc7ff-4de4-4099-9cc1-4c85084e6151/bin/utaipan-6cKwYrpEi9/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