./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix016_power.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 7b2dab56 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8060d70-e723-4559-995a-ad86f122134e/bin/uautomizer-Z5i5R5N3CC/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8060d70-e723-4559-995a-ad86f122134e/bin/uautomizer-Z5i5R5N3CC/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8060d70-e723-4559-995a-ad86f122134e/bin/uautomizer-Z5i5R5N3CC/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8060d70-e723-4559-995a-ad86f122134e/bin/uautomizer-Z5i5R5N3CC/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix016_power.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8060d70-e723-4559-995a-ad86f122134e/bin/uautomizer-Z5i5R5N3CC/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8060d70-e723-4559-995a-ad86f122134e/bin/uautomizer-Z5i5R5N3CC --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 4f3e8681b6d150d6cff26b19ba7c3ea24e674f23 .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.2.0-7b2dab5 [2021-10-11 00:25:53,655 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-10-11 00:25:53,658 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-10-11 00:25:53,691 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-10-11 00:25:53,692 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-10-11 00:25:53,693 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-10-11 00:25:53,695 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-10-11 00:25:53,698 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-10-11 00:25:53,700 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-10-11 00:25:53,702 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-10-11 00:25:53,703 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-10-11 00:25:53,705 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-10-11 00:25:53,705 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-10-11 00:25:53,707 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-10-11 00:25:53,709 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-10-11 00:25:53,710 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-10-11 00:25:53,711 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-10-11 00:25:53,713 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-10-11 00:25:53,715 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-10-11 00:25:53,718 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-10-11 00:25:53,720 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-10-11 00:25:53,722 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-10-11 00:25:53,724 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-10-11 00:25:53,725 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-10-11 00:25:53,728 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-10-11 00:25:53,729 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-10-11 00:25:53,729 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-10-11 00:25:53,731 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-10-11 00:25:53,731 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-10-11 00:25:53,733 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-10-11 00:25:53,733 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-10-11 00:25:53,734 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-10-11 00:25:53,735 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-10-11 00:25:53,736 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-10-11 00:25:53,737 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-10-11 00:25:53,738 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-10-11 00:25:53,738 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-10-11 00:25:53,739 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-10-11 00:25:53,739 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-10-11 00:25:53,740 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-10-11 00:25:53,741 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-10-11 00:25:53,742 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8060d70-e723-4559-995a-ad86f122134e/bin/uautomizer-Z5i5R5N3CC/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-10-11 00:25:53,767 INFO L113 SettingsManager]: Loading preferences was successful [2021-10-11 00:25:53,767 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-10-11 00:25:53,768 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-10-11 00:25:53,768 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-10-11 00:25:53,769 INFO L138 SettingsManager]: * Use SBE=true [2021-10-11 00:25:53,769 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-10-11 00:25:53,769 INFO L138 SettingsManager]: * sizeof long=4 [2021-10-11 00:25:53,769 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-10-11 00:25:53,769 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-10-11 00:25:53,770 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-10-11 00:25:53,770 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-10-11 00:25:53,770 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-10-11 00:25:53,770 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-10-11 00:25:53,770 INFO L138 SettingsManager]: * sizeof long double=12 [2021-10-11 00:25:53,770 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-10-11 00:25:53,771 INFO L138 SettingsManager]: * Use constant arrays=true [2021-10-11 00:25:53,771 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-10-11 00:25:53,771 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-10-11 00:25:53,771 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-10-11 00:25:53,771 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-10-11 00:25:53,772 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-11 00:25:53,772 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-10-11 00:25:53,772 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-10-11 00:25:53,772 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-10-11 00:25:53,772 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-10-11 00:25:53,773 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-10-11 00:25:53,773 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-10-11 00:25:53,773 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-10-11 00:25:53,773 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_e8060d70-e723-4559-995a-ad86f122134e/bin/uautomizer-Z5i5R5N3CC/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_e8060d70-e723-4559-995a-ad86f122134e/bin/uautomizer-Z5i5R5N3CC 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 -> 4f3e8681b6d150d6cff26b19ba7c3ea24e674f23 [2021-10-11 00:25:54,073 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-10-11 00:25:54,113 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-10-11 00:25:54,116 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-10-11 00:25:54,118 INFO L271 PluginConnector]: Initializing CDTParser... [2021-10-11 00:25:54,119 INFO L275 PluginConnector]: CDTParser initialized [2021-10-11 00:25:54,120 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8060d70-e723-4559-995a-ad86f122134e/bin/uautomizer-Z5i5R5N3CC/../../sv-benchmarks/c/pthread-wmm/mix016_power.oepc.i [2021-10-11 00:25:54,200 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8060d70-e723-4559-995a-ad86f122134e/bin/uautomizer-Z5i5R5N3CC/data/876149b53/d9e441868cff4c4994fd857ae273ffae/FLAGa47146740 [2021-10-11 00:25:54,682 INFO L306 CDTParser]: Found 1 translation units. [2021-10-11 00:25:54,683 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8060d70-e723-4559-995a-ad86f122134e/sv-benchmarks/c/pthread-wmm/mix016_power.oepc.i [2021-10-11 00:25:54,719 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8060d70-e723-4559-995a-ad86f122134e/bin/uautomizer-Z5i5R5N3CC/data/876149b53/d9e441868cff4c4994fd857ae273ffae/FLAGa47146740 [2021-10-11 00:25:55,022 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8060d70-e723-4559-995a-ad86f122134e/bin/uautomizer-Z5i5R5N3CC/data/876149b53/d9e441868cff4c4994fd857ae273ffae [2021-10-11 00:25:55,028 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-10-11 00:25:55,031 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-10-11 00:25:55,036 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-10-11 00:25:55,036 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-10-11 00:25:55,039 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-10-11 00:25:55,040 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 12:25:55" (1/1) ... [2021-10-11 00:25:55,042 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5a4df379 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:25:55, skipping insertion in model container [2021-10-11 00:25:55,043 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 12:25:55" (1/1) ... [2021-10-11 00:25:55,050 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-10-11 00:25:55,104 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-10-11 00:25:55,317 WARN L226 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_e8060d70-e723-4559-995a-ad86f122134e/sv-benchmarks/c/pthread-wmm/mix016_power.oepc.i[951,964] [2021-10-11 00:25:55,571 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-11 00:25:55,580 INFO L203 MainTranslator]: Completed pre-run [2021-10-11 00:25:55,599 WARN L226 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_e8060d70-e723-4559-995a-ad86f122134e/sv-benchmarks/c/pthread-wmm/mix016_power.oepc.i[951,964] [2021-10-11 00:25:55,694 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-11 00:25:55,781 INFO L208 MainTranslator]: Completed translation [2021-10-11 00:25:55,782 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:25:55 WrapperNode [2021-10-11 00:25:55,782 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-10-11 00:25:55,784 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-10-11 00:25:55,784 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-10-11 00:25:55,786 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-10-11 00:25:55,794 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:25:55" (1/1) ... [2021-10-11 00:25:55,834 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:25:55" (1/1) ... [2021-10-11 00:25:55,872 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-10-11 00:25:55,873 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-10-11 00:25:55,873 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-10-11 00:25:55,873 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-10-11 00:25:55,883 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:25:55" (1/1) ... [2021-10-11 00:25:55,883 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:25:55" (1/1) ... [2021-10-11 00:25:55,887 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:25:55" (1/1) ... [2021-10-11 00:25:55,888 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:25:55" (1/1) ... [2021-10-11 00:25:55,917 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:25:55" (1/1) ... [2021-10-11 00:25:55,921 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:25:55" (1/1) ... [2021-10-11 00:25:55,925 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:25:55" (1/1) ... [2021-10-11 00:25:55,942 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-10-11 00:25:55,943 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-10-11 00:25:55,943 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-10-11 00:25:55,943 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-10-11 00:25:55,944 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:25:55" (1/1) ... No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8060d70-e723-4559-995a-ad86f122134e/bin/uautomizer-Z5i5R5N3CC/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-11 00:25:56,052 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-10-11 00:25:56,052 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-10-11 00:25:56,053 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-10-11 00:25:56,053 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-10-11 00:25:56,054 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-10-11 00:25:56,055 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-10-11 00:25:56,055 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-10-11 00:25:56,055 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-10-11 00:25:56,056 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-10-11 00:25:56,056 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-10-11 00:25:56,056 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-10-11 00:25:56,056 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-10-11 00:25:56,056 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-10-11 00:25:56,057 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-10-11 00:25:56,059 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-10-11 00:25:58,270 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-10-11 00:25:58,271 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-10-11 00:25:58,273 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 12:25:58 BoogieIcfgContainer [2021-10-11 00:25:58,273 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-10-11 00:25:58,276 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-10-11 00:25:58,276 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-10-11 00:25:58,279 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-10-11 00:25:58,280 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 12:25:55" (1/3) ... [2021-10-11 00:25:58,281 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@674a7066 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 12:25:58, skipping insertion in model container [2021-10-11 00:25:58,281 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:25:55" (2/3) ... [2021-10-11 00:25:58,281 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@674a7066 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 12:25:58, skipping insertion in model container [2021-10-11 00:25:58,281 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 12:25:58" (3/3) ... [2021-10-11 00:25:58,283 INFO L111 eAbstractionObserver]: Analyzing ICFG mix016_power.oepc.i [2021-10-11 00:25:58,301 WARN L169 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-10-11 00:25:58,302 INFO L180 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-10-11 00:25:58,306 INFO L192 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2021-10-11 00:25:58,307 INFO L354 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-10-11 00:25:58,355 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:25:58,356 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:25:58,356 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:25:58,356 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:25:58,356 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:25:58,356 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:25:58,357 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:25:58,357 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:25:58,357 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:25:58,357 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:25:58,357 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:25:58,358 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:25:58,358 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:25:58,358 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:25:58,358 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:25:58,358 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:25:58,359 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:25:58,359 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:25:58,359 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:25:58,359 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:25:58,360 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:25:58,360 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:25:58,360 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:25:58,361 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:25:58,361 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:25:58,362 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:25:58,362 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:25:58,362 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:25:58,362 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:25:58,363 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:25:58,363 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:25:58,363 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:25:58,364 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:25:58,365 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:25:58,366 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:25:58,366 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:25:58,366 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:25:58,366 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:25:58,366 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:25:58,367 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:25:58,367 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:25:58,367 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:25:58,367 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:25:58,368 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:25:58,368 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:25:58,368 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:25:58,368 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:25:58,368 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:25:58,368 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:25:58,369 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:25:58,369 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:25:58,369 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:25:58,369 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:25:58,370 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:25:58,370 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:25:58,370 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:25:58,370 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:25:58,371 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:25:58,371 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:25:58,371 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:25:58,372 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:25:58,372 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:25:58,372 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:25:58,372 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:25:58,373 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:25:58,373 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:25:58,373 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:25:58,373 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:25:58,373 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:25:58,373 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:25:58,374 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:25:58,374 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:25:58,374 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:25:58,374 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:25:58,374 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:25:58,374 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:25:58,375 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:25:58,375 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:25:58,375 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:25:58,376 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:25:58,376 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:25:58,376 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:25:58,376 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:25:58,377 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:25:58,377 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:25:58,377 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:25:58,377 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:25:58,377 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:25:58,377 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:25:58,377 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:25:58,378 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:25:58,379 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:25:58,381 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:25:58,382 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:25:58,382 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:25:58,382 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:25:58,382 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:25:58,383 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:25:58,383 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:25:58,383 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:25:58,384 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:25:58,385 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:25:58,385 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:25:58,385 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:25:58,392 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:25:58,392 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:25:58,396 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:25:58,396 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:25:58,396 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:25:58,396 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:25:58,397 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:25:58,397 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:25:58,397 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:25:58,397 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:25:58,397 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:25:58,397 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:25:58,397 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:25:58,398 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:25:58,398 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:25:58,398 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:25:58,399 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:25:58,399 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:25:58,400 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:25:58,400 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:25:58,400 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:25:58,400 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:25:58,400 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:25:58,400 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:25:58,400 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:25:58,401 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:25:58,401 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:25:58,401 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:25:58,401 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:25:58,401 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:25:58,401 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:25:58,401 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:25:58,402 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:25:58,402 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:25:58,402 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:25:58,402 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:25:58,402 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:25:58,402 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:25:58,402 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:25:58,403 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:25:58,405 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:25:58,405 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:25:58,406 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:25:58,406 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:25:58,406 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:25:58,406 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:25:58,406 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:25:58,407 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:25:58,407 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:25:58,407 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:25:58,407 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:25:58,407 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:25:58,407 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:25:58,407 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:25:58,408 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:25:58,408 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:25:58,408 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:25:58,409 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:25:58,410 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:25:58,411 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:25:58,411 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:25:58,411 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:25:58,411 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:25:58,411 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:25:58,412 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:25:58,412 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:25:58,412 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:25:58,413 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:25:58,415 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:25:58,415 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:25:58,415 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:25:58,415 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:25:58,415 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:25:58,416 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:25:58,416 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:25:58,416 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:25:58,416 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:25:58,416 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:25:58,417 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:25:58,417 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:25:58,417 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:25:58,417 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:25:58,417 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:25:58,417 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:25:58,418 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:25:58,418 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:25:58,418 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:25:58,418 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:25:58,418 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:25:58,418 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:25:58,419 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:25:58,419 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:25:58,419 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:25:58,419 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:25:58,419 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:25:58,419 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:25:58,420 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:25:58,420 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:25:58,420 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:25:58,420 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:25:58,420 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:25:58,422 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:25:58,422 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:25:58,422 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:25:58,423 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:25:58,423 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:25:58,423 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:25:58,423 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:25:58,423 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:25:58,423 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:25:58,424 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:25:58,424 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:25:58,424 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:25:58,426 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-10-11 00:25:58,438 INFO L253 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2021-10-11 00:25:58,474 INFO L377 AbstractCegarLoop]: Interprodecural is true [2021-10-11 00:25:58,474 INFO L378 AbstractCegarLoop]: Hoare is true [2021-10-11 00:25:58,475 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-10-11 00:25:58,475 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-10-11 00:25:58,475 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-10-11 00:25:58,475 INFO L382 AbstractCegarLoop]: Difference is false [2021-10-11 00:25:58,475 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-10-11 00:25:58,476 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-10-11 00:25:58,488 INFO L120 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-10-11 00:25:58,490 INFO L135 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 109 places, 101 transitions, 217 flow [2021-10-11 00:25:58,493 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 109 places, 101 transitions, 217 flow [2021-10-11 00:25:58,495 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 109 places, 101 transitions, 217 flow [2021-10-11 00:25:58,584 INFO L129 PetriNetUnfolder]: 2/98 cut-off events. [2021-10-11 00:25:58,584 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-10-11 00:25:58,593 INFO L84 FinitePrefix]: Finished finitePrefix Result has 108 conditions, 98 events. 2/98 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 71 event pairs, 0 based on Foata normal form. 0/94 useless extension candidates. Maximal degree in co-relation 62. Up to 2 conditions per place. [2021-10-11 00:25:58,599 INFO L116 LiptonReduction]: Number of co-enabled transitions 1778 [2021-10-11 00:25:58,717 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-10-11 00:25:58,718 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 00:25:58,721 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-10-11 00:25:58,722 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 00:25:58,729 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-10-11 00:25:58,730 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-10-11 00:25:58,739 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-10-11 00:25:58,740 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-10-11 00:25:58,802 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-10-11 00:25:58,803 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 00:25:58,805 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-10-11 00:25:58,805 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 00:25:58,813 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-10-11 00:25:58,813 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-10-11 00:25:58,816 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-10-11 00:25:58,817 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-10-11 00:25:58,953 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-10-11 00:25:58,954 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 00:25:58,955 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-10-11 00:25:58,956 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 00:25:58,960 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-10-11 00:25:58,961 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-10-11 00:25:58,964 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-10-11 00:25:58,964 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-10-11 00:25:59,006 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-10-11 00:25:59,006 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 00:25:59,008 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-10-11 00:25:59,008 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 00:25:59,011 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-10-11 00:25:59,012 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-10-11 00:25:59,017 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-10-11 00:25:59,018 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-10-11 00:25:59,164 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 3, 3, 2, 2, 1] term [2021-10-11 00:25:59,164 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 00:25:59,648 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-10-11 00:25:59,649 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 00:25:59,650 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-10-11 00:25:59,650 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 00:25:59,652 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-10-11 00:25:59,653 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-10-11 00:25:59,655 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-10-11 00:25:59,655 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-10-11 00:25:59,678 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-10-11 00:25:59,679 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 00:25:59,679 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-10-11 00:25:59,680 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 00:25:59,682 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-10-11 00:25:59,683 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-10-11 00:25:59,685 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-10-11 00:25:59,685 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-10-11 00:25:59,890 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-10-11 00:25:59,890 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 00:25:59,891 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-10-11 00:25:59,892 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 00:25:59,894 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-10-11 00:25:59,894 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-10-11 00:25:59,896 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-10-11 00:25:59,897 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-10-11 00:25:59,945 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-10-11 00:25:59,945 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 00:25:59,946 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-10-11 00:25:59,947 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 00:25:59,949 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-10-11 00:25:59,949 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-10-11 00:25:59,952 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-10-11 00:25:59,952 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-10-11 00:26:00,044 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-10-11 00:26:00,045 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 00:26:00,045 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-10-11 00:26:00,046 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 00:26:00,048 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-10-11 00:26:00,049 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-10-11 00:26:00,051 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-10-11 00:26:00,051 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-10-11 00:26:00,077 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-10-11 00:26:00,077 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 00:26:00,078 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-10-11 00:26:00,079 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 00:26:00,081 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-10-11 00:26:00,081 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-10-11 00:26:00,084 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-10-11 00:26:00,084 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-10-11 00:26:00,508 WARN L197 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 53 [2021-10-11 00:26:00,610 WARN L197 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 52 [2021-10-11 00:26:01,168 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 3, 3, 2, 2, 1] term [2021-10-11 00:26:01,168 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 00:26:01,650 WARN L197 SmtUtils]: Spent 275.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 60 [2021-10-11 00:26:02,226 WARN L197 SmtUtils]: Spent 475.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 83 [2021-10-11 00:26:02,423 WARN L197 SmtUtils]: Spent 195.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2021-10-11 00:26:02,662 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-10-11 00:26:02,662 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 00:26:02,663 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-10-11 00:26:02,664 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 00:26:02,666 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-10-11 00:26:02,666 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-10-11 00:26:02,668 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-10-11 00:26:02,669 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-10-11 00:26:02,687 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-10-11 00:26:02,688 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 00:26:02,689 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-10-11 00:26:02,689 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 00:26:02,691 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-10-11 00:26:02,691 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 00:26:02,693 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-10-11 00:26:02,694 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 00:26:03,025 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-10-11 00:26:03,025 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 00:26:03,026 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-10-11 00:26:03,026 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 00:26:03,029 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-10-11 00:26:03,029 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-10-11 00:26:03,032 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-10-11 00:26:03,032 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-10-11 00:26:03,055 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-10-11 00:26:03,055 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 00:26:03,056 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-10-11 00:26:03,057 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 00:26:03,059 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-10-11 00:26:03,059 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 00:26:03,061 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-10-11 00:26:03,062 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 00:26:03,139 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-10-11 00:26:03,140 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 00:26:03,141 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-10-11 00:26:03,141 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 00:26:03,143 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-10-11 00:26:03,143 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 00:26:03,145 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-10-11 00:26:03,146 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 00:26:03,166 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-10-11 00:26:03,167 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 00:26:03,168 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-10-11 00:26:03,168 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 00:26:03,170 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-10-11 00:26:03,171 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-10-11 00:26:03,173 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-10-11 00:26:03,173 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-10-11 00:26:03,310 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-10-11 00:26:03,311 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 00:26:03,312 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-10-11 00:26:03,312 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 00:26:03,315 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-10-11 00:26:03,315 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 00:26:03,318 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-10-11 00:26:03,318 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 00:26:03,345 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-10-11 00:26:03,346 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 00:26:03,347 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-10-11 00:26:03,347 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 00:26:03,350 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-10-11 00:26:03,350 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-10-11 00:26:03,353 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-10-11 00:26:03,354 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-10-11 00:26:03,596 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-10-11 00:26:03,596 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 00:26:03,605 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2021-10-11 00:26:03,605 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-10-11 00:26:03,607 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2021-10-11 00:26:03,608 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-10-11 00:26:03,609 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2021-10-11 00:26:03,610 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-10-11 00:26:03,612 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 5, 3, 4, 3, 4, 3, 2, 1] term [2021-10-11 00:26:03,612 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 00:26:03,613 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 5, 3, 4, 3, 4, 3, 2, 1] term [2021-10-11 00:26:03,614 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 00:26:03,615 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 5, 3, 4, 3, 4, 3, 2, 1] term [2021-10-11 00:26:03,616 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 00:26:03,671 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 2, 1] term [2021-10-11 00:26:03,672 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2021-10-11 00:26:03,674 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 7, 2, 4, 3, 4, 3, 2, 1] term [2021-10-11 00:26:03,674 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 00:26:03,712 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-10-11 00:26:03,712 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 00:26:03,713 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-10-11 00:26:03,713 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 00:26:03,715 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-10-11 00:26:03,715 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 00:26:03,716 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-10-11 00:26:03,717 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 00:26:03,734 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-10-11 00:26:03,735 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 00:26:03,736 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-10-11 00:26:03,736 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 00:26:03,738 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-10-11 00:26:03,738 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-10-11 00:26:03,740 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-10-11 00:26:03,740 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-10-11 00:26:03,888 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-10-11 00:26:03,888 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 00:26:03,889 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-10-11 00:26:03,890 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 00:26:03,891 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-10-11 00:26:03,892 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-10-11 00:26:03,894 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-10-11 00:26:03,894 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-10-11 00:26:03,913 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-10-11 00:26:03,913 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 00:26:03,914 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-10-11 00:26:03,914 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 00:26:03,915 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-10-11 00:26:03,916 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 00:26:03,918 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-10-11 00:26:03,918 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 00:26:03,968 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 2, 1] term [2021-10-11 00:26:03,969 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2021-10-11 00:26:03,971 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 7, 2, 4, 3, 4, 3, 2, 1] term [2021-10-11 00:26:03,971 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 00:26:04,054 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-10-11 00:26:04,054 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 00:26:04,056 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2021-10-11 00:26:04,057 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-10-11 00:26:04,058 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2021-10-11 00:26:04,058 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-10-11 00:26:04,060 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2021-10-11 00:26:04,060 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-10-11 00:26:04,062 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 5, 3, 4, 3, 4, 3, 2, 1] term [2021-10-11 00:26:04,062 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 00:26:04,064 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 5, 3, 4, 3, 4, 3, 2, 1] term [2021-10-11 00:26:04,065 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 00:26:04,066 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 5, 3, 4, 3, 4, 3, 2, 1] term [2021-10-11 00:26:04,066 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 00:26:05,419 WARN L197 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 68 [2021-10-11 00:26:05,620 WARN L197 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 68 [2021-10-11 00:26:06,248 WARN L197 SmtUtils]: Spent 498.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 118 [2021-10-11 00:26:06,456 WARN L197 SmtUtils]: Spent 207.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2021-10-11 00:26:06,843 WARN L197 SmtUtils]: Spent 386.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 118 [2021-10-11 00:26:07,034 WARN L197 SmtUtils]: Spent 189.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2021-10-11 00:26:07,098 INFO L131 LiptonReduction]: Checked pairs total: 5400 [2021-10-11 00:26:07,098 INFO L133 LiptonReduction]: Total number of compositions: 86 [2021-10-11 00:26:07,104 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 37 places, 27 transitions, 69 flow [2021-10-11 00:26:07,164 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 974 states. [2021-10-11 00:26:07,166 INFO L276 IsEmpty]: Start isEmpty. Operand 974 states. [2021-10-11 00:26:07,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2021-10-11 00:26:07,172 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 00:26:07,172 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1] [2021-10-11 00:26:07,173 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 00:26:07,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 00:26:07,179 INFO L82 PathProgramCache]: Analyzing trace with hash 1071712, now seen corresponding path program 1 times [2021-10-11 00:26:07,189 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-11 00:26:07,190 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1816087609] [2021-10-11 00:26:07,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 00:26:07,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 00:26:07,506 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 00:26:07,506 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1816087609] [2021-10-11 00:26:07,507 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 00:26:07,508 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-10-11 00:26:07,508 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1354041906] [2021-10-11 00:26:07,513 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-10-11 00:26:07,513 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-11 00:26:07,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-11 00:26:07,529 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-11 00:26:07,531 INFO L87 Difference]: Start difference. First operand 974 states. Second operand 3 states. [2021-10-11 00:26:07,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 00:26:07,658 INFO L93 Difference]: Finished difference Result 812 states and 2575 transitions. [2021-10-11 00:26:07,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-11 00:26:07,660 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2021-10-11 00:26:07,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 00:26:07,699 INFO L225 Difference]: With dead ends: 812 [2021-10-11 00:26:07,699 INFO L226 Difference]: Without dead ends: 662 [2021-10-11 00:26:07,701 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-11 00:26:07,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 662 states. [2021-10-11 00:26:07,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 662 to 662. [2021-10-11 00:26:07,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 662 states. [2021-10-11 00:26:07,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 662 states to 662 states and 2060 transitions. [2021-10-11 00:26:07,845 INFO L78 Accepts]: Start accepts. Automaton has 662 states and 2060 transitions. Word has length 3 [2021-10-11 00:26:07,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 00:26:07,846 INFO L481 AbstractCegarLoop]: Abstraction has 662 states and 2060 transitions. [2021-10-11 00:26:07,846 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-10-11 00:26:07,846 INFO L276 IsEmpty]: Start isEmpty. Operand 662 states and 2060 transitions. [2021-10-11 00:26:07,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-10-11 00:26:07,848 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 00:26:07,848 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 00:26:07,849 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-10-11 00:26:07,849 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 00:26:07,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 00:26:07,853 INFO L82 PathProgramCache]: Analyzing trace with hash 194674645, now seen corresponding path program 1 times [2021-10-11 00:26:07,853 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-11 00:26:07,853 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2027173774] [2021-10-11 00:26:07,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 00:26:07,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 00:26:07,982 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 00:26:07,982 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2027173774] [2021-10-11 00:26:07,982 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 00:26:07,982 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-10-11 00:26:07,983 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [832617193] [2021-10-11 00:26:07,984 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-10-11 00:26:07,984 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-11 00:26:07,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-11 00:26:07,985 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-11 00:26:07,985 INFO L87 Difference]: Start difference. First operand 662 states and 2060 transitions. Second operand 3 states. [2021-10-11 00:26:08,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 00:26:08,011 INFO L93 Difference]: Finished difference Result 654 states and 2028 transitions. [2021-10-11 00:26:08,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-11 00:26:08,012 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2021-10-11 00:26:08,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 00:26:08,019 INFO L225 Difference]: With dead ends: 654 [2021-10-11 00:26:08,020 INFO L226 Difference]: Without dead ends: 654 [2021-10-11 00:26:08,020 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-11 00:26:08,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 654 states. [2021-10-11 00:26:08,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 654 to 654. [2021-10-11 00:26:08,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 654 states. [2021-10-11 00:26:08,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 654 states to 654 states and 2028 transitions. [2021-10-11 00:26:08,050 INFO L78 Accepts]: Start accepts. Automaton has 654 states and 2028 transitions. Word has length 9 [2021-10-11 00:26:08,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 00:26:08,051 INFO L481 AbstractCegarLoop]: Abstraction has 654 states and 2028 transitions. [2021-10-11 00:26:08,051 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-10-11 00:26:08,051 INFO L276 IsEmpty]: Start isEmpty. Operand 654 states and 2028 transitions. [2021-10-11 00:26:08,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-10-11 00:26:08,055 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 00:26:08,056 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 00:26:08,056 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-10-11 00:26:08,056 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 00:26:08,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 00:26:08,057 INFO L82 PathProgramCache]: Analyzing trace with hash -1382608846, now seen corresponding path program 1 times [2021-10-11 00:26:08,057 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-11 00:26:08,057 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1298964911] [2021-10-11 00:26:08,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 00:26:08,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 00:26:08,232 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 00:26:08,232 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1298964911] [2021-10-11 00:26:08,233 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 00:26:08,233 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-11 00:26:08,233 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [966831771] [2021-10-11 00:26:08,233 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-10-11 00:26:08,233 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-11 00:26:08,234 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-11 00:26:08,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2021-10-11 00:26:08,234 INFO L87 Difference]: Start difference. First operand 654 states and 2028 transitions. Second operand 6 states. [2021-10-11 00:26:08,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 00:26:08,319 INFO L93 Difference]: Finished difference Result 644 states and 1976 transitions. [2021-10-11 00:26:08,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-11 00:26:08,320 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 11 [2021-10-11 00:26:08,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 00:26:08,326 INFO L225 Difference]: With dead ends: 644 [2021-10-11 00:26:08,327 INFO L226 Difference]: Without dead ends: 644 [2021-10-11 00:26:08,327 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2021-10-11 00:26:08,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 644 states. [2021-10-11 00:26:08,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 644 to 612. [2021-10-11 00:26:08,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 612 states. [2021-10-11 00:26:08,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 612 states to 612 states and 1880 transitions. [2021-10-11 00:26:08,354 INFO L78 Accepts]: Start accepts. Automaton has 612 states and 1880 transitions. Word has length 11 [2021-10-11 00:26:08,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 00:26:08,355 INFO L481 AbstractCegarLoop]: Abstraction has 612 states and 1880 transitions. [2021-10-11 00:26:08,355 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2021-10-11 00:26:08,355 INFO L276 IsEmpty]: Start isEmpty. Operand 612 states and 1880 transitions. [2021-10-11 00:26:08,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-10-11 00:26:08,361 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 00:26:08,361 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 00:26:08,362 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-10-11 00:26:08,362 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 00:26:08,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 00:26:08,363 INFO L82 PathProgramCache]: Analyzing trace with hash -1896246503, now seen corresponding path program 1 times [2021-10-11 00:26:08,363 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-11 00:26:08,363 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [326141138] [2021-10-11 00:26:08,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 00:26:08,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 00:26:08,461 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 00:26:08,462 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [326141138] [2021-10-11 00:26:08,462 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 00:26:08,462 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-11 00:26:08,462 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [695721645] [2021-10-11 00:26:08,463 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-10-11 00:26:08,463 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-11 00:26:08,463 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-11 00:26:08,463 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-11 00:26:08,464 INFO L87 Difference]: Start difference. First operand 612 states and 1880 transitions. Second operand 4 states. [2021-10-11 00:26:08,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 00:26:08,506 INFO L93 Difference]: Finished difference Result 554 states and 1493 transitions. [2021-10-11 00:26:08,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-11 00:26:08,507 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2021-10-11 00:26:08,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 00:26:08,510 INFO L225 Difference]: With dead ends: 554 [2021-10-11 00:26:08,510 INFO L226 Difference]: Without dead ends: 404 [2021-10-11 00:26:08,511 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-11 00:26:08,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 404 states. [2021-10-11 00:26:08,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 404 to 404. [2021-10-11 00:26:08,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 404 states. [2021-10-11 00:26:08,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 404 states to 404 states and 1048 transitions. [2021-10-11 00:26:08,524 INFO L78 Accepts]: Start accepts. Automaton has 404 states and 1048 transitions. Word has length 11 [2021-10-11 00:26:08,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 00:26:08,525 INFO L481 AbstractCegarLoop]: Abstraction has 404 states and 1048 transitions. [2021-10-11 00:26:08,525 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-10-11 00:26:08,525 INFO L276 IsEmpty]: Start isEmpty. Operand 404 states and 1048 transitions. [2021-10-11 00:26:08,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-10-11 00:26:08,526 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 00:26:08,526 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 00:26:08,526 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-10-11 00:26:08,526 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 00:26:08,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 00:26:08,527 INFO L82 PathProgramCache]: Analyzing trace with hash -1528638831, now seen corresponding path program 1 times [2021-10-11 00:26:08,527 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-11 00:26:08,527 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1478713870] [2021-10-11 00:26:08,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 00:26:08,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 00:26:08,709 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 00:26:08,710 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1478713870] [2021-10-11 00:26:08,710 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 00:26:08,710 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-11 00:26:08,710 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [539869826] [2021-10-11 00:26:08,710 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-10-11 00:26:08,711 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-11 00:26:08,711 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-11 00:26:08,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-10-11 00:26:08,711 INFO L87 Difference]: Start difference. First operand 404 states and 1048 transitions. Second operand 5 states. [2021-10-11 00:26:08,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 00:26:08,763 INFO L93 Difference]: Finished difference Result 322 states and 773 transitions. [2021-10-11 00:26:08,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-11 00:26:08,764 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2021-10-11 00:26:08,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 00:26:08,766 INFO L225 Difference]: With dead ends: 322 [2021-10-11 00:26:08,766 INFO L226 Difference]: Without dead ends: 252 [2021-10-11 00:26:08,766 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-10-11 00:26:08,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2021-10-11 00:26:08,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 252. [2021-10-11 00:26:08,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 252 states. [2021-10-11 00:26:08,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 592 transitions. [2021-10-11 00:26:08,774 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 592 transitions. Word has length 14 [2021-10-11 00:26:08,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 00:26:08,775 INFO L481 AbstractCegarLoop]: Abstraction has 252 states and 592 transitions. [2021-10-11 00:26:08,775 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-10-11 00:26:08,775 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 592 transitions. [2021-10-11 00:26:08,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-10-11 00:26:08,776 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 00:26:08,776 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 00:26:08,776 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-10-11 00:26:08,776 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 00:26:08,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 00:26:08,776 INFO L82 PathProgramCache]: Analyzing trace with hash -547931013, now seen corresponding path program 1 times [2021-10-11 00:26:08,777 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-11 00:26:08,777 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1901656097] [2021-10-11 00:26:08,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 00:26:08,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 00:26:08,955 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 00:26:08,956 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1901656097] [2021-10-11 00:26:08,956 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 00:26:08,956 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-11 00:26:08,956 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [910880868] [2021-10-11 00:26:08,956 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-10-11 00:26:08,957 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-11 00:26:08,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-11 00:26:08,957 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-10-11 00:26:08,957 INFO L87 Difference]: Start difference. First operand 252 states and 592 transitions. Second operand 6 states. [2021-10-11 00:26:09,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 00:26:09,183 INFO L93 Difference]: Finished difference Result 400 states and 900 transitions. [2021-10-11 00:26:09,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-10-11 00:26:09,184 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2021-10-11 00:26:09,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 00:26:09,186 INFO L225 Difference]: With dead ends: 400 [2021-10-11 00:26:09,186 INFO L226 Difference]: Without dead ends: 349 [2021-10-11 00:26:09,187 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2021-10-11 00:26:09,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2021-10-11 00:26:09,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 295. [2021-10-11 00:26:09,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 295 states. [2021-10-11 00:26:09,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 680 transitions. [2021-10-11 00:26:09,197 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 680 transitions. Word has length 18 [2021-10-11 00:26:09,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 00:26:09,197 INFO L481 AbstractCegarLoop]: Abstraction has 295 states and 680 transitions. [2021-10-11 00:26:09,198 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2021-10-11 00:26:09,198 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 680 transitions. [2021-10-11 00:26:09,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-10-11 00:26:09,199 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 00:26:09,199 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 00:26:09,199 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-10-11 00:26:09,199 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 00:26:09,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 00:26:09,199 INFO L82 PathProgramCache]: Analyzing trace with hash -1014886493, now seen corresponding path program 2 times [2021-10-11 00:26:09,200 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-11 00:26:09,200 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [647289650] [2021-10-11 00:26:09,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 00:26:09,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 00:26:09,357 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 00:26:09,358 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [647289650] [2021-10-11 00:26:09,358 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 00:26:09,358 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-11 00:26:09,358 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1856612668] [2021-10-11 00:26:09,359 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-10-11 00:26:09,359 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-11 00:26:09,359 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-11 00:26:09,360 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-10-11 00:26:09,361 INFO L87 Difference]: Start difference. First operand 295 states and 680 transitions. Second operand 6 states. [2021-10-11 00:26:09,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 00:26:09,474 INFO L93 Difference]: Finished difference Result 272 states and 629 transitions. [2021-10-11 00:26:09,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-10-11 00:26:09,475 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2021-10-11 00:26:09,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 00:26:09,477 INFO L225 Difference]: With dead ends: 272 [2021-10-11 00:26:09,477 INFO L226 Difference]: Without dead ends: 235 [2021-10-11 00:26:09,478 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2021-10-11 00:26:09,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2021-10-11 00:26:09,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 235. [2021-10-11 00:26:09,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 235 states. [2021-10-11 00:26:09,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 552 transitions. [2021-10-11 00:26:09,486 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 552 transitions. Word has length 18 [2021-10-11 00:26:09,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 00:26:09,487 INFO L481 AbstractCegarLoop]: Abstraction has 235 states and 552 transitions. [2021-10-11 00:26:09,487 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2021-10-11 00:26:09,487 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 552 transitions. [2021-10-11 00:26:09,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-10-11 00:26:09,488 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 00:26:09,488 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 00:26:09,488 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-10-11 00:26:09,488 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 00:26:09,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 00:26:09,489 INFO L82 PathProgramCache]: Analyzing trace with hash 1596265496, now seen corresponding path program 1 times [2021-10-11 00:26:09,489 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-11 00:26:09,489 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [482832508] [2021-10-11 00:26:09,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 00:26:09,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 00:26:09,738 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 00:26:09,739 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [482832508] [2021-10-11 00:26:09,739 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 00:26:09,739 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-11 00:26:09,740 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [507199681] [2021-10-11 00:26:09,740 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-10-11 00:26:09,742 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-11 00:26:09,742 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-10-11 00:26:09,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-10-11 00:26:09,746 INFO L87 Difference]: Start difference. First operand 235 states and 552 transitions. Second operand 7 states. [2021-10-11 00:26:09,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 00:26:09,953 INFO L93 Difference]: Finished difference Result 330 states and 749 transitions. [2021-10-11 00:26:09,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-10-11 00:26:09,954 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 22 [2021-10-11 00:26:09,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 00:26:09,956 INFO L225 Difference]: With dead ends: 330 [2021-10-11 00:26:09,957 INFO L226 Difference]: Without dead ends: 296 [2021-10-11 00:26:09,957 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2021-10-11 00:26:09,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2021-10-11 00:26:09,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 215. [2021-10-11 00:26:09,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 215 states. [2021-10-11 00:26:09,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 502 transitions. [2021-10-11 00:26:09,966 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 502 transitions. Word has length 22 [2021-10-11 00:26:09,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 00:26:09,966 INFO L481 AbstractCegarLoop]: Abstraction has 215 states and 502 transitions. [2021-10-11 00:26:09,966 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2021-10-11 00:26:09,967 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 502 transitions. [2021-10-11 00:26:09,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-10-11 00:26:09,968 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 00:26:09,968 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 00:26:09,968 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-10-11 00:26:09,968 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 00:26:09,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 00:26:09,969 INFO L82 PathProgramCache]: Analyzing trace with hash 1129310016, now seen corresponding path program 2 times [2021-10-11 00:26:09,969 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-11 00:26:09,969 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [40734996] [2021-10-11 00:26:09,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 00:26:10,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-11 00:26:10,040 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-11 00:26:10,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-11 00:26:10,095 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-11 00:26:10,130 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-11 00:26:10,131 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2021-10-11 00:26:10,131 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-10-11 00:26:10,223 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 12:26:10 BasicIcfg [2021-10-11 00:26:10,223 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-10-11 00:26:10,224 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-10-11 00:26:10,224 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-10-11 00:26:10,224 INFO L275 PluginConnector]: Witness Printer initialized [2021-10-11 00:26:10,225 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 12:25:58" (3/4) ... [2021-10-11 00:26:10,227 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-10-11 00:26:10,359 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8060d70-e723-4559-995a-ad86f122134e/bin/uautomizer-Z5i5R5N3CC/witness.graphml [2021-10-11 00:26:10,365 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-10-11 00:26:10,366 INFO L168 Benchmark]: Toolchain (without parser) took 15335.13 ms. Allocated memory was 132.1 MB in the beginning and 331.4 MB in the end (delta: 199.2 MB). Free memory was 92.7 MB in the beginning and 178.8 MB in the end (delta: -86.1 MB). Peak memory consumption was 111.9 MB. Max. memory is 16.1 GB. [2021-10-11 00:26:10,367 INFO L168 Benchmark]: CDTParser took 0.30 ms. Allocated memory is still 132.1 MB. Free memory is still 111.0 MB. There was no memory consumed. Max. memory is 16.1 GB. [2021-10-11 00:26:10,368 INFO L168 Benchmark]: CACSL2BoogieTranslator took 747.69 ms. Allocated memory is still 132.1 MB. Free memory was 92.4 MB in the beginning and 82.3 MB in the end (delta: 10.2 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. [2021-10-11 00:26:10,368 INFO L168 Benchmark]: Boogie Procedure Inliner took 88.27 ms. Allocated memory is still 132.1 MB. Free memory was 81.8 MB in the beginning and 79.7 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-10-11 00:26:10,369 INFO L168 Benchmark]: Boogie Preprocessor took 69.08 ms. Allocated memory is still 132.1 MB. Free memory was 79.7 MB in the beginning and 77.2 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-10-11 00:26:10,369 INFO L168 Benchmark]: RCFGBuilder took 2330.32 ms. Allocated memory was 132.1 MB in the beginning and 159.4 MB in the end (delta: 27.3 MB). Free memory was 77.2 MB in the beginning and 73.9 MB in the end (delta: 3.3 MB). Peak memory consumption was 50.1 MB. Max. memory is 16.1 GB. [2021-10-11 00:26:10,370 INFO L168 Benchmark]: TraceAbstraction took 11947.68 ms. Allocated memory was 159.4 MB in the beginning and 331.4 MB in the end (delta: 172.0 MB). Free memory was 72.9 MB in the beginning and 195.6 MB in the end (delta: -122.7 MB). Peak memory consumption was 49.3 MB. Max. memory is 16.1 GB. [2021-10-11 00:26:10,370 INFO L168 Benchmark]: Witness Printer took 141.20 ms. Allocated memory is still 331.4 MB. Free memory was 195.6 MB in the beginning and 178.8 MB in the end (delta: 16.8 MB). Peak memory consumption was 16.8 MB. Max. memory is 16.1 GB. [2021-10-11 00:26:10,373 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.30 ms. Allocated memory is still 132.1 MB. Free memory is still 111.0 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 747.69 ms. Allocated memory is still 132.1 MB. Free memory was 92.4 MB in the beginning and 82.3 MB in the end (delta: 10.2 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 88.27 ms. Allocated memory is still 132.1 MB. Free memory was 81.8 MB in the beginning and 79.7 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 69.08 ms. Allocated memory is still 132.1 MB. Free memory was 79.7 MB in the beginning and 77.2 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 2330.32 ms. Allocated memory was 132.1 MB in the beginning and 159.4 MB in the end (delta: 27.3 MB). Free memory was 77.2 MB in the beginning and 73.9 MB in the end (delta: 3.3 MB). Peak memory consumption was 50.1 MB. Max. memory is 16.1 GB. * TraceAbstraction took 11947.68 ms. Allocated memory was 159.4 MB in the beginning and 331.4 MB in the end (delta: 172.0 MB). Free memory was 72.9 MB in the beginning and 195.6 MB in the end (delta: -122.7 MB). Peak memory consumption was 49.3 MB. Max. memory is 16.1 GB. * Witness Printer took 141.20 ms. Allocated memory is still 331.4 MB. Free memory was 195.6 MB in the beginning and 178.8 MB in the end (delta: 16.8 MB). Peak memory consumption was 16.8 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 1122 VarBasedMoverChecksPositive, 52 VarBasedMoverChecksNegative, 4 SemBasedMoverChecksPositive, 48 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.8s, 101 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 8.6s, 109 PlacesBefore, 37 PlacesAfterwards, 101 TransitionsBefore, 27 TransitionsAfterwards, 1778 CoEnabledTransitionPairs, 7 FixpointIterations, 38 TrivialSequentialCompositions, 40 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 6 ConcurrentYvCompositions, 2 ChoiceCompositions, 86 TotalNumberOfCompositions, 5400 MoverChecksTotal - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p0_EAX = 0; [L713] 0 int __unbuffered_p1_EAX = 0; [L715] 0 int __unbuffered_p2_EAX = 0; [L717] 0 int __unbuffered_p2_EBX = 0; [L718] 0 _Bool main$tmp_guard0; [L719] 0 _Bool main$tmp_guard1; [L721] 0 int x = 0; [L723] 0 int y = 0; [L725] 0 int z = 0; [L726] 0 _Bool z$flush_delayed; [L727] 0 int z$mem_tmp; [L728] 0 _Bool z$r_buff0_thd0; [L729] 0 _Bool z$r_buff0_thd1; [L730] 0 _Bool z$r_buff0_thd2; [L731] 0 _Bool z$r_buff0_thd3; [L732] 0 _Bool z$r_buff1_thd0; [L733] 0 _Bool z$r_buff1_thd1; [L734] 0 _Bool z$r_buff1_thd2; [L735] 0 _Bool z$r_buff1_thd3; [L736] 0 _Bool z$read_delayed; [L737] 0 int *z$read_delayed_var; [L738] 0 int z$w_buff0; [L739] 0 _Bool z$w_buff0_used; [L740] 0 int z$w_buff1; [L741] 0 _Bool z$w_buff1_used; [L742] 0 _Bool weak$$choice0; [L743] 0 _Bool weak$$choice2; [L840] 0 pthread_t t409; [L841] FCALL, FORK 0 pthread_create(&t409, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L747] 1 z$w_buff1 = z$w_buff0 [L748] 1 z$w_buff0 = 1 [L749] 1 z$w_buff1_used = z$w_buff0_used [L750] 1 z$w_buff0_used = (_Bool)1 [L18] COND FALSE 1 !(!expression) [L752] 1 z$r_buff1_thd0 = z$r_buff0_thd0 [L753] 1 z$r_buff1_thd1 = z$r_buff0_thd1 [L754] 1 z$r_buff1_thd2 = z$r_buff0_thd2 [L755] 1 z$r_buff1_thd3 = z$r_buff0_thd3 [L756] 1 z$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L759] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L842] 0 pthread_t t410; [L843] FCALL, FORK 0 pthread_create(&t410, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L776] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L779] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L782] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L782] EXPR 2 z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z [L782] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L782] 2 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L783] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L783] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L784] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L784] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L785] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L785] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L786] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 [L786] 2 z$r_buff1_thd2 = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 [L844] 0 pthread_t t411; [L845] FCALL, FORK 0 pthread_create(&t411, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L789] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L791] 2 return 0; [L796] 3 y = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_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=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L799] 3 __unbuffered_p2_EAX = y VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_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=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L802] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L803] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L804] 3 z$flush_delayed = weak$$choice2 [L805] 3 z$mem_tmp = z [L806] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L806] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L807] EXPR 3 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L807] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0) [L807] EXPR 3 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L807] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L808] EXPR 3 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L808] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1) [L808] EXPR 3 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L808] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L809] EXPR 3 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L809] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used) [L809] EXPR 3 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L809] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L810] EXPR 3 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L810] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0) [L810] EXPR 3 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L810] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L811] EXPR 3 weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L811] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3) [L811] EXPR 3 weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L811] 3 z$r_buff0_thd3 = weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L812] EXPR 3 weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L812] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0) [L812] EXPR 3 weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L812] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L813] 3 __unbuffered_p2_EBX = z [L814] EXPR 3 z$flush_delayed ? z$mem_tmp : z [L814] 3 z = z$flush_delayed ? z$mem_tmp : z [L815] 3 z$flush_delayed = (_Bool)0 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_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, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L818] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L818] EXPR 3 z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z [L818] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L818] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L819] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L819] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L820] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L820] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L821] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L821] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L822] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L822] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L825] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L827] 3 return 0; [L762] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L762] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L763] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L763] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L764] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L764] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L765] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L765] 1 z$r_buff0_thd1 = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L766] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 [L766] 1 z$r_buff1_thd1 = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 [L769] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L771] 1 return 0; [L847] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L3] COND FALSE 0 !(!cond) [L851] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L851] EXPR 0 z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z [L851] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L851] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L852] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L852] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L853] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L853] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L854] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L854] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L855] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L855] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L858] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 100 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 11.6s, OverallIterations: 9, TraceHistogramMax: 1, AutomataDifference: 0.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 8.6s, HoareTripleCheckerStatistics: 247 SDtfs, 272 SDslu, 479 SDs, 0 SdLazy, 247 SolverSat, 38 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 35 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=974occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 8 MinimizatonAttempts, 167 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 128 NumberOfCodeBlocks, 128 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 98 ConstructedInterpolants, 0 QuantifiedInterpolants, 12641 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...