./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/rfi001_power.oepc_pso.oepc_rmo.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version dbf71c69 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10cac13a-4079-457b-ba7c-7c59c6cca3a4/bin/uautomizer-J5u9QxTXDZ/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10cac13a-4079-457b-ba7c-7c59c6cca3a4/bin/uautomizer-J5u9QxTXDZ/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10cac13a-4079-457b-ba7c-7c59c6cca3a4/bin/uautomizer-J5u9QxTXDZ/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10cac13a-4079-457b-ba7c-7c59c6cca3a4/bin/uautomizer-J5u9QxTXDZ/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/rfi001_power.oepc_pso.oepc_rmo.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10cac13a-4079-457b-ba7c-7c59c6cca3a4/bin/uautomizer-J5u9QxTXDZ/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10cac13a-4079-457b-ba7c-7c59c6cca3a4/bin/uautomizer-J5u9QxTXDZ --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 67d0d28278c33bd8f728db1165a077a9d9ba1963e0d97b66e361587c8715de93 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-dbf71c6-m [2022-10-17 11:05:44,536 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-10-17 11:05:44,539 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-10-17 11:05:44,579 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-10-17 11:05:44,580 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-10-17 11:05:44,582 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-10-17 11:05:44,584 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-10-17 11:05:44,587 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-10-17 11:05:44,589 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-10-17 11:05:44,591 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-10-17 11:05:44,592 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-10-17 11:05:44,594 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-10-17 11:05:44,595 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-10-17 11:05:44,597 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-10-17 11:05:44,598 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-10-17 11:05:44,600 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-10-17 11:05:44,602 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-10-17 11:05:44,603 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-10-17 11:05:44,607 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-10-17 11:05:44,610 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-10-17 11:05:44,612 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-10-17 11:05:44,614 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-10-17 11:05:44,616 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-10-17 11:05:44,618 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-10-17 11:05:44,624 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-10-17 11:05:44,625 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-10-17 11:05:44,625 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-10-17 11:05:44,627 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-10-17 11:05:44,628 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-10-17 11:05:44,629 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-10-17 11:05:44,630 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-10-17 11:05:44,631 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-10-17 11:05:44,633 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-10-17 11:05:44,634 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-10-17 11:05:44,636 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-10-17 11:05:44,636 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-10-17 11:05:44,638 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-10-17 11:05:44,638 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-10-17 11:05:44,639 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-10-17 11:05:44,640 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-10-17 11:05:44,641 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-10-17 11:05:44,642 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10cac13a-4079-457b-ba7c-7c59c6cca3a4/bin/uautomizer-J5u9QxTXDZ/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-10-17 11:05:44,675 INFO L113 SettingsManager]: Loading preferences was successful [2022-10-17 11:05:44,675 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-10-17 11:05:44,675 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-10-17 11:05:44,676 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-10-17 11:05:44,676 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-10-17 11:05:44,677 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-10-17 11:05:44,678 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-10-17 11:05:44,678 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-10-17 11:05:44,678 INFO L138 SettingsManager]: * Use SBE=true [2022-10-17 11:05:44,678 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-10-17 11:05:44,679 INFO L138 SettingsManager]: * sizeof long=4 [2022-10-17 11:05:44,679 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-10-17 11:05:44,679 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-10-17 11:05:44,679 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-10-17 11:05:44,680 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-10-17 11:05:44,680 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-10-17 11:05:44,680 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-10-17 11:05:44,680 INFO L138 SettingsManager]: * sizeof long double=12 [2022-10-17 11:05:44,681 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-10-17 11:05:44,681 INFO L138 SettingsManager]: * Use constant arrays=true [2022-10-17 11:05:44,681 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-10-17 11:05:44,682 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-10-17 11:05:44,682 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-10-17 11:05:44,682 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-10-17 11:05:44,682 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-17 11:05:44,683 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-10-17 11:05:44,683 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-10-17 11:05:44,683 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-10-17 11:05:44,683 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-10-17 11:05:44,684 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-10-17 11:05:44,684 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-10-17 11:05:44,684 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-10-17 11:05:44,684 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-10-17 11:05:44,685 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_10cac13a-4079-457b-ba7c-7c59c6cca3a4/bin/uautomizer-J5u9QxTXDZ/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_10cac13a-4079-457b-ba7c-7c59c6cca3a4/bin/uautomizer-J5u9QxTXDZ Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 67d0d28278c33bd8f728db1165a077a9d9ba1963e0d97b66e361587c8715de93 [2022-10-17 11:05:45,022 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-10-17 11:05:45,049 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-10-17 11:05:45,051 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-10-17 11:05:45,053 INFO L271 PluginConnector]: Initializing CDTParser... [2022-10-17 11:05:45,054 INFO L275 PluginConnector]: CDTParser initialized [2022-10-17 11:05:45,055 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10cac13a-4079-457b-ba7c-7c59c6cca3a4/bin/uautomizer-J5u9QxTXDZ/../../sv-benchmarks/c/pthread-wmm/rfi001_power.oepc_pso.oepc_rmo.oepc.i [2022-10-17 11:05:45,140 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10cac13a-4079-457b-ba7c-7c59c6cca3a4/bin/uautomizer-J5u9QxTXDZ/data/8606aa02e/12de2d8d4ab74312b5103d023460489c/FLAG85429dc15 [2022-10-17 11:05:45,744 INFO L306 CDTParser]: Found 1 translation units. [2022-10-17 11:05:45,748 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10cac13a-4079-457b-ba7c-7c59c6cca3a4/sv-benchmarks/c/pthread-wmm/rfi001_power.oepc_pso.oepc_rmo.oepc.i [2022-10-17 11:05:45,769 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10cac13a-4079-457b-ba7c-7c59c6cca3a4/bin/uautomizer-J5u9QxTXDZ/data/8606aa02e/12de2d8d4ab74312b5103d023460489c/FLAG85429dc15 [2022-10-17 11:05:46,022 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10cac13a-4079-457b-ba7c-7c59c6cca3a4/bin/uautomizer-J5u9QxTXDZ/data/8606aa02e/12de2d8d4ab74312b5103d023460489c [2022-10-17 11:05:46,025 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-10-17 11:05:46,026 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-10-17 11:05:46,031 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-10-17 11:05:46,031 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-10-17 11:05:46,035 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-10-17 11:05:46,036 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.10 11:05:46" (1/1) ... [2022-10-17 11:05:46,038 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1aedd596 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 11:05:46, skipping insertion in model container [2022-10-17 11:05:46,039 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.10 11:05:46" (1/1) ... [2022-10-17 11:05:46,046 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-10-17 11:05:46,100 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-10-17 11:05:46,335 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10cac13a-4079-457b-ba7c-7c59c6cca3a4/sv-benchmarks/c/pthread-wmm/rfi001_power.oepc_pso.oepc_rmo.oepc.i[969,982] [2022-10-17 11:05:46,661 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-17 11:05:46,681 INFO L203 MainTranslator]: Completed pre-run [2022-10-17 11:05:46,699 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10cac13a-4079-457b-ba7c-7c59c6cca3a4/sv-benchmarks/c/pthread-wmm/rfi001_power.oepc_pso.oepc_rmo.oepc.i[969,982] [2022-10-17 11:05:46,771 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-17 11:05:46,828 INFO L208 MainTranslator]: Completed translation [2022-10-17 11:05:46,828 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 11:05:46 WrapperNode [2022-10-17 11:05:46,829 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-10-17 11:05:46,830 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-10-17 11:05:46,830 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-10-17 11:05:46,831 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-10-17 11:05:46,840 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 11:05:46" (1/1) ... [2022-10-17 11:05:46,861 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 11:05:46" (1/1) ... [2022-10-17 11:05:46,916 INFO L138 Inliner]: procedures = 175, calls = 45, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 162 [2022-10-17 11:05:46,922 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-10-17 11:05:46,923 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-10-17 11:05:46,924 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-10-17 11:05:46,924 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-10-17 11:05:46,934 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 11:05:46" (1/1) ... [2022-10-17 11:05:46,934 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 11:05:46" (1/1) ... [2022-10-17 11:05:46,957 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 11:05:46" (1/1) ... [2022-10-17 11:05:46,969 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 11:05:46" (1/1) ... [2022-10-17 11:05:46,980 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 11:05:46" (1/1) ... [2022-10-17 11:05:46,984 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 11:05:46" (1/1) ... [2022-10-17 11:05:47,000 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 11:05:46" (1/1) ... [2022-10-17 11:05:47,003 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 11:05:46" (1/1) ... [2022-10-17 11:05:47,017 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-10-17 11:05:47,019 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-10-17 11:05:47,020 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-10-17 11:05:47,020 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-10-17 11:05:47,021 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 11:05:46" (1/1) ... [2022-10-17 11:05:47,028 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-17 11:05:47,043 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10cac13a-4079-457b-ba7c-7c59c6cca3a4/bin/uautomizer-J5u9QxTXDZ/z3 [2022-10-17 11:05:47,062 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10cac13a-4079-457b-ba7c-7c59c6cca3a4/bin/uautomizer-J5u9QxTXDZ/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-10-17 11:05:47,092 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10cac13a-4079-457b-ba7c-7c59c6cca3a4/bin/uautomizer-J5u9QxTXDZ/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-10-17 11:05:47,116 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-10-17 11:05:47,116 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-10-17 11:05:47,116 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-10-17 11:05:47,117 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-10-17 11:05:47,117 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-10-17 11:05:47,117 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-10-17 11:05:47,117 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-10-17 11:05:47,117 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-10-17 11:05:47,118 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-10-17 11:05:47,118 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-10-17 11:05:47,118 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-10-17 11:05:47,118 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-10-17 11:05:47,119 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-10-17 11:05:47,121 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-10-17 11:05:47,330 INFO L235 CfgBuilder]: Building ICFG [2022-10-17 11:05:47,333 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-10-17 11:05:48,096 INFO L276 CfgBuilder]: Performing block encoding [2022-10-17 11:05:48,652 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-10-17 11:05:48,652 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-10-17 11:05:48,655 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.10 11:05:48 BoogieIcfgContainer [2022-10-17 11:05:48,656 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-10-17 11:05:48,660 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-10-17 11:05:48,660 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-10-17 11:05:48,665 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-10-17 11:05:48,666 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.10 11:05:46" (1/3) ... [2022-10-17 11:05:48,667 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3af7272d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.10 11:05:48, skipping insertion in model container [2022-10-17 11:05:48,667 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 11:05:46" (2/3) ... [2022-10-17 11:05:48,668 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3af7272d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.10 11:05:48, skipping insertion in model container [2022-10-17 11:05:48,668 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.10 11:05:48" (3/3) ... [2022-10-17 11:05:48,674 INFO L112 eAbstractionObserver]: Analyzing ICFG rfi001_power.oepc_pso.oepc_rmo.oepc.i [2022-10-17 11:05:48,685 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-10-17 11:05:48,695 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-10-17 11:05:48,695 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-10-17 11:05:48,695 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-10-17 11:05:48,774 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-10-17 11:05:48,818 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 103 places, 98 transitions, 206 flow [2022-10-17 11:05:48,892 INFO L130 PetriNetUnfolder]: 2/96 cut-off events. [2022-10-17 11:05:48,892 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-10-17 11:05:48,896 INFO L83 FinitePrefix]: Finished finitePrefix Result has 103 conditions, 96 events. 2/96 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 47 event pairs, 0 based on Foata normal form. 0/92 useless extension candidates. Maximal degree in co-relation 57. Up to 2 conditions per place. [2022-10-17 11:05:48,896 INFO L82 GeneralOperation]: Start removeDead. Operand has 103 places, 98 transitions, 206 flow [2022-10-17 11:05:48,901 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 101 places, 96 transitions, 198 flow [2022-10-17 11:05:48,912 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-10-17 11:05:48,920 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@36fe759d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-10-17 11:05:48,920 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2022-10-17 11:05:48,932 INFO L130 PetriNetUnfolder]: 0/44 cut-off events. [2022-10-17 11:05:48,933 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-10-17 11:05:48,933 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-10-17 11:05:48,934 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-17 11:05:48,934 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-10-17 11:05:48,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-17 11:05:48,940 INFO L85 PathProgramCache]: Analyzing trace with hash -1326014903, now seen corresponding path program 1 times [2022-10-17 11:05:48,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-17 11:05:48,951 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [962113652] [2022-10-17 11:05:48,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-17 11:05:48,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 11:05:49,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 11:05:49,715 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-17 11:05:49,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-17 11:05:49,717 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [962113652] [2022-10-17 11:05:49,718 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [962113652] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-17 11:05:49,719 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-17 11:05:49,719 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-17 11:05:49,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1265722039] [2022-10-17 11:05:49,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-17 11:05:49,733 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-17 11:05:49,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-17 11:05:49,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-17 11:05:49,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-17 11:05:49,789 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 98 [2022-10-17 11:05:49,795 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 96 transitions, 198 flow. Second operand has 3 states, 3 states have (on average 87.0) internal successors, (261), 3 states have internal predecessors, (261), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 11:05:49,795 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-10-17 11:05:49,795 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 98 [2022-10-17 11:05:49,796 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-10-17 11:05:50,007 INFO L130 PetriNetUnfolder]: 18/179 cut-off events. [2022-10-17 11:05:50,007 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-10-17 11:05:50,010 INFO L83 FinitePrefix]: Finished finitePrefix Result has 231 conditions, 179 events. 18/179 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 515 event pairs, 12 based on Foata normal form. 6/172 useless extension candidates. Maximal degree in co-relation 182. Up to 31 conditions per place. [2022-10-17 11:05:50,013 INFO L137 encePairwiseOnDemand]: 93/98 looper letters, 10 selfloop transitions, 2 changer transitions 0/96 dead transitions. [2022-10-17 11:05:50,014 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 96 transitions, 225 flow [2022-10-17 11:05:50,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-17 11:05:50,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-10-17 11:05:50,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 275 transitions. [2022-10-17 11:05:50,037 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.935374149659864 [2022-10-17 11:05:50,038 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 275 transitions. [2022-10-17 11:05:50,039 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 275 transitions. [2022-10-17 11:05:50,046 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-10-17 11:05:50,048 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 275 transitions. [2022-10-17 11:05:50,056 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 91.66666666666667) internal successors, (275), 3 states have internal predecessors, (275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 11:05:50,068 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 98.0) internal successors, (392), 4 states have internal predecessors, (392), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 11:05:50,069 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 98.0) internal successors, (392), 4 states have internal predecessors, (392), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 11:05:50,071 INFO L175 Difference]: Start difference. First operand has 101 places, 96 transitions, 198 flow. Second operand 3 states and 275 transitions. [2022-10-17 11:05:50,073 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 96 transitions, 225 flow [2022-10-17 11:05:50,085 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 96 transitions, 222 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-10-17 11:05:50,094 INFO L231 Difference]: Finished difference. Result has 99 places, 92 transitions, 192 flow [2022-10-17 11:05:50,097 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=98, PETRI_DIFFERENCE_MINUEND_FLOW=188, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=192, PETRI_PLACES=99, PETRI_TRANSITIONS=92} [2022-10-17 11:05:50,102 INFO L287 CegarLoopForPetriNet]: 101 programPoint places, -2 predicate places. [2022-10-17 11:05:50,103 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 92 transitions, 192 flow [2022-10-17 11:05:50,105 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 87.0) internal successors, (261), 3 states have internal predecessors, (261), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 11:05:50,106 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-10-17 11:05:50,106 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-17 11:05:50,107 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-10-17 11:05:50,107 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-10-17 11:05:50,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-17 11:05:50,111 INFO L85 PathProgramCache]: Analyzing trace with hash -452750654, now seen corresponding path program 1 times [2022-10-17 11:05:50,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-17 11:05:50,112 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1635839320] [2022-10-17 11:05:50,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-17 11:05:50,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 11:05:50,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 11:05:50,620 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-17 11:05:50,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-17 11:05:50,621 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1635839320] [2022-10-17 11:05:50,621 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1635839320] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-17 11:05:50,621 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-17 11:05:50,622 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-10-17 11:05:50,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [323080615] [2022-10-17 11:05:50,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-17 11:05:50,624 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-10-17 11:05:50,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-17 11:05:50,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-10-17 11:05:50,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-10-17 11:05:50,627 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 77 out of 98 [2022-10-17 11:05:50,629 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 92 transitions, 192 flow. Second operand has 6 states, 6 states have (on average 78.66666666666667) internal successors, (472), 6 states have internal predecessors, (472), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 11:05:50,629 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-10-17 11:05:50,629 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 77 of 98 [2022-10-17 11:05:50,629 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-10-17 11:05:51,245 INFO L130 PetriNetUnfolder]: 262/888 cut-off events. [2022-10-17 11:05:51,245 INFO L131 PetriNetUnfolder]: For 47/47 co-relation queries the response was YES. [2022-10-17 11:05:51,250 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1413 conditions, 888 events. 262/888 cut-off events. For 47/47 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 5646 event pairs, 96 based on Foata normal form. 0/853 useless extension candidates. Maximal degree in co-relation 1363. Up to 270 conditions per place. [2022-10-17 11:05:51,253 INFO L137 encePairwiseOnDemand]: 91/98 looper letters, 18 selfloop transitions, 3 changer transitions 46/133 dead transitions. [2022-10-17 11:05:51,254 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 133 transitions, 406 flow [2022-10-17 11:05:51,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-10-17 11:05:51,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-10-17 11:05:51,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 753 transitions. [2022-10-17 11:05:51,258 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8537414965986394 [2022-10-17 11:05:51,258 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 753 transitions. [2022-10-17 11:05:51,259 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 753 transitions. [2022-10-17 11:05:51,260 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-10-17 11:05:51,260 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 753 transitions. [2022-10-17 11:05:51,263 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 83.66666666666667) internal successors, (753), 9 states have internal predecessors, (753), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 11:05:51,267 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 98.0) internal successors, (980), 10 states have internal predecessors, (980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 11:05:51,268 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 98.0) internal successors, (980), 10 states have internal predecessors, (980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 11:05:51,268 INFO L175 Difference]: Start difference. First operand has 99 places, 92 transitions, 192 flow. Second operand 9 states and 753 transitions. [2022-10-17 11:05:51,268 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 133 transitions, 406 flow [2022-10-17 11:05:51,270 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 133 transitions, 388 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-10-17 11:05:51,273 INFO L231 Difference]: Finished difference. Result has 112 places, 84 transitions, 211 flow [2022-10-17 11:05:51,274 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=98, PETRI_DIFFERENCE_MINUEND_FLOW=188, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=211, PETRI_PLACES=112, PETRI_TRANSITIONS=84} [2022-10-17 11:05:51,275 INFO L287 CegarLoopForPetriNet]: 101 programPoint places, 11 predicate places. [2022-10-17 11:05:51,275 INFO L495 AbstractCegarLoop]: Abstraction has has 112 places, 84 transitions, 211 flow [2022-10-17 11:05:51,276 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 78.66666666666667) internal successors, (472), 6 states have internal predecessors, (472), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 11:05:51,276 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-10-17 11:05:51,276 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-17 11:05:51,277 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-10-17 11:05:51,277 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-10-17 11:05:51,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-17 11:05:51,278 INFO L85 PathProgramCache]: Analyzing trace with hash 212934081, now seen corresponding path program 1 times [2022-10-17 11:05:51,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-17 11:05:51,278 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [871615754] [2022-10-17 11:05:51,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-17 11:05:51,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 11:05:51,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 11:05:51,628 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-17 11:05:51,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-17 11:05:51,630 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [871615754] [2022-10-17 11:05:51,631 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [871615754] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-17 11:05:51,631 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-17 11:05:51,632 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-10-17 11:05:51,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [177578752] [2022-10-17 11:05:51,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-17 11:05:51,634 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-10-17 11:05:51,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-17 11:05:51,635 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-10-17 11:05:51,635 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-10-17 11:05:51,638 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 98 [2022-10-17 11:05:51,640 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 84 transitions, 211 flow. Second operand has 6 states, 6 states have (on average 79.66666666666667) internal successors, (478), 6 states have internal predecessors, (478), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 11:05:51,640 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-10-17 11:05:51,640 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 98 [2022-10-17 11:05:51,640 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-10-17 11:05:52,122 INFO L130 PetriNetUnfolder]: 200/512 cut-off events. [2022-10-17 11:05:52,122 INFO L131 PetriNetUnfolder]: For 361/362 co-relation queries the response was YES. [2022-10-17 11:05:52,125 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1165 conditions, 512 events. 200/512 cut-off events. For 361/362 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 2376 event pairs, 50 based on Foata normal form. 18/510 useless extension candidates. Maximal degree in co-relation 1108. Up to 179 conditions per place. [2022-10-17 11:05:52,129 INFO L137 encePairwiseOnDemand]: 92/98 looper letters, 16 selfloop transitions, 2 changer transitions 28/115 dead transitions. [2022-10-17 11:05:52,129 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 115 transitions, 383 flow [2022-10-17 11:05:52,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-10-17 11:05:52,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-10-17 11:05:52,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 750 transitions. [2022-10-17 11:05:52,134 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8503401360544217 [2022-10-17 11:05:52,134 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 750 transitions. [2022-10-17 11:05:52,134 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 750 transitions. [2022-10-17 11:05:52,135 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-10-17 11:05:52,135 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 750 transitions. [2022-10-17 11:05:52,138 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 83.33333333333333) internal successors, (750), 9 states have internal predecessors, (750), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 11:05:52,142 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 98.0) internal successors, (980), 10 states have internal predecessors, (980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 11:05:52,143 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 98.0) internal successors, (980), 10 states have internal predecessors, (980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 11:05:52,144 INFO L175 Difference]: Start difference. First operand has 112 places, 84 transitions, 211 flow. Second operand 9 states and 750 transitions. [2022-10-17 11:05:52,144 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 115 transitions, 383 flow [2022-10-17 11:05:52,149 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 115 transitions, 364 flow, removed 8 selfloop flow, removed 4 redundant places. [2022-10-17 11:05:52,153 INFO L231 Difference]: Finished difference. Result has 107 places, 84 transitions, 220 flow [2022-10-17 11:05:52,153 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=98, PETRI_DIFFERENCE_MINUEND_FLOW=200, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=220, PETRI_PLACES=107, PETRI_TRANSITIONS=84} [2022-10-17 11:05:52,154 INFO L287 CegarLoopForPetriNet]: 101 programPoint places, 6 predicate places. [2022-10-17 11:05:52,155 INFO L495 AbstractCegarLoop]: Abstraction has has 107 places, 84 transitions, 220 flow [2022-10-17 11:05:52,155 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 79.66666666666667) internal successors, (478), 6 states have internal predecessors, (478), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 11:05:52,156 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-10-17 11:05:52,156 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-17 11:05:52,156 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-10-17 11:05:52,157 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-10-17 11:05:52,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-17 11:05:52,158 INFO L85 PathProgramCache]: Analyzing trace with hash -143450944, now seen corresponding path program 1 times [2022-10-17 11:05:52,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-17 11:05:52,158 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1376384865] [2022-10-17 11:05:52,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-17 11:05:52,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 11:05:52,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 11:05:52,488 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-17 11:05:52,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-17 11:05:52,489 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1376384865] [2022-10-17 11:05:52,489 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1376384865] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-17 11:05:52,490 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-17 11:05:52,490 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-10-17 11:05:52,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2044358974] [2022-10-17 11:05:52,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-17 11:05:52,492 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-10-17 11:05:52,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-17 11:05:52,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-10-17 11:05:52,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-10-17 11:05:52,500 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 77 out of 98 [2022-10-17 11:05:52,502 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 84 transitions, 220 flow. Second operand has 6 states, 6 states have (on average 78.66666666666667) internal successors, (472), 6 states have internal predecessors, (472), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 11:05:52,503 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-10-17 11:05:52,503 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 77 of 98 [2022-10-17 11:05:52,503 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-10-17 11:05:52,998 INFO L130 PetriNetUnfolder]: 188/565 cut-off events. [2022-10-17 11:05:52,999 INFO L131 PetriNetUnfolder]: For 132/133 co-relation queries the response was YES. [2022-10-17 11:05:53,002 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1085 conditions, 565 events. 188/565 cut-off events. For 132/133 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 2983 event pairs, 20 based on Foata normal form. 0/546 useless extension candidates. Maximal degree in co-relation 1026. Up to 85 conditions per place. [2022-10-17 11:05:53,006 INFO L137 encePairwiseOnDemand]: 89/98 looper letters, 38 selfloop transitions, 12 changer transitions 19/136 dead transitions. [2022-10-17 11:05:53,006 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 136 transitions, 464 flow [2022-10-17 11:05:53,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-10-17 11:05:53,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-10-17 11:05:53,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 841 transitions. [2022-10-17 11:05:53,010 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8581632653061224 [2022-10-17 11:05:53,011 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 841 transitions. [2022-10-17 11:05:53,011 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 841 transitions. [2022-10-17 11:05:53,012 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-10-17 11:05:53,012 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 841 transitions. [2022-10-17 11:05:53,015 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 84.1) internal successors, (841), 10 states have internal predecessors, (841), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 11:05:53,018 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 98.0) internal successors, (1078), 11 states have internal predecessors, (1078), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 11:05:53,022 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 98.0) internal successors, (1078), 11 states have internal predecessors, (1078), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 11:05:53,022 INFO L175 Difference]: Start difference. First operand has 107 places, 84 transitions, 220 flow. Second operand 10 states and 841 transitions. [2022-10-17 11:05:53,023 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 136 transitions, 464 flow [2022-10-17 11:05:53,028 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 136 transitions, 444 flow, removed 8 selfloop flow, removed 8 redundant places. [2022-10-17 11:05:53,031 INFO L231 Difference]: Finished difference. Result has 108 places, 95 transitions, 286 flow [2022-10-17 11:05:53,031 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=98, PETRI_DIFFERENCE_MINUEND_FLOW=200, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=286, PETRI_PLACES=108, PETRI_TRANSITIONS=95} [2022-10-17 11:05:53,033 INFO L287 CegarLoopForPetriNet]: 101 programPoint places, 7 predicate places. [2022-10-17 11:05:53,033 INFO L495 AbstractCegarLoop]: Abstraction has has 108 places, 95 transitions, 286 flow [2022-10-17 11:05:53,034 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 78.66666666666667) internal successors, (472), 6 states have internal predecessors, (472), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 11:05:53,041 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-10-17 11:05:53,042 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-17 11:05:53,042 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-10-17 11:05:53,043 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-10-17 11:05:53,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-17 11:05:53,043 INFO L85 PathProgramCache]: Analyzing trace with hash 1460082700, now seen corresponding path program 1 times [2022-10-17 11:05:53,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-17 11:05:53,045 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [354799653] [2022-10-17 11:05:53,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-17 11:05:53,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 11:05:53,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 11:05:53,482 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-17 11:05:53,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-17 11:05:53,482 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [354799653] [2022-10-17 11:05:53,483 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [354799653] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-17 11:05:53,483 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-17 11:05:53,483 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-10-17 11:05:53,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2146519218] [2022-10-17 11:05:53,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-17 11:05:53,485 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-10-17 11:05:53,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-17 11:05:53,486 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-10-17 11:05:53,486 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-10-17 11:05:53,488 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 77 out of 98 [2022-10-17 11:05:53,489 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 95 transitions, 286 flow. Second operand has 7 states, 7 states have (on average 78.85714285714286) internal successors, (552), 7 states have internal predecessors, (552), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 11:05:53,489 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-10-17 11:05:53,489 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 77 of 98 [2022-10-17 11:05:53,489 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-10-17 11:05:53,969 INFO L130 PetriNetUnfolder]: 154/474 cut-off events. [2022-10-17 11:05:53,969 INFO L131 PetriNetUnfolder]: For 205/205 co-relation queries the response was YES. [2022-10-17 11:05:53,972 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1098 conditions, 474 events. 154/474 cut-off events. For 205/205 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 2547 event pairs, 20 based on Foata normal form. 8/471 useless extension candidates. Maximal degree in co-relation 1067. Up to 52 conditions per place. [2022-10-17 11:05:53,975 INFO L137 encePairwiseOnDemand]: 89/98 looper letters, 31 selfloop transitions, 15 changer transitions 21/134 dead transitions. [2022-10-17 11:05:53,975 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 134 transitions, 544 flow [2022-10-17 11:05:53,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-10-17 11:05:53,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-10-17 11:05:53,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1063 transitions. [2022-10-17 11:05:53,981 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8343799058084772 [2022-10-17 11:05:53,981 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1063 transitions. [2022-10-17 11:05:53,981 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1063 transitions. [2022-10-17 11:05:53,982 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-10-17 11:05:53,983 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1063 transitions. [2022-10-17 11:05:53,986 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 81.76923076923077) internal successors, (1063), 13 states have internal predecessors, (1063), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 11:05:53,991 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 98.0) internal successors, (1372), 14 states have internal predecessors, (1372), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 11:05:53,994 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 98.0) internal successors, (1372), 14 states have internal predecessors, (1372), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 11:05:53,994 INFO L175 Difference]: Start difference. First operand has 108 places, 95 transitions, 286 flow. Second operand 13 states and 1063 transitions. [2022-10-17 11:05:53,995 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 134 transitions, 544 flow [2022-10-17 11:05:53,999 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 134 transitions, 524 flow, removed 8 selfloop flow, removed 5 redundant places. [2022-10-17 11:05:54,002 INFO L231 Difference]: Finished difference. Result has 122 places, 97 transitions, 341 flow [2022-10-17 11:05:54,003 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=98, PETRI_DIFFERENCE_MINUEND_FLOW=266, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=341, PETRI_PLACES=122, PETRI_TRANSITIONS=97} [2022-10-17 11:05:54,004 INFO L287 CegarLoopForPetriNet]: 101 programPoint places, 21 predicate places. [2022-10-17 11:05:54,004 INFO L495 AbstractCegarLoop]: Abstraction has has 122 places, 97 transitions, 341 flow [2022-10-17 11:05:54,005 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 78.85714285714286) internal successors, (552), 7 states have internal predecessors, (552), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 11:05:54,005 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-10-17 11:05:54,005 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-17 11:05:54,006 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-10-17 11:05:54,006 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-10-17 11:05:54,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-17 11:05:54,007 INFO L85 PathProgramCache]: Analyzing trace with hash -1345599231, now seen corresponding path program 1 times [2022-10-17 11:05:54,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-17 11:05:54,007 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1288450845] [2022-10-17 11:05:54,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-17 11:05:54,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 11:05:54,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-10-17 11:05:54,088 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-10-17 11:05:54,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-10-17 11:05:54,191 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-10-17 11:05:54,192 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-10-17 11:05:54,193 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2022-10-17 11:05:54,195 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2022-10-17 11:05:54,195 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2022-10-17 11:05:54,196 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2022-10-17 11:05:54,196 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2022-10-17 11:05:54,196 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-10-17 11:05:54,197 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2022-10-17 11:05:54,204 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-10-17 11:05:54,205 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-10-17 11:05:54,373 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.10 11:05:54 BasicIcfg [2022-10-17 11:05:54,375 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-10-17 11:05:54,376 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-10-17 11:05:54,376 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-10-17 11:05:54,377 INFO L275 PluginConnector]: Witness Printer initialized [2022-10-17 11:05:54,377 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.10 11:05:48" (3/4) ... [2022-10-17 11:05:54,379 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-10-17 11:05:54,601 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10cac13a-4079-457b-ba7c-7c59c6cca3a4/bin/uautomizer-J5u9QxTXDZ/witness.graphml [2022-10-17 11:05:54,601 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-10-17 11:05:54,602 INFO L158 Benchmark]: Toolchain (without parser) took 8575.58ms. Allocated memory was 90.2MB in the beginning and 190.8MB in the end (delta: 100.7MB). Free memory was 49.1MB in the beginning and 153.3MB in the end (delta: -104.2MB). Peak memory consumption was 99.3MB. Max. memory is 16.1GB. [2022-10-17 11:05:54,603 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 90.2MB. Free memory was 67.3MB in the beginning and 67.2MB in the end (delta: 90.9kB). There was no memory consumed. Max. memory is 16.1GB. [2022-10-17 11:05:54,604 INFO L158 Benchmark]: CACSL2BoogieTranslator took 798.45ms. Allocated memory was 90.2MB in the beginning and 109.1MB in the end (delta: 18.9MB). Free memory was 48.9MB in the beginning and 70.5MB in the end (delta: -21.6MB). Peak memory consumption was 6.5MB. Max. memory is 16.1GB. [2022-10-17 11:05:54,604 INFO L158 Benchmark]: Boogie Procedure Inliner took 92.45ms. Allocated memory is still 109.1MB. Free memory was 70.5MB in the beginning and 68.3MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-10-17 11:05:54,605 INFO L158 Benchmark]: Boogie Preprocessor took 94.71ms. Allocated memory is still 109.1MB. Free memory was 68.3MB in the beginning and 65.9MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-10-17 11:05:54,605 INFO L158 Benchmark]: RCFGBuilder took 1637.07ms. Allocated memory is still 109.1MB. Free memory was 65.9MB in the beginning and 53.5MB in the end (delta: 12.4MB). Peak memory consumption was 33.0MB. Max. memory is 16.1GB. [2022-10-17 11:05:54,606 INFO L158 Benchmark]: TraceAbstraction took 5715.43ms. Allocated memory was 109.1MB in the beginning and 190.8MB in the end (delta: 81.8MB). Free memory was 52.8MB in the beginning and 68.2MB in the end (delta: -15.4MB). Peak memory consumption was 66.0MB. Max. memory is 16.1GB. [2022-10-17 11:05:54,606 INFO L158 Benchmark]: Witness Printer took 225.15ms. Allocated memory is still 190.8MB. Free memory was 68.2MB in the beginning and 153.3MB in the end (delta: -85.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2022-10-17 11:05:54,610 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.21ms. Allocated memory is still 90.2MB. Free memory was 67.3MB in the beginning and 67.2MB in the end (delta: 90.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 798.45ms. Allocated memory was 90.2MB in the beginning and 109.1MB in the end (delta: 18.9MB). Free memory was 48.9MB in the beginning and 70.5MB in the end (delta: -21.6MB). Peak memory consumption was 6.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 92.45ms. Allocated memory is still 109.1MB. Free memory was 70.5MB in the beginning and 68.3MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 94.71ms. Allocated memory is still 109.1MB. Free memory was 68.3MB in the beginning and 65.9MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1637.07ms. Allocated memory is still 109.1MB. Free memory was 65.9MB in the beginning and 53.5MB in the end (delta: 12.4MB). Peak memory consumption was 33.0MB. Max. memory is 16.1GB. * TraceAbstraction took 5715.43ms. Allocated memory was 109.1MB in the beginning and 190.8MB in the end (delta: 81.8MB). Free memory was 52.8MB in the beginning and 68.2MB in the end (delta: -15.4MB). Peak memory consumption was 66.0MB. Max. memory is 16.1GB. * Witness Printer took 225.15ms. Allocated memory is still 190.8MB. Free memory was 68.2MB in the beginning and 153.3MB in the end (delta: -85.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L708] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L710] 0 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0] [L712] 0 int __unbuffered_p1_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0] [L713] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0] [L714] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L716] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L717] 0 _Bool x$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0] [L718] 0 int x$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0] [L719] 0 _Bool x$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0] [L720] 0 _Bool x$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0] [L721] 0 _Bool x$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0] [L722] 0 _Bool x$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0] [L723] 0 _Bool x$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0] [L724] 0 _Bool x$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0] [L725] 0 _Bool x$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0] [L726] 0 int *x$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}] [L727] 0 int x$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0] [L728] 0 _Bool x$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0] [L729] 0 int x$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0] [L730] 0 _Bool x$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0] [L732] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L734] 0 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L735] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L736] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L815] 0 pthread_t t1601; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1601={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L816] FCALL, FORK 0 pthread_create(&t1601, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1601, ((void *)0), P0, ((void *)0))=-1, t1601={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L817] 0 pthread_t t1602; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1601={5:0}, t1602={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L818] FCALL, FORK 0 pthread_create(&t1602, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1602, ((void *)0), P1, ((void *)0))=0, t1601={5:0}, t1602={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L740] 1 x$w_buff1 = x$w_buff0 [L741] 1 x$w_buff0 = 1 [L742] 1 x$w_buff1_used = x$w_buff0_used [L743] 1 x$w_buff0_used = (_Bool)1 [L744] CALL 1 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L744] RET 1 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L745] 1 x$r_buff1_thd0 = x$r_buff0_thd0 [L746] 1 x$r_buff1_thd1 = x$r_buff0_thd1 [L747] 1 x$r_buff1_thd2 = x$r_buff0_thd2 [L748] 1 x$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L751] 1 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L768] 2 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2, z=0] [L771] 2 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L774] 2 __unbuffered_p1_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L777] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L778] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L779] 2 x$flush_delayed = weak$$choice2 [L780] 2 x$mem_tmp = x [L781] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L781] 2 x = !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L782] EXPR 2 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) [L782] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0) [L782] EXPR 2 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) [L782] 2 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) [L783] EXPR 2 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) [L783] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1) [L783] EXPR 2 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) [L783] 2 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) [L784] EXPR 2 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) [L784] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used) [L784] EXPR 2 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) [L784] 2 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) [L785] EXPR 2 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L785] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0) [L785] EXPR 2 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L785] 2 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L786] EXPR 2 weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2)) [L786] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2) [L786] EXPR 2 weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2)) [L786] 2 x$r_buff0_thd2 = weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2)) [L787] EXPR 2 weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L787] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0) [L787] EXPR 2 weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L787] 2 x$r_buff1_thd2 = weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L788] 2 __unbuffered_p1_EBX = x [L789] EXPR 2 x$flush_delayed ? x$mem_tmp : x [L789] 2 x = x$flush_delayed ? x$mem_tmp : x [L790] 2 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L754] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L754] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L755] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L755] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L756] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L756] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L757] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L757] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L758] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L758] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L793] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L793] EXPR 2 x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x [L793] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L793] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L794] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L794] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L795] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L795] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L796] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L796] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L797] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L797] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L761] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L800] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L820] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1601={5:0}, t1602={3:0}, weak$$choice0=49, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L822] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) VAL [\old(cond)=1, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, cond=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L822] RET 0 assume_abort_if_not(main$tmp_guard0) [L824] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L824] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L824] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L824] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L825] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L825] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L826] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L826] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L827] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L827] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L828] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L828] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L831] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1601={5:0}, t1602={3:0}, weak$$choice0=49, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L833] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\old(expression)=0, \old(expression)=1, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 816]: 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: 818]: 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 5 procedures, 118 locations, 5 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 5.4s, OverallIterations: 6, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 210 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 210 mSDsluCounter, 118 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 272 mSDsCounter, 28 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 396 IncrementalHoareTripleChecker+Invalid, 424 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 28 mSolverCounterUnsat, 29 mSDtfsCounter, 396 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 50 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=341occurred in iteration=5, InterpolantAutomatonStates: 44, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 393 NumberOfCodeBlocks, 393 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 311 ConstructedInterpolants, 0 QuantifiedInterpolants, 833 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-10-17 11:05:54,681 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10cac13a-4079-457b-ba7c-7c59c6cca3a4/bin/uautomizer-J5u9QxTXDZ/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