./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix015_power.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a4ecdabc Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_f05706db-73c8-433e-a079-7663f72285ee/bin/uautomizer/data/config -Xmx15G -Xms4m -jar /tmp/vcloud-vcloud-master/worker/run_dir_f05706db-73c8-433e-a079-7663f72285ee/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_f05706db-73c8-433e-a079-7663f72285ee/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_f05706db-73c8-433e-a079-7663f72285ee/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix015_power.opt.i -s /tmp/vcloud-vcloud-master/worker/run_dir_f05706db-73c8-433e-a079-7663f72285ee/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_f05706db-73c8-433e-a079-7663f72285ee/bin/uautomizer --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 e86e0a386a2719c1be9b8822cfa8394d213913e5 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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-a4ecdab [2020-11-30 00:35:40,753 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-30 00:35:40,755 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-30 00:35:40,795 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-30 00:35:40,795 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-30 00:35:40,797 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-30 00:35:40,799 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-30 00:35:40,801 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-30 00:35:40,804 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-30 00:35:40,805 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-30 00:35:40,807 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-30 00:35:40,808 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-30 00:35:40,809 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-30 00:35:40,811 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-30 00:35:40,813 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-30 00:35:40,815 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-30 00:35:40,818 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-30 00:35:40,834 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-30 00:35:40,836 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-30 00:35:40,841 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-30 00:35:40,844 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-30 00:35:40,847 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-30 00:35:40,848 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-30 00:35:40,850 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-30 00:35:40,853 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-30 00:35:40,854 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-30 00:35:40,854 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-30 00:35:40,855 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-30 00:35:40,856 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-30 00:35:40,857 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-30 00:35:40,858 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-30 00:35:40,859 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-30 00:35:40,860 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-30 00:35:40,861 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-30 00:35:40,862 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-30 00:35:40,863 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-30 00:35:40,864 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-30 00:35:40,864 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-30 00:35:40,865 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-30 00:35:40,866 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-30 00:35:40,867 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-30 00:35:40,868 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_f05706db-73c8-433e-a079-7663f72285ee/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2020-11-30 00:35:40,891 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-30 00:35:40,892 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-30 00:35:40,893 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-11-30 00:35:40,894 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-11-30 00:35:40,894 INFO L138 SettingsManager]: * Use SBE=true [2020-11-30 00:35:40,895 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-30 00:35:40,895 INFO L138 SettingsManager]: * sizeof long=4 [2020-11-30 00:35:40,895 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-11-30 00:35:40,896 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-11-30 00:35:40,896 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-30 00:35:40,896 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-11-30 00:35:40,897 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-11-30 00:35:40,897 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-11-30 00:35:40,898 INFO L138 SettingsManager]: * sizeof long double=12 [2020-11-30 00:35:40,898 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-11-30 00:35:40,898 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-30 00:35:40,899 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-11-30 00:35:40,899 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-30 00:35:40,899 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-11-30 00:35:40,900 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-11-30 00:35:40,900 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-11-30 00:35:40,901 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-30 00:35:40,901 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-30 00:35:40,901 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-11-30 00:35:40,902 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-11-30 00:35:40,902 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-11-30 00:35:40,903 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-11-30 00:35:40,903 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-11-30 00:35:40,903 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-11-30 00:35:40,904 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-vcloud-master/worker/run_dir_f05706db-73c8-433e-a079-7663f72285ee/bin/uautomizer/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-vcloud-master/worker/run_dir_f05706db-73c8-433e-a079-7663f72285ee/bin/uautomizer 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 -> e86e0a386a2719c1be9b8822cfa8394d213913e5 [2020-11-30 00:35:41,134 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-30 00:35:41,172 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-30 00:35:41,177 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-30 00:35:41,179 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-30 00:35:41,181 INFO L275 PluginConnector]: CDTParser initialized [2020-11-30 00:35:41,183 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_f05706db-73c8-433e-a079-7663f72285ee/bin/uautomizer/../../sv-benchmarks/c/pthread-wmm/mix015_power.opt.i [2020-11-30 00:35:41,262 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_f05706db-73c8-433e-a079-7663f72285ee/bin/uautomizer/data/9b6f95b31/1caa641ec74a489391f96b1e7b1bcacf/FLAG21f84a925 [2020-11-30 00:35:41,845 INFO L306 CDTParser]: Found 1 translation units. [2020-11-30 00:35:41,845 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_f05706db-73c8-433e-a079-7663f72285ee/sv-benchmarks/c/pthread-wmm/mix015_power.opt.i [2020-11-30 00:35:41,872 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_f05706db-73c8-433e-a079-7663f72285ee/bin/uautomizer/data/9b6f95b31/1caa641ec74a489391f96b1e7b1bcacf/FLAG21f84a925 [2020-11-30 00:35:42,096 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_f05706db-73c8-433e-a079-7663f72285ee/bin/uautomizer/data/9b6f95b31/1caa641ec74a489391f96b1e7b1bcacf [2020-11-30 00:35:42,098 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-30 00:35:42,100 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-11-30 00:35:42,104 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-30 00:35:42,105 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-30 00:35:42,108 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-30 00:35:42,110 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.11 12:35:42" (1/1) ... [2020-11-30 00:35:42,112 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@26d494a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:35:42, skipping insertion in model container [2020-11-30 00:35:42,112 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.11 12:35:42" (1/1) ... [2020-11-30 00:35:42,119 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-11-30 00:35:42,180 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-30 00:35:42,735 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-30 00:35:42,745 INFO L203 MainTranslator]: Completed pre-run [2020-11-30 00:35:42,811 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-30 00:35:42,905 INFO L208 MainTranslator]: Completed translation [2020-11-30 00:35:42,906 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:35:42 WrapperNode [2020-11-30 00:35:42,906 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-30 00:35:42,914 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-11-30 00:35:42,914 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-11-30 00:35:42,914 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-11-30 00:35:42,926 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:35:42" (1/1) ... [2020-11-30 00:35:42,951 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:35:42" (1/1) ... [2020-11-30 00:35:42,986 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-11-30 00:35:42,986 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-11-30 00:35:42,987 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-11-30 00:35:42,987 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-11-30 00:35:42,996 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:35:42" (1/1) ... [2020-11-30 00:35:42,996 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:35:42" (1/1) ... [2020-11-30 00:35:43,002 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:35:42" (1/1) ... [2020-11-30 00:35:43,003 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:35:42" (1/1) ... [2020-11-30 00:35:43,019 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:35:42" (1/1) ... [2020-11-30 00:35:43,025 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:35:42" (1/1) ... [2020-11-30 00:35:43,030 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:35:42" (1/1) ... [2020-11-30 00:35:43,036 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-11-30 00:35:43,037 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-11-30 00:35:43,037 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-11-30 00:35:43,037 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-11-30 00:35:43,038 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:35:42" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f05706db-73c8-433e-a079-7663f72285ee/bin/uautomizer/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 [2020-11-30 00:35:43,112 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-11-30 00:35:43,112 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-11-30 00:35:43,112 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-11-30 00:35:43,112 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-11-30 00:35:43,112 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-11-30 00:35:43,112 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-11-30 00:35:43,113 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-11-30 00:35:43,113 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-11-30 00:35:43,113 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-11-30 00:35:43,113 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-11-30 00:35:43,113 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-11-30 00:35:43,113 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-11-30 00:35:43,113 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-11-30 00:35:43,113 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-11-30 00:35:43,120 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-11-30 00:35:46,124 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-11-30 00:35:46,124 INFO L298 CfgBuilder]: Removed 14 assume(true) statements. [2020-11-30 00:35:46,126 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 12:35:46 BoogieIcfgContainer [2020-11-30 00:35:46,127 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-11-30 00:35:46,128 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-11-30 00:35:46,128 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-11-30 00:35:46,133 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-11-30 00:35:46,133 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.11 12:35:42" (1/3) ... [2020-11-30 00:35:46,134 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1858faaf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.11 12:35:46, skipping insertion in model container [2020-11-30 00:35:46,134 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:35:42" (2/3) ... [2020-11-30 00:35:46,135 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1858faaf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.11 12:35:46, skipping insertion in model container [2020-11-30 00:35:46,136 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 12:35:46" (3/3) ... [2020-11-30 00:35:46,137 INFO L111 eAbstractionObserver]: Analyzing ICFG mix015_power.opt.i [2020-11-30 00:35:46,151 WARN L153 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-11-30 00:35:46,151 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-11-30 00:35:46,156 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-11-30 00:35:46,157 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-11-30 00:35:46,210 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:35:46,211 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:35:46,211 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:35:46,211 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:35:46,211 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:35:46,211 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:35:46,212 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:35:46,212 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:35:46,212 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:35:46,212 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:35:46,212 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:35:46,213 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:35:46,213 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:35:46,213 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:35:46,213 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:35:46,213 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:35:46,213 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:35:46,213 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:35:46,214 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:35:46,214 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:35:46,214 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:35:46,214 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:35:46,214 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:35:46,215 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:35:46,215 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:35:46,215 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:35:46,216 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:35:46,216 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:35:46,216 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:35:46,217 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:35:46,217 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:35:46,217 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:35:46,217 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:35:46,218 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:35:46,218 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:35:46,218 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:35:46,218 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:35:46,218 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:35:46,219 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:35:46,219 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:35:46,219 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:35:46,219 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:35:46,220 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:35:46,220 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:35:46,220 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:35:46,220 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:35:46,220 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:35:46,220 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:35:46,223 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:35:46,223 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:35:46,223 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:35:46,223 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:35:46,224 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:35:46,224 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:35:46,224 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:35:46,224 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:35:46,224 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:35:46,224 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:35:46,225 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:35:46,225 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:35:46,225 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:35:46,225 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:35:46,226 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:35:46,226 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:35:46,226 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:35:46,227 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:35:46,227 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:35:46,227 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:35:46,227 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:35:46,227 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:35:46,227 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:35:46,227 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:35:46,228 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:35:46,228 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:35:46,228 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:35:46,228 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:35:46,228 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:35:46,228 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:35:46,229 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:35:46,229 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:35:46,230 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:35:46,230 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:35:46,230 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:35:46,230 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:35:46,230 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:35:46,230 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:35:46,231 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:35:46,231 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:35:46,231 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:35:46,231 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:35:46,231 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:35:46,232 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:35:46,233 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:35:46,235 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:35:46,236 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:35:46,237 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:35:46,237 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:35:46,237 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:35:46,237 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:35:46,237 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:35:46,237 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:35:46,238 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:35:46,240 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:35:46,241 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:35:46,242 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:35:46,247 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:35:46,248 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:35:46,248 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:35:46,248 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:35:46,248 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:35:46,249 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:35:46,251 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:35:46,252 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:35:46,253 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:35:46,253 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:35:46,257 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:35:46,257 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:35:46,258 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:35:46,258 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:35:46,258 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:35:46,258 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:35:46,258 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:35:46,258 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:35:46,258 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:35:46,259 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:35:46,259 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:35:46,259 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:35:46,259 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:35:46,259 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:35:46,259 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:35:46,260 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:35:46,260 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:35:46,260 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:35:46,260 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:35:46,260 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:35:46,260 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:35:46,261 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:35:46,261 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:35:46,261 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:35:46,261 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:35:46,261 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:35:46,261 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:35:46,264 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:35:46,264 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:35:46,264 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:35:46,264 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:35:46,265 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:35:46,265 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:35:46,265 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:35:46,265 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:35:46,265 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:35:46,265 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:35:46,266 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:35:46,266 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:35:46,266 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:35:46,266 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:35:46,266 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:35:46,266 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:35:46,266 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:35:46,267 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:35:46,267 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:35:46,267 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:35:46,267 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:35:46,267 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:35:46,267 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:35:46,268 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:35:46,268 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:35:46,268 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:35:46,268 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:35:46,268 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:35:46,268 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:35:46,269 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:35:46,269 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:35:46,269 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:35:46,269 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:35:46,269 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:35:46,269 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:35:46,269 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:35:46,270 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:35:46,274 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2020-11-30 00:35:46,285 INFO L253 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2020-11-30 00:35:46,317 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-11-30 00:35:46,317 INFO L378 AbstractCegarLoop]: Hoare is true [2020-11-30 00:35:46,318 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-11-30 00:35:46,318 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-11-30 00:35:46,318 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-11-30 00:35:46,318 INFO L382 AbstractCegarLoop]: Difference is false [2020-11-30 00:35:46,318 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-11-30 00:35:46,318 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-11-30 00:35:46,333 INFO L129 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2020-11-30 00:35:46,336 INFO L144 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 114 places, 107 transitions, 229 flow [2020-11-30 00:35:46,339 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 114 places, 107 transitions, 229 flow [2020-11-30 00:35:46,340 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 114 places, 107 transitions, 229 flow [2020-11-30 00:35:46,405 INFO L129 PetriNetUnfolder]: 3/104 cut-off events. [2020-11-30 00:35:46,406 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-11-30 00:35:46,411 INFO L80 FinitePrefix]: Finished finitePrefix Result has 114 conditions, 104 events. 3/104 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 78 event pairs, 0 based on Foata normal form. 0/99 useless extension candidates. Maximal degree in co-relation 66. Up to 2 conditions per place. [2020-11-30 00:35:46,416 INFO L116 LiptonReduction]: Number of co-enabled transitions 1950 [2020-11-30 00:35:46,886 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-11-30 00:35:46,887 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-11-30 00:35:46,891 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-11-30 00:35:46,893 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:35:46,961 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-30 00:35:46,962 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 00:35:46,978 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-11-30 00:35:46,978 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-30 00:35:46,981 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-11-30 00:35:46,981 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-30 00:35:46,983 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-11-30 00:35:46,990 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-30 00:35:46,993 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-11-30 00:35:46,993 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:35:46,995 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-11-30 00:35:46,996 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:35:47,002 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-11-30 00:35:47,003 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:35:47,074 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-30 00:35:47,075 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 00:35:47,076 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-30 00:35:47,076 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 00:35:47,078 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-30 00:35:47,079 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:35:47,081 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-30 00:35:47,082 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:35:47,111 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-30 00:35:47,112 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 00:35:47,113 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-30 00:35:47,113 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 00:35:47,115 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-30 00:35:47,116 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:35:47,118 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-30 00:35:47,118 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:35:47,375 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-11-30 00:35:47,376 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 00:35:47,458 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-11-30 00:35:47,458 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-11-30 00:35:47,461 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-11-30 00:35:47,462 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:35:47,511 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-30 00:35:47,511 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 00:35:47,514 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-11-30 00:35:47,514 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-30 00:35:47,515 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-11-30 00:35:47,516 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-30 00:35:47,517 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-11-30 00:35:47,518 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-30 00:35:47,521 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-11-30 00:35:47,521 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:35:47,523 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-11-30 00:35:47,523 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:35:47,525 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-11-30 00:35:47,526 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:35:47,957 WARN L193 SmtUtils]: Spent 366.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2020-11-30 00:35:48,085 WARN L193 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 53 [2020-11-30 00:35:48,092 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-30 00:35:48,092 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 00:35:48,093 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-30 00:35:48,093 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 00:35:48,095 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-30 00:35:48,096 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:35:48,098 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-30 00:35:48,098 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:35:48,116 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-30 00:35:48,116 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 00:35:48,117 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-30 00:35:48,117 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 00:35:48,119 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-30 00:35:48,120 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:35:48,122 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-30 00:35:48,122 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:35:48,239 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-30 00:35:48,239 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 00:35:48,254 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-11-30 00:35:48,254 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-30 00:35:48,255 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-11-30 00:35:48,256 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-30 00:35:48,257 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-11-30 00:35:48,257 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-30 00:35:48,260 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-11-30 00:35:48,260 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:35:48,261 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-11-30 00:35:48,262 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:35:48,263 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-11-30 00:35:48,264 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:35:48,313 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-11-30 00:35:48,313 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-11-30 00:35:48,316 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-11-30 00:35:48,316 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:35:48,516 WARN L193 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 47 [2020-11-30 00:35:48,932 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-30 00:35:48,933 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 00:35:48,934 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-30 00:35:48,934 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 00:35:48,936 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-30 00:35:48,936 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:35:48,937 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-11-30 00:35:48,938 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:35:48,962 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-30 00:35:48,962 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 00:35:48,963 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-30 00:35:48,963 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 00:35:48,965 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-30 00:35:48,965 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:35:48,967 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-30 00:35:48,967 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:35:49,032 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-30 00:35:49,033 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 00:35:49,035 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-11-30 00:35:49,035 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-30 00:35:49,039 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-11-30 00:35:49,040 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-30 00:35:49,041 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-11-30 00:35:49,041 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-30 00:35:49,043 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-11-30 00:35:49,043 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:35:49,044 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-11-30 00:35:49,045 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:35:49,046 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-11-30 00:35:49,047 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:35:49,091 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-11-30 00:35:49,091 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-11-30 00:35:49,093 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-11-30 00:35:49,093 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 00:35:49,219 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-11-30 00:35:49,220 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-11-30 00:35:49,222 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-11-30 00:35:49,222 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 00:35:49,265 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-30 00:35:49,266 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 00:35:49,268 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-11-30 00:35:49,268 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-30 00:35:49,269 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-11-30 00:35:49,269 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-30 00:35:49,270 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-11-30 00:35:49,271 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-30 00:35:49,273 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-11-30 00:35:49,273 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:35:49,276 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-11-30 00:35:49,276 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:35:49,277 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-11-30 00:35:49,278 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:35:49,475 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-11-30 00:35:49,476 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-11-30 00:35:49,479 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-11-30 00:35:49,479 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 00:35:49,509 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-30 00:35:49,509 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 00:35:49,518 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-11-30 00:35:49,518 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-30 00:35:49,520 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-11-30 00:35:49,520 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-30 00:35:49,521 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-11-30 00:35:49,522 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-30 00:35:49,523 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-11-30 00:35:49,524 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:35:49,525 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-11-30 00:35:49,525 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:35:49,527 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-11-30 00:35:49,532 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:35:49,873 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-11-30 00:35:49,873 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-11-30 00:35:49,875 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-11-30 00:35:49,875 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 00:35:49,911 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-30 00:35:49,911 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 00:35:49,916 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-11-30 00:35:49,916 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-30 00:35:49,918 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-11-30 00:35:49,918 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-30 00:35:49,919 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-11-30 00:35:49,919 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-30 00:35:49,921 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-11-30 00:35:49,921 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:35:49,923 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-11-30 00:35:49,923 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:35:49,924 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-11-30 00:35:49,925 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:35:50,123 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-30 00:35:50,123 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 00:35:50,124 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-30 00:35:50,124 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 00:35:50,125 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-30 00:35:50,126 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:35:50,127 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-11-30 00:35:50,127 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:35:50,145 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-30 00:35:50,145 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 00:35:50,146 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-30 00:35:50,146 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 00:35:50,147 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-30 00:35:50,148 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:35:50,149 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-30 00:35:50,149 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:35:50,190 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-30 00:35:50,190 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 00:35:50,205 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-11-30 00:35:50,206 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-30 00:35:50,207 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-11-30 00:35:50,207 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-30 00:35:50,208 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-11-30 00:35:50,208 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-30 00:35:50,210 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-11-30 00:35:50,211 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:35:50,212 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-11-30 00:35:50,212 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:35:50,213 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-11-30 00:35:50,214 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:35:50,259 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-11-30 00:35:50,260 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-11-30 00:35:50,261 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-11-30 00:35:50,262 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 00:35:50,420 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-30 00:35:50,420 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 00:35:50,421 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-30 00:35:50,421 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 00:35:50,423 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-30 00:35:50,423 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:35:50,425 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-30 00:35:50,425 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:35:50,439 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-30 00:35:50,439 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 00:35:50,440 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-30 00:35:50,441 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 00:35:50,442 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-30 00:35:50,443 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:35:50,444 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-11-30 00:35:50,444 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:35:50,526 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-11-30 00:35:50,526 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:35:50,527 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 4, 4, 3, 3, 2, 1] term [2020-11-30 00:35:50,527 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:35:50,529 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 4, 4, 3, 3, 2, 1] term [2020-11-30 00:35:50,529 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:35:50,566 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-11-30 00:35:50,566 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:35:50,567 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 4, 4, 3, 3, 2, 1] term [2020-11-30 00:35:50,567 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:35:50,568 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 4, 4, 3, 3, 2, 1] term [2020-11-30 00:35:50,569 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:35:51,012 WARN L193 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 35 [2020-11-30 00:35:51,543 WARN L193 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 60 [2020-11-30 00:35:51,896 WARN L193 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 86 [2020-11-30 00:35:52,049 WARN L193 SmtUtils]: Spent 152.00 ms on a formula simplification that was a NOOP. DAG size: 86 [2020-11-30 00:35:52,783 WARN L193 SmtUtils]: Spent 487.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 122 [2020-11-30 00:35:52,994 WARN L193 SmtUtils]: Spent 209.00 ms on a formula simplification that was a NOOP. DAG size: 118 [2020-11-30 00:35:53,042 INFO L131 LiptonReduction]: Checked pairs total: 5690 [2020-11-30 00:35:53,043 INFO L133 LiptonReduction]: Total number of compositions: 97 [2020-11-30 00:35:53,048 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 36 places, 27 transitions, 69 flow [2020-11-30 00:35:53,137 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 752 states. [2020-11-30 00:35:53,139 INFO L276 IsEmpty]: Start isEmpty. Operand 752 states. [2020-11-30 00:35:53,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-11-30 00:35:53,147 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:35:53,148 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-11-30 00:35:53,148 INFO L429 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 00:35:53,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:35:53,155 INFO L82 PathProgramCache]: Analyzing trace with hash -881351852, now seen corresponding path program 1 times [2020-11-30 00:35:53,163 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:35:53,164 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [347303704] [2020-11-30 00:35:53,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:35:53,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:35:53,452 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 00:35:53,452 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [347303704] [2020-11-30 00:35:53,453 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 00:35:53,453 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-11-30 00:35:53,454 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1146587627] [2020-11-30 00:35:53,458 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-30 00:35:53,458 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:35:53,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-30 00:35:53,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 00:35:53,474 INFO L87 Difference]: Start difference. First operand 752 states. Second operand 3 states. [2020-11-30 00:35:53,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:35:53,559 INFO L93 Difference]: Finished difference Result 652 states and 2032 transitions. [2020-11-30 00:35:53,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-30 00:35:53,561 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2020-11-30 00:35:53,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:35:53,584 INFO L225 Difference]: With dead ends: 652 [2020-11-30 00:35:53,586 INFO L226 Difference]: Without dead ends: 532 [2020-11-30 00:35:53,588 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 [2020-11-30 00:35:53,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 532 states. [2020-11-30 00:35:53,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 532 to 532. [2020-11-30 00:35:53,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 532 states. [2020-11-30 00:35:53,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 532 states to 532 states and 1626 transitions. [2020-11-30 00:35:53,713 INFO L78 Accepts]: Start accepts. Automaton has 532 states and 1626 transitions. Word has length 7 [2020-11-30 00:35:53,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:35:53,714 INFO L481 AbstractCegarLoop]: Abstraction has 532 states and 1626 transitions. [2020-11-30 00:35:53,714 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-30 00:35:53,714 INFO L276 IsEmpty]: Start isEmpty. Operand 532 states and 1626 transitions. [2020-11-30 00:35:53,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-11-30 00:35:53,716 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:35:53,717 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 00:35:53,717 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-11-30 00:35:53,717 INFO L429 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 00:35:53,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:35:53,720 INFO L82 PathProgramCache]: Analyzing trace with hash -870496500, now seen corresponding path program 1 times [2020-11-30 00:35:53,721 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:35:53,722 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [711989531] [2020-11-30 00:35:53,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:35:53,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:35:53,850 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 00:35:53,851 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [711989531] [2020-11-30 00:35:53,851 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 00:35:53,851 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-11-30 00:35:53,851 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1655822936] [2020-11-30 00:35:53,852 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-30 00:35:53,852 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:35:53,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-30 00:35:53,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 00:35:53,853 INFO L87 Difference]: Start difference. First operand 532 states and 1626 transitions. Second operand 3 states. [2020-11-30 00:35:53,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:35:53,873 INFO L93 Difference]: Finished difference Result 492 states and 1484 transitions. [2020-11-30 00:35:53,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-30 00:35:53,874 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2020-11-30 00:35:53,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:35:53,879 INFO L225 Difference]: With dead ends: 492 [2020-11-30 00:35:53,879 INFO L226 Difference]: Without dead ends: 492 [2020-11-30 00:35:53,880 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 [2020-11-30 00:35:53,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 492 states. [2020-11-30 00:35:53,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 492 to 492. [2020-11-30 00:35:53,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 492 states. [2020-11-30 00:35:53,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 492 states to 492 states and 1484 transitions. [2020-11-30 00:35:53,905 INFO L78 Accepts]: Start accepts. Automaton has 492 states and 1484 transitions. Word has length 9 [2020-11-30 00:35:53,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:35:53,905 INFO L481 AbstractCegarLoop]: Abstraction has 492 states and 1484 transitions. [2020-11-30 00:35:53,905 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-30 00:35:53,906 INFO L276 IsEmpty]: Start isEmpty. Operand 492 states and 1484 transitions. [2020-11-30 00:35:53,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-11-30 00:35:53,912 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:35:53,912 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 00:35:53,912 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-11-30 00:35:53,913 INFO L429 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 00:35:53,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:35:53,913 INFO L82 PathProgramCache]: Analyzing trace with hash 932282266, now seen corresponding path program 1 times [2020-11-30 00:35:53,913 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:35:53,914 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [932578282] [2020-11-30 00:35:53,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:35:53,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:35:54,046 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 00:35:54,047 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [932578282] [2020-11-30 00:35:54,047 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 00:35:54,047 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-11-30 00:35:54,047 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [843395371] [2020-11-30 00:35:54,048 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-30 00:35:54,048 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:35:54,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-30 00:35:54,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 00:35:54,048 INFO L87 Difference]: Start difference. First operand 492 states and 1484 transitions. Second operand 3 states. [2020-11-30 00:35:54,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:35:54,058 INFO L93 Difference]: Finished difference Result 460 states and 1372 transitions. [2020-11-30 00:35:54,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-30 00:35:54,059 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2020-11-30 00:35:54,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:35:54,063 INFO L225 Difference]: With dead ends: 460 [2020-11-30 00:35:54,063 INFO L226 Difference]: Without dead ends: 460 [2020-11-30 00:35:54,064 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 [2020-11-30 00:35:54,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 460 states. [2020-11-30 00:35:54,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 460 to 460. [2020-11-30 00:35:54,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 460 states. [2020-11-30 00:35:54,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 460 states to 460 states and 1372 transitions. [2020-11-30 00:35:54,081 INFO L78 Accepts]: Start accepts. Automaton has 460 states and 1372 transitions. Word has length 11 [2020-11-30 00:35:54,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:35:54,081 INFO L481 AbstractCegarLoop]: Abstraction has 460 states and 1372 transitions. [2020-11-30 00:35:54,081 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-30 00:35:54,082 INFO L276 IsEmpty]: Start isEmpty. Operand 460 states and 1372 transitions. [2020-11-30 00:35:54,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-11-30 00:35:54,084 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:35:54,085 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 00:35:54,085 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-11-30 00:35:54,085 INFO L429 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 00:35:54,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:35:54,086 INFO L82 PathProgramCache]: Analyzing trace with hash -1014508263, now seen corresponding path program 1 times [2020-11-30 00:35:54,086 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:35:54,086 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [74766138] [2020-11-30 00:35:54,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:35:54,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:35:54,250 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 00:35:54,250 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [74766138] [2020-11-30 00:35:54,250 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 00:35:54,250 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-30 00:35:54,250 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1130757332] [2020-11-30 00:35:54,251 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-30 00:35:54,251 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:35:54,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-30 00:35:54,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-30 00:35:54,252 INFO L87 Difference]: Start difference. First operand 460 states and 1372 transitions. Second operand 4 states. [2020-11-30 00:35:54,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:35:54,308 INFO L93 Difference]: Finished difference Result 442 states and 1166 transitions. [2020-11-30 00:35:54,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-30 00:35:54,314 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2020-11-30 00:35:54,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:35:54,316 INFO L225 Difference]: With dead ends: 442 [2020-11-30 00:35:54,316 INFO L226 Difference]: Without dead ends: 322 [2020-11-30 00:35:54,317 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 [2020-11-30 00:35:54,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2020-11-30 00:35:54,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 322. [2020-11-30 00:35:54,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 322 states. [2020-11-30 00:35:54,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 322 states and 820 transitions. [2020-11-30 00:35:54,330 INFO L78 Accepts]: Start accepts. Automaton has 322 states and 820 transitions. Word has length 13 [2020-11-30 00:35:54,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:35:54,330 INFO L481 AbstractCegarLoop]: Abstraction has 322 states and 820 transitions. [2020-11-30 00:35:54,330 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-30 00:35:54,331 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 820 transitions. [2020-11-30 00:35:54,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-11-30 00:35:54,336 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:35:54,336 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 00:35:54,336 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-11-30 00:35:54,336 INFO L429 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 00:35:54,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:35:54,337 INFO L82 PathProgramCache]: Analyzing trace with hash -486868725, now seen corresponding path program 1 times [2020-11-30 00:35:54,337 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:35:54,337 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2073682755] [2020-11-30 00:35:54,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:35:54,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:35:54,489 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 00:35:54,490 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2073682755] [2020-11-30 00:35:54,490 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 00:35:54,490 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-30 00:35:54,490 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [672075472] [2020-11-30 00:35:54,490 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-30 00:35:54,491 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:35:54,491 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-30 00:35:54,491 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-11-30 00:35:54,491 INFO L87 Difference]: Start difference. First operand 322 states and 820 transitions. Second operand 5 states. [2020-11-30 00:35:54,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:35:54,555 INFO L93 Difference]: Finished difference Result 267 states and 628 transitions. [2020-11-30 00:35:54,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-30 00:35:54,557 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2020-11-30 00:35:54,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:35:54,559 INFO L225 Difference]: With dead ends: 267 [2020-11-30 00:35:54,559 INFO L226 Difference]: Without dead ends: 207 [2020-11-30 00:35:54,559 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 [2020-11-30 00:35:54,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2020-11-30 00:35:54,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 207. [2020-11-30 00:35:54,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 207 states. [2020-11-30 00:35:54,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 475 transitions. [2020-11-30 00:35:54,565 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 475 transitions. Word has length 15 [2020-11-30 00:35:54,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:35:54,565 INFO L481 AbstractCegarLoop]: Abstraction has 207 states and 475 transitions. [2020-11-30 00:35:54,565 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-30 00:35:54,565 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 475 transitions. [2020-11-30 00:35:54,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-11-30 00:35:54,566 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:35:54,566 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 00:35:54,567 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-11-30 00:35:54,567 INFO L429 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 00:35:54,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:35:54,567 INFO L82 PathProgramCache]: Analyzing trace with hash -1591263714, now seen corresponding path program 1 times [2020-11-30 00:35:54,568 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:35:54,568 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1924444070] [2020-11-30 00:35:54,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:35:54,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:35:54,770 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 00:35:54,770 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1924444070] [2020-11-30 00:35:54,771 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 00:35:54,771 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-11-30 00:35:54,771 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [109448397] [2020-11-30 00:35:54,771 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-30 00:35:54,771 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:35:54,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-30 00:35:54,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-11-30 00:35:54,772 INFO L87 Difference]: Start difference. First operand 207 states and 475 transitions. Second operand 6 states. [2020-11-30 00:35:54,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:35:54,843 INFO L93 Difference]: Finished difference Result 188 states and 435 transitions. [2020-11-30 00:35:54,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-30 00:35:54,843 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2020-11-30 00:35:54,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:35:54,845 INFO L225 Difference]: With dead ends: 188 [2020-11-30 00:35:54,845 INFO L226 Difference]: Without dead ends: 175 [2020-11-30 00:35:54,845 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 [2020-11-30 00:35:54,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2020-11-30 00:35:54,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 175. [2020-11-30 00:35:54,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2020-11-30 00:35:54,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 411 transitions. [2020-11-30 00:35:54,852 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 411 transitions. Word has length 18 [2020-11-30 00:35:54,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:35:54,852 INFO L481 AbstractCegarLoop]: Abstraction has 175 states and 411 transitions. [2020-11-30 00:35:54,853 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-30 00:35:54,853 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 411 transitions. [2020-11-30 00:35:54,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-11-30 00:35:54,854 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:35:54,854 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] [2020-11-30 00:35:54,854 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-11-30 00:35:54,854 INFO L429 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 00:35:54,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:35:54,855 INFO L82 PathProgramCache]: Analyzing trace with hash 8978176, now seen corresponding path program 1 times [2020-11-30 00:35:54,855 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:35:54,856 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1767444265] [2020-11-30 00:35:54,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:35:54,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:35:54,968 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 00:35:54,969 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1767444265] [2020-11-30 00:35:54,969 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 00:35:54,969 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-30 00:35:54,969 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [968920113] [2020-11-30 00:35:54,969 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-30 00:35:54,969 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:35:54,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-30 00:35:54,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-30 00:35:54,970 INFO L87 Difference]: Start difference. First operand 175 states and 411 transitions. Second operand 4 states. [2020-11-30 00:35:54,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:35:54,990 INFO L93 Difference]: Finished difference Result 225 states and 517 transitions. [2020-11-30 00:35:54,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-30 00:35:54,991 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2020-11-30 00:35:54,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:35:54,992 INFO L225 Difference]: With dead ends: 225 [2020-11-30 00:35:54,992 INFO L226 Difference]: Without dead ends: 87 [2020-11-30 00:35:54,993 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 [2020-11-30 00:35:54,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2020-11-30 00:35:54,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2020-11-30 00:35:54,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2020-11-30 00:35:54,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 175 transitions. [2020-11-30 00:35:54,996 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 175 transitions. Word has length 21 [2020-11-30 00:35:54,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:35:54,996 INFO L481 AbstractCegarLoop]: Abstraction has 87 states and 175 transitions. [2020-11-30 00:35:54,996 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-30 00:35:54,997 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 175 transitions. [2020-11-30 00:35:54,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-11-30 00:35:54,997 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:35:54,997 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] [2020-11-30 00:35:54,997 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-11-30 00:35:54,998 INFO L429 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 00:35:54,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:35:54,998 INFO L82 PathProgramCache]: Analyzing trace with hash 1458794526, now seen corresponding path program 2 times [2020-11-30 00:35:54,998 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:35:54,998 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1356473654] [2020-11-30 00:35:54,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:35:55,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:35:55,104 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 00:35:55,104 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1356473654] [2020-11-30 00:35:55,104 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 00:35:55,104 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-30 00:35:55,104 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2132896885] [2020-11-30 00:35:55,105 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-30 00:35:55,105 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:35:55,105 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-30 00:35:55,106 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-30 00:35:55,106 INFO L87 Difference]: Start difference. First operand 87 states and 175 transitions. Second operand 4 states. [2020-11-30 00:35:55,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:35:55,130 INFO L93 Difference]: Finished difference Result 107 states and 210 transitions. [2020-11-30 00:35:55,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-30 00:35:55,131 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2020-11-30 00:35:55,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:35:55,132 INFO L225 Difference]: With dead ends: 107 [2020-11-30 00:35:55,132 INFO L226 Difference]: Without dead ends: 45 [2020-11-30 00:35:55,132 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 [2020-11-30 00:35:55,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2020-11-30 00:35:55,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2020-11-30 00:35:55,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2020-11-30 00:35:55,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 73 transitions. [2020-11-30 00:35:55,134 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 73 transitions. Word has length 21 [2020-11-30 00:35:55,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:35:55,134 INFO L481 AbstractCegarLoop]: Abstraction has 45 states and 73 transitions. [2020-11-30 00:35:55,134 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-30 00:35:55,135 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 73 transitions. [2020-11-30 00:35:55,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-11-30 00:35:55,135 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:35:55,135 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] [2020-11-30 00:35:55,135 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-11-30 00:35:55,135 INFO L429 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 00:35:55,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:35:55,136 INFO L82 PathProgramCache]: Analyzing trace with hash -666759918, now seen corresponding path program 3 times [2020-11-30 00:35:55,136 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:35:55,136 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1543502262] [2020-11-30 00:35:55,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:35:55,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:35:55,674 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 00:35:55,677 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1543502262] [2020-11-30 00:35:55,679 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 00:35:55,680 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-11-30 00:35:55,680 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [596091959] [2020-11-30 00:35:55,681 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-11-30 00:35:55,681 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:35:55,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-11-30 00:35:55,682 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2020-11-30 00:35:55,683 INFO L87 Difference]: Start difference. First operand 45 states and 73 transitions. Second operand 8 states. [2020-11-30 00:35:55,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:35:55,913 INFO L93 Difference]: Finished difference Result 55 states and 87 transitions. [2020-11-30 00:35:55,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-30 00:35:55,914 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 21 [2020-11-30 00:35:55,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:35:55,914 INFO L225 Difference]: With dead ends: 55 [2020-11-30 00:35:55,914 INFO L226 Difference]: Without dead ends: 31 [2020-11-30 00:35:55,915 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2020-11-30 00:35:55,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2020-11-30 00:35:55,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2020-11-30 00:35:55,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2020-11-30 00:35:55,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 41 transitions. [2020-11-30 00:35:55,916 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 41 transitions. Word has length 21 [2020-11-30 00:35:55,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:35:55,916 INFO L481 AbstractCegarLoop]: Abstraction has 31 states and 41 transitions. [2020-11-30 00:35:55,917 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-11-30 00:35:55,917 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 41 transitions. [2020-11-30 00:35:55,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-11-30 00:35:55,917 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:35:55,917 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] [2020-11-30 00:35:55,917 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-11-30 00:35:55,918 INFO L429 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 00:35:55,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:35:55,918 INFO L82 PathProgramCache]: Analyzing trace with hash -242191566, now seen corresponding path program 4 times [2020-11-30 00:35:55,918 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:35:55,918 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2133947098] [2020-11-30 00:35:55,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:35:56,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:35:56,006 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:35:56,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:35:56,111 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:35:56,159 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-30 00:35:56,159 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-11-30 00:35:56,160 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-11-30 00:35:56,161 WARN L264 etLargeBlockEncoding]: Failed to translate choice composition: Branch encoders not available. [2020-11-30 00:35:56,181 WARN L124 codingBacktranslator]: Skipped backtranslation of ATE [1202] [1202] L3-->L869: Formula: (let ((.cse8 (= (mod ~z$w_buff1_used~0_In812796544 256) 0)) (.cse9 (= (mod ~z$r_buff1_thd0~0_In812796544 256) 0)) (.cse6 (= (mod ~z$r_buff0_thd0~0_In812796544 256) 0)) (.cse7 (= (mod ~z$w_buff0_used~0_In812796544 256) 0))) (let ((.cse5 (or .cse6 .cse7)) (.cse1 (not .cse9)) (.cse2 (not .cse8)) (.cse0 (or .cse8 .cse9)) (.cse3 (not .cse7)) (.cse4 (not .cse6))) (and (= ~z$r_buff0_thd0~0_In812796544 ~z$r_buff0_thd0~0_Out812796544) (or (and (= ~z$w_buff1_used~0_Out812796544 ~z$w_buff1_used~0_In812796544) .cse0) (and (= ~z$w_buff1_used~0_Out812796544 0) .cse1 .cse2)) (= ~z$r_buff1_thd0~0_In812796544 ~z$r_buff1_thd0~0_Out812796544) (or (and (= ~z$w_buff0_used~0_Out812796544 0) .cse3 .cse4) (and (= ~z$w_buff0_used~0_Out812796544 ~z$w_buff0_used~0_In812796544) .cse5)) (or (and .cse5 (or (and (= ~z$w_buff1~0_In812796544 ~z~0_Out812796544) .cse1 .cse2) (and (= ~z~0_In812796544 ~z~0_Out812796544) .cse0))) (and .cse3 .cse4 (= ~z$w_buff0~0_In812796544 ~z~0_Out812796544))) (not (= ULTIMATE.start_assume_abort_if_not_~cond_In812796544 0))))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In812796544, ULTIMATE.start_assume_abort_if_not_~cond=ULTIMATE.start_assume_abort_if_not_~cond_In812796544, ~z$w_buff0_used~0=~z$w_buff0_used~0_In812796544, ~z$w_buff0~0=~z$w_buff0~0_In812796544, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In812796544, ~z$w_buff1_used~0=~z$w_buff1_used~0_In812796544, ~z$w_buff1~0=~z$w_buff1~0_In812796544, ~z~0=~z~0_In812796544} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_Out812796544, ~z$w_buff0~0=~z$w_buff0~0_In812796544, ~z$w_buff1_used~0=~z$w_buff1_used~0_Out812796544, ~z$w_buff1~0=~z$w_buff1~0_In812796544, ULTIMATE.start_main_#t~ite64=|ULTIMATE.start_main_#t~ite64_Out812796544|, ULTIMATE.start_main_#t~ite65=|ULTIMATE.start_main_#t~ite65_Out812796544|, ULTIMATE.start_main_#t~ite62=|ULTIMATE.start_main_#t~ite62_Out812796544|, ULTIMATE.start_main_#t~ite63=|ULTIMATE.start_main_#t~ite63_Out812796544|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_Out812796544, ULTIMATE.start_main_#t~ite60=|ULTIMATE.start_main_#t~ite60_Out812796544|, ULTIMATE.start_main_#t~ite61=|ULTIMATE.start_main_#t~ite61_Out812796544|, ULTIMATE.start_assume_abort_if_not_~cond=ULTIMATE.start_assume_abort_if_not_~cond_In812796544, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_Out812796544, ~z~0=~z~0_Out812796544} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite62, ULTIMATE.start_main_#t~ite63, ~z$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite60, ULTIMATE.start_main_#t~ite61, ~z$w_buff0_used~0, ~z$r_buff1_thd0~0, ~z$w_buff1_used~0, ~z~0, ULTIMATE.start_main_#t~ite64, ULTIMATE.start_main_#t~ite65] because there is no mapped edge [2020-11-30 00:35:56,191 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 00:35:56,191 WARN L224 RCFGBacktranslator]: unable to determine which branch was taken at C: __VERIFIER_atomic_begin() [799] [2020-11-30 00:35:56,192 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 00:35:56,192 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 00:35:56,192 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 00:35:56,192 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 00:35:56,192 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 00:35:56,193 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 00:35:56,193 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 00:35:56,193 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 00:35:56,193 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 00:35:56,193 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 00:35:56,193 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 00:35:56,194 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 00:35:56,194 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 00:35:56,195 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 00:35:56,195 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 00:35:56,195 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 00:35:56,195 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 00:35:56,195 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 00:35:56,195 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 00:35:56,196 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 00:35:56,196 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 00:35:56,196 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 00:35:56,196 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 00:35:56,196 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 00:35:56,196 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 00:35:56,197 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 00:35:56,198 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 00:35:56,198 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 00:35:56,203 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 00:35:56,203 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 00:35:56,203 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 00:35:56,203 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 00:35:56,204 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 00:35:56,204 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 00:35:56,204 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 00:35:56,204 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 00:35:56,204 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 00:35:56,204 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 00:35:56,205 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 00:35:56,205 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 00:35:56,206 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 00:35:56,206 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 00:35:56,206 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 00:35:56,206 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 00:35:56,206 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 00:35:56,206 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 00:35:56,207 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 00:35:56,207 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 00:35:56,208 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 00:35:56,208 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 00:35:56,208 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 00:35:56,208 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 00:35:56,208 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 00:35:56,208 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 00:35:56,209 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 00:35:56,209 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 00:35:56,209 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 00:35:56,209 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 00:35:56,209 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 00:35:56,209 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 00:35:56,295 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.11 12:35:56 BasicIcfg [2020-11-30 00:35:56,295 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-11-30 00:35:56,296 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-11-30 00:35:56,296 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-11-30 00:35:56,296 INFO L275 PluginConnector]: Witness Printer initialized [2020-11-30 00:35:56,297 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 12:35:46" (3/4) ... [2020-11-30 00:35:56,298 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2020-11-30 00:35:56,309 WARN L124 codingBacktranslator]: Skipped backtranslation of ATE [1202] [1202] L3-->L869: Formula: (let ((.cse8 (= (mod ~z$w_buff1_used~0_In812796544 256) 0)) (.cse9 (= (mod ~z$r_buff1_thd0~0_In812796544 256) 0)) (.cse6 (= (mod ~z$r_buff0_thd0~0_In812796544 256) 0)) (.cse7 (= (mod ~z$w_buff0_used~0_In812796544 256) 0))) (let ((.cse5 (or .cse6 .cse7)) (.cse1 (not .cse9)) (.cse2 (not .cse8)) (.cse0 (or .cse8 .cse9)) (.cse3 (not .cse7)) (.cse4 (not .cse6))) (and (= ~z$r_buff0_thd0~0_In812796544 ~z$r_buff0_thd0~0_Out812796544) (or (and (= ~z$w_buff1_used~0_Out812796544 ~z$w_buff1_used~0_In812796544) .cse0) (and (= ~z$w_buff1_used~0_Out812796544 0) .cse1 .cse2)) (= ~z$r_buff1_thd0~0_In812796544 ~z$r_buff1_thd0~0_Out812796544) (or (and (= ~z$w_buff0_used~0_Out812796544 0) .cse3 .cse4) (and (= ~z$w_buff0_used~0_Out812796544 ~z$w_buff0_used~0_In812796544) .cse5)) (or (and .cse5 (or (and (= ~z$w_buff1~0_In812796544 ~z~0_Out812796544) .cse1 .cse2) (and (= ~z~0_In812796544 ~z~0_Out812796544) .cse0))) (and .cse3 .cse4 (= ~z$w_buff0~0_In812796544 ~z~0_Out812796544))) (not (= ULTIMATE.start_assume_abort_if_not_~cond_In812796544 0))))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In812796544, ULTIMATE.start_assume_abort_if_not_~cond=ULTIMATE.start_assume_abort_if_not_~cond_In812796544, ~z$w_buff0_used~0=~z$w_buff0_used~0_In812796544, ~z$w_buff0~0=~z$w_buff0~0_In812796544, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In812796544, ~z$w_buff1_used~0=~z$w_buff1_used~0_In812796544, ~z$w_buff1~0=~z$w_buff1~0_In812796544, ~z~0=~z~0_In812796544} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_Out812796544, ~z$w_buff0~0=~z$w_buff0~0_In812796544, ~z$w_buff1_used~0=~z$w_buff1_used~0_Out812796544, ~z$w_buff1~0=~z$w_buff1~0_In812796544, ULTIMATE.start_main_#t~ite64=|ULTIMATE.start_main_#t~ite64_Out812796544|, ULTIMATE.start_main_#t~ite65=|ULTIMATE.start_main_#t~ite65_Out812796544|, ULTIMATE.start_main_#t~ite62=|ULTIMATE.start_main_#t~ite62_Out812796544|, ULTIMATE.start_main_#t~ite63=|ULTIMATE.start_main_#t~ite63_Out812796544|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_Out812796544, ULTIMATE.start_main_#t~ite60=|ULTIMATE.start_main_#t~ite60_Out812796544|, ULTIMATE.start_main_#t~ite61=|ULTIMATE.start_main_#t~ite61_Out812796544|, ULTIMATE.start_assume_abort_if_not_~cond=ULTIMATE.start_assume_abort_if_not_~cond_In812796544, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_Out812796544, ~z~0=~z~0_Out812796544} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite62, ULTIMATE.start_main_#t~ite63, ~z$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite60, ULTIMATE.start_main_#t~ite61, ~z$w_buff0_used~0, ~z$r_buff1_thd0~0, ~z$w_buff1_used~0, ~z~0, ULTIMATE.start_main_#t~ite64, ULTIMATE.start_main_#t~ite65] because there is no mapped edge [2020-11-30 00:35:56,310 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 00:35:56,311 WARN L224 RCFGBacktranslator]: unable to determine which branch was taken at C: __VERIFIER_atomic_begin() [799] [2020-11-30 00:35:56,311 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 00:35:56,311 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 00:35:56,311 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 00:35:56,311 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 00:35:56,311 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 00:35:56,312 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 00:35:56,312 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 00:35:56,312 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 00:35:56,312 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 00:35:56,312 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 00:35:56,312 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 00:35:56,312 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 00:35:56,313 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 00:35:56,313 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 00:35:56,313 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 00:35:56,313 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 00:35:56,313 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 00:35:56,313 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 00:35:56,313 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 00:35:56,313 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 00:35:56,314 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 00:35:56,314 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 00:35:56,314 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 00:35:56,314 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 00:35:56,314 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 00:35:56,314 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 00:35:56,315 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 00:35:56,315 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 00:35:56,315 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 00:35:56,315 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 00:35:56,315 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 00:35:56,316 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 00:35:56,316 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 00:35:56,316 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 00:35:56,316 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 00:35:56,316 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 00:35:56,316 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 00:35:56,316 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 00:35:56,317 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 00:35:56,317 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 00:35:56,317 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 00:35:56,317 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 00:35:56,317 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 00:35:56,317 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 00:35:56,317 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 00:35:56,318 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 00:35:56,318 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 00:35:56,318 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 00:35:56,318 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 00:35:56,318 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 00:35:56,318 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 00:35:56,319 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 00:35:56,319 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 00:35:56,319 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 00:35:56,319 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 00:35:56,319 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 00:35:56,319 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 00:35:56,319 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 00:35:56,319 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 00:35:56,320 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 00:35:56,409 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_f05706db-73c8-433e-a079-7663f72285ee/bin/uautomizer/witness.graphml [2020-11-30 00:35:56,410 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-11-30 00:35:56,411 INFO L168 Benchmark]: Toolchain (without parser) took 14310.67 ms. Allocated memory was 121.6 MB in the beginning and 283.1 MB in the end (delta: 161.5 MB). Free memory was 89.7 MB in the beginning and 201.3 MB in the end (delta: -111.6 MB). Peak memory consumption was 49.7 MB. Max. memory is 16.1 GB. [2020-11-30 00:35:56,411 INFO L168 Benchmark]: CDTParser took 0.33 ms. Allocated memory is still 88.1 MB. Free memory was 47.6 MB in the beginning and 47.5 MB in the end (delta: 75.6 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-11-30 00:35:56,412 INFO L168 Benchmark]: CACSL2BoogieTranslator took 806.59 ms. Allocated memory is still 121.6 MB. Free memory was 89.7 MB in the beginning and 73.6 MB in the end (delta: 16.0 MB). Peak memory consumption was 16.8 MB. Max. memory is 16.1 GB. [2020-11-30 00:35:56,412 INFO L168 Benchmark]: Boogie Procedure Inliner took 72.31 ms. Allocated memory is still 121.6 MB. Free memory was 73.6 MB in the beginning and 70.7 MB in the end (delta: 3.0 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-11-30 00:35:56,412 INFO L168 Benchmark]: Boogie Preprocessor took 49.49 ms. Allocated memory is still 121.6 MB. Free memory was 70.7 MB in the beginning and 68.6 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-11-30 00:35:56,412 INFO L168 Benchmark]: RCFGBuilder took 3090.11 ms. Allocated memory was 121.6 MB in the beginning and 146.8 MB in the end (delta: 25.2 MB). Free memory was 68.6 MB in the beginning and 97.0 MB in the end (delta: -28.4 MB). Peak memory consumption was 50.6 MB. Max. memory is 16.1 GB. [2020-11-30 00:35:56,413 INFO L168 Benchmark]: TraceAbstraction took 10167.28 ms. Allocated memory was 146.8 MB in the beginning and 283.1 MB in the end (delta: 136.3 MB). Free memory was 95.9 MB in the beginning and 221.2 MB in the end (delta: -125.3 MB). Peak memory consumption was 140.0 MB. Max. memory is 16.1 GB. [2020-11-30 00:35:56,413 INFO L168 Benchmark]: Witness Printer took 113.62 ms. Allocated memory is still 283.1 MB. Free memory was 221.2 MB in the beginning and 201.3 MB in the end (delta: 19.9 MB). Peak memory consumption was 21.0 MB. Max. memory is 16.1 GB. [2020-11-30 00:35:56,415 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.33 ms. Allocated memory is still 88.1 MB. Free memory was 47.6 MB in the beginning and 47.5 MB in the end (delta: 75.6 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 806.59 ms. Allocated memory is still 121.6 MB. Free memory was 89.7 MB in the beginning and 73.6 MB in the end (delta: 16.0 MB). Peak memory consumption was 16.8 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 72.31 ms. Allocated memory is still 121.6 MB. Free memory was 73.6 MB in the beginning and 70.7 MB in the end (delta: 3.0 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 49.49 ms. Allocated memory is still 121.6 MB. Free memory was 70.7 MB in the beginning and 68.6 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 3090.11 ms. Allocated memory was 121.6 MB in the beginning and 146.8 MB in the end (delta: 25.2 MB). Free memory was 68.6 MB in the beginning and 97.0 MB in the end (delta: -28.4 MB). Peak memory consumption was 50.6 MB. Max. memory is 16.1 GB. * TraceAbstraction took 10167.28 ms. Allocated memory was 146.8 MB in the beginning and 283.1 MB in the end (delta: 136.3 MB). Free memory was 95.9 MB in the beginning and 221.2 MB in the end (delta: -125.3 MB). Peak memory consumption was 140.0 MB. Max. memory is 16.1 GB. * Witness Printer took 113.62 ms. Allocated memory is still 283.1 MB. Free memory was 221.2 MB in the beginning and 201.3 MB in the end (delta: 19.9 MB). Peak memory consumption was 21.0 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 1396 VarBasedMoverChecksPositive, 78 VarBasedMoverChecksNegative, 20 SemBasedMoverChecksPositive, 58 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 2.4s, 169 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 6.7s, 114 PlacesBefore, 36 PlacesAfterwards, 107 TransitionsBefore, 27 TransitionsAfterwards, 1950 CoEnabledTransitionPairs, 8 FixpointIterations, 40 TrivialSequentialCompositions, 46 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 9 ConcurrentYvCompositions, 2 ChoiceCompositions, 97 TotalNumberOfCompositions, 5690 MoverChecksTotal - CounterExampleResult [Line: 17]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p0_EAX = 0; [L713] 0 int __unbuffered_p0_EBX = 0; [L715] 0 int __unbuffered_p1_EAX = 0; [L717] 0 int __unbuffered_p2_EAX = 0; [L719] 0 int __unbuffered_p2_EBX = 0; [L721] 0 int a = 0; [L722] 0 _Bool main$tmp_guard0; [L723] 0 _Bool main$tmp_guard1; [L725] 0 int x = 0; [L727] 0 int y = 0; [L729] 0 int z = 0; [L730] 0 _Bool z$flush_delayed; [L731] 0 int z$mem_tmp; [L732] 0 _Bool z$r_buff0_thd0; [L733] 0 _Bool z$r_buff0_thd1; [L734] 0 _Bool z$r_buff0_thd2; [L735] 0 _Bool z$r_buff0_thd3; [L736] 0 _Bool z$r_buff1_thd0; [L737] 0 _Bool z$r_buff1_thd1; [L738] 0 _Bool z$r_buff1_thd2; [L739] 0 _Bool z$r_buff1_thd3; [L740] 0 _Bool z$read_delayed; [L741] 0 int *z$read_delayed_var; [L742] 0 int z$w_buff0; [L743] 0 _Bool z$w_buff0_used; [L744] 0 int z$w_buff1; [L745] 0 _Bool z$w_buff1_used; [L746] 0 _Bool weak$$choice0; [L747] 0 _Bool weak$$choice2; [L853] 0 pthread_t t388; [L854] FCALL, FORK 0 pthread_create(&t388, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=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=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] [L855] 0 pthread_t t389; [L856] FCALL, FORK 0 pthread_create(&t389, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=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] [L857] 0 pthread_t t390; [L858] FCALL, FORK 0 pthread_create(&t390, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=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] [L800] 3 z$w_buff1 = z$w_buff0 [L801] 3 z$w_buff0 = 1 [L802] 3 z$w_buff1_used = z$w_buff0_used [L803] 3 z$w_buff0_used = (_Bool)1 [L18] COND FALSE 3 !(!expression) [L805] 3 z$r_buff1_thd0 = z$r_buff0_thd0 [L806] 3 z$r_buff1_thd1 = z$r_buff0_thd1 [L807] 3 z$r_buff1_thd2 = z$r_buff0_thd2 [L808] 3 z$r_buff1_thd3 = z$r_buff0_thd3 [L809] 3 z$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, 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] [L812] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L813] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L814] 3 z$flush_delayed = weak$$choice2 [L815] 3 z$mem_tmp = z [L816] 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) [L816] 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) [L817] 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)) [L817] 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)) [L818] 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)) [L818] 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) [L818] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1 [L818] 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) [L818] 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)) [L818] 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)) [L819] 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)) [L819] 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)) [L820] 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)) [L820] 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)) [L821] 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)) [L821] 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) [L821] 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)) [L821] 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)) [L822] 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)) [L822] 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) [L822] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0 [L822] 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) [L822] 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)) [L822] 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)) [L823] 3 __unbuffered_p2_EAX = z [L824] EXPR 3 z$flush_delayed ? z$mem_tmp : z [L824] 3 z = z$flush_delayed ? z$mem_tmp : z [L825] 3 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, 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=1, 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] [L828] 3 __unbuffered_p2_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, 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=1, 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] [L751] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, 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=1, 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] [L754] 1 x = 1 [L757] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=1, 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=1, 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] [L760] 1 __unbuffered_p0_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=1, 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=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L772] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=1, y=1, 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=1, 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] [L765] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L767] 1 return 0; [L775] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L776] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L777] 2 z$flush_delayed = weak$$choice2 [L778] 2 z$mem_tmp = z [L779] EXPR 2 !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1) [L779] 2 z = !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1) [L780] EXPR 2 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) [L780] 2 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) [L781] EXPR 2 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) [L781] EXPR 2 !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1) [L781] EXPR 2 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) [L781] 2 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) [L782] EXPR 2 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used)) [L782] EXPR 2 !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used) [L782] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L782] EXPR 2 !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used) [L782] EXPR 2 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used)) [L782] 2 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used)) [L783] EXPR 2 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L783] 2 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L784] EXPR 2 weak$$choice2 ? z$r_buff0_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2)) [L784] 2 z$r_buff0_thd2 = weak$$choice2 ? z$r_buff0_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2)) [L785] EXPR 2 weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L785] 2 z$r_buff1_thd2 = weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L786] 2 __unbuffered_p1_EAX = z [L787] EXPR 2 z$flush_delayed ? z$mem_tmp : z [L787] 2 z = z$flush_delayed ? z$mem_tmp : z [L788] 2 z$flush_delayed = (_Bool)0 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=255, x=1, y=1, 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=1, 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] [L793] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L795] 2 return 0; [L831] 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) [L831] EXPR 3 z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z [L831] 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) [L831] 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) [L832] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L832] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L833] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L833] 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 [L834] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L834] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L835] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L835] 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 [L838] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L840] 3 return 0; [L860] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L871] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L18] COND TRUE 0 !expression [L17] COND FALSE 0 !(0) [L17] 0 __assert_fail ("0", "mix015_power.opt.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=255, x=1, y=1, z=1, 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=1, 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, 105 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 9.8s, OverallIterations: 10, TraceHistogramMax: 1, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 6.8s, HoareTripleCheckerStatistics: 236 SDtfs, 182 SDslu, 392 SDs, 0 SdLazy, 144 SolverSat, 27 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 35 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=752occurred 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.1s AutomataMinimizationTime, 9 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 157 NumberOfCodeBlocks, 157 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 127 ConstructedInterpolants, 0 QuantifiedInterpolants, 14233 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 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...