./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix005_tso.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_ceb58bf6-d8c1-46e8-b3a3-c042f12cb3da/bin/uautomizer/data/config -Xmx15G -Xms4m -jar /tmp/vcloud-vcloud-master/worker/run_dir_ceb58bf6-d8c1-46e8-b3a3-c042f12cb3da/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_ceb58bf6-d8c1-46e8-b3a3-c042f12cb3da/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_ceb58bf6-d8c1-46e8-b3a3-c042f12cb3da/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix005_tso.opt.i -s /tmp/vcloud-vcloud-master/worker/run_dir_ceb58bf6-d8c1-46e8-b3a3-c042f12cb3da/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_ceb58bf6-d8c1-46e8-b3a3-c042f12cb3da/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 5871defd2c541c804d7cdca38db010e5804c4d80 ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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:51:26,509 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-30 00:51:26,511 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-30 00:51:26,622 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-30 00:51:26,626 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-30 00:51:26,627 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-30 00:51:26,631 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-30 00:51:26,634 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-30 00:51:26,637 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-30 00:51:26,639 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-30 00:51:26,641 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-30 00:51:26,643 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-30 00:51:26,644 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-30 00:51:26,646 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-30 00:51:26,648 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-30 00:51:26,650 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-30 00:51:26,651 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-30 00:51:26,653 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-30 00:51:26,657 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-30 00:51:26,660 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-30 00:51:26,663 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-30 00:51:26,665 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-30 00:51:26,667 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-30 00:51:26,669 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-30 00:51:26,674 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-30 00:51:26,675 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-30 00:51:26,675 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-30 00:51:26,677 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-30 00:51:26,678 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-30 00:51:26,680 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-30 00:51:26,681 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-30 00:51:26,682 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-30 00:51:26,684 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-30 00:51:26,685 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-30 00:51:26,687 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-30 00:51:26,688 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-30 00:51:26,689 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-30 00:51:26,690 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-30 00:51:26,690 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-30 00:51:26,692 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-30 00:51:26,694 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-30 00:51:26,695 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_ceb58bf6-d8c1-46e8-b3a3-c042f12cb3da/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2020-11-30 00:51:26,732 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-30 00:51:26,732 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-30 00:51:26,734 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-11-30 00:51:26,735 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-11-30 00:51:26,736 INFO L138 SettingsManager]: * Use SBE=true [2020-11-30 00:51:26,736 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-30 00:51:26,737 INFO L138 SettingsManager]: * sizeof long=4 [2020-11-30 00:51:26,737 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-11-30 00:51:26,737 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-11-30 00:51:26,738 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-30 00:51:26,738 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-11-30 00:51:26,738 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-11-30 00:51:26,739 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-11-30 00:51:26,739 INFO L138 SettingsManager]: * sizeof long double=12 [2020-11-30 00:51:26,739 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-11-30 00:51:26,739 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-30 00:51:26,740 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-11-30 00:51:26,740 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-30 00:51:26,741 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-11-30 00:51:26,741 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-11-30 00:51:26,741 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-11-30 00:51:26,741 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-30 00:51:26,742 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-30 00:51:26,742 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-11-30 00:51:26,743 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-11-30 00:51:26,743 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-11-30 00:51:26,743 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-11-30 00:51:26,744 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-11-30 00:51:26,744 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-11-30 00:51:26,744 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_ceb58bf6-d8c1-46e8-b3a3-c042f12cb3da/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_ceb58bf6-d8c1-46e8-b3a3-c042f12cb3da/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 -> 5871defd2c541c804d7cdca38db010e5804c4d80 [2020-11-30 00:51:27,125 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-30 00:51:27,169 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-30 00:51:27,172 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-30 00:51:27,174 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-30 00:51:27,176 INFO L275 PluginConnector]: CDTParser initialized [2020-11-30 00:51:27,178 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_ceb58bf6-d8c1-46e8-b3a3-c042f12cb3da/bin/uautomizer/../../sv-benchmarks/c/pthread-wmm/mix005_tso.opt.i [2020-11-30 00:51:27,278 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_ceb58bf6-d8c1-46e8-b3a3-c042f12cb3da/bin/uautomizer/data/d92111446/30a9aaf963024e3fb15ae0339d56fde4/FLAG1a50b906f [2020-11-30 00:51:27,925 INFO L306 CDTParser]: Found 1 translation units. [2020-11-30 00:51:27,926 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_ceb58bf6-d8c1-46e8-b3a3-c042f12cb3da/sv-benchmarks/c/pthread-wmm/mix005_tso.opt.i [2020-11-30 00:51:27,948 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_ceb58bf6-d8c1-46e8-b3a3-c042f12cb3da/bin/uautomizer/data/d92111446/30a9aaf963024e3fb15ae0339d56fde4/FLAG1a50b906f [2020-11-30 00:51:28,183 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_ceb58bf6-d8c1-46e8-b3a3-c042f12cb3da/bin/uautomizer/data/d92111446/30a9aaf963024e3fb15ae0339d56fde4 [2020-11-30 00:51:28,186 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-30 00:51:28,190 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-11-30 00:51:28,199 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-30 00:51:28,199 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-30 00:51:28,205 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-30 00:51:28,207 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.11 12:51:28" (1/1) ... [2020-11-30 00:51:28,209 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7093f846 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:51:28, skipping insertion in model container [2020-11-30 00:51:28,210 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.11 12:51:28" (1/1) ... [2020-11-30 00:51:28,219 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-11-30 00:51:28,302 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-30 00:51:28,988 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-30 00:51:29,012 INFO L203 MainTranslator]: Completed pre-run [2020-11-30 00:51:29,104 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-30 00:51:29,222 INFO L208 MainTranslator]: Completed translation [2020-11-30 00:51:29,223 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:51:29 WrapperNode [2020-11-30 00:51:29,223 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-30 00:51:29,225 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-11-30 00:51:29,225 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-11-30 00:51:29,225 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-11-30 00:51:29,237 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:51:29" (1/1) ... [2020-11-30 00:51:29,288 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:51:29" (1/1) ... [2020-11-30 00:51:29,352 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-11-30 00:51:29,354 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-11-30 00:51:29,354 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-11-30 00:51:29,354 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-11-30 00:51:29,366 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:51:29" (1/1) ... [2020-11-30 00:51:29,371 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:51:29" (1/1) ... [2020-11-30 00:51:29,379 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:51:29" (1/1) ... [2020-11-30 00:51:29,395 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:51:29" (1/1) ... [2020-11-30 00:51:29,411 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:51:29" (1/1) ... [2020-11-30 00:51:29,417 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:51:29" (1/1) ... [2020-11-30 00:51:29,423 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:51:29" (1/1) ... [2020-11-30 00:51:29,431 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-11-30 00:51:29,432 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-11-30 00:51:29,432 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-11-30 00:51:29,432 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-11-30 00:51:29,434 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:51:29" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ceb58bf6-d8c1-46e8-b3a3-c042f12cb3da/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:51:29,557 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-11-30 00:51:29,557 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-11-30 00:51:29,558 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-11-30 00:51:29,559 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-11-30 00:51:29,560 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-11-30 00:51:29,560 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-11-30 00:51:29,561 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-11-30 00:51:29,562 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-11-30 00:51:29,562 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-11-30 00:51:29,563 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-11-30 00:51:29,563 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2020-11-30 00:51:29,563 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2020-11-30 00:51:29,564 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-11-30 00:51:29,564 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-11-30 00:51:29,564 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-11-30 00:51:29,564 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-11-30 00:51:29,567 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:51:33,688 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-11-30 00:51:33,688 INFO L298 CfgBuilder]: Removed 14 assume(true) statements. [2020-11-30 00:51:33,691 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 12:51:33 BoogieIcfgContainer [2020-11-30 00:51:33,691 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-11-30 00:51:33,696 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-11-30 00:51:33,696 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-11-30 00:51:33,700 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-11-30 00:51:33,700 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.11 12:51:28" (1/3) ... [2020-11-30 00:51:33,702 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c908e6f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.11 12:51:33, skipping insertion in model container [2020-11-30 00:51:33,702 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:51:29" (2/3) ... [2020-11-30 00:51:33,702 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c908e6f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.11 12:51:33, skipping insertion in model container [2020-11-30 00:51:33,703 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 12:51:33" (3/3) ... [2020-11-30 00:51:33,705 INFO L111 eAbstractionObserver]: Analyzing ICFG mix005_tso.opt.i [2020-11-30 00:51:33,723 WARN L153 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-11-30 00:51:33,724 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-11-30 00:51:33,730 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-11-30 00:51:33,731 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-11-30 00:51:33,797 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:51:33,798 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:51:33,798 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:51:33,798 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:51:33,799 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:51:33,799 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:51:33,800 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:51:33,801 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:51:33,801 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:51:33,802 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:51:33,802 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:51:33,802 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:51:33,803 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:51:33,803 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:51:33,803 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:51:33,803 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:51:33,804 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:51:33,804 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:51:33,805 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:51:33,805 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:51:33,805 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:51:33,806 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:51:33,806 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:51:33,806 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:51:33,807 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:51:33,808 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:51:33,808 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:51:33,809 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:51:33,809 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:51:33,809 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:51:33,809 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:51:33,810 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:51:33,811 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:51:33,811 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:51:33,811 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:51:33,811 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:51:33,811 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:51:33,812 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:51:33,812 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:51:33,812 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:51:33,812 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:51:33,813 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:51:33,813 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:51:33,813 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:51:33,813 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:51:33,813 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:51:33,814 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:51:33,814 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:51:33,814 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:51:33,815 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:51:33,815 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:51:33,815 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:51:33,815 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:51:33,816 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:51:33,819 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:51:33,819 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:51:33,820 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:51:33,820 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:51:33,820 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:51:33,821 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:51:33,821 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:51:33,821 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:51:33,822 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:51:33,822 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:51:33,822 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:51:33,823 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:51:33,823 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:51:33,823 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:51:33,823 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:51:33,824 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:51:33,824 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:51:33,824 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:51:33,825 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:51:33,825 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:51:33,825 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:51:33,825 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:51:33,825 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:51:33,827 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:51:33,827 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:51:33,827 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:51:33,828 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:51:33,828 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:51:33,828 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:51:33,829 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~nondet28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:51:33,829 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~nondet29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:51:33,829 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:51:33,829 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:51:33,830 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:51:33,830 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:51:33,831 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:51:33,832 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:51:33,835 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:51:33,837 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:51:33,838 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:51:33,838 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~nondet28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:51:33,838 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:51:33,839 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~nondet29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:51:33,840 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:51:33,841 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:51:33,841 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:51:33,842 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:51:33,843 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:51:33,844 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:51:33,849 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:51:33,849 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:51:33,849 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:51:33,850 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:51:33,850 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:51:33,853 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:51:33,853 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:51:33,853 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:51:33,854 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:51:33,854 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:51:33,854 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:51:33,854 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:51:33,855 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:51:33,855 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:51:33,858 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:51:33,859 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:51:33,859 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:51:33,859 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:51:33,860 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:51:33,860 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:51:33,860 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:51:33,860 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:51:33,861 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:51:33,861 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:51:33,861 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:51:33,861 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:51:33,862 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:51:33,862 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:51:33,862 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:51:33,862 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:51:33,863 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:51:33,863 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:51:33,863 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:51:33,863 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:51:33,864 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:51:33,864 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:51:33,864 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:51:33,864 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:51:33,865 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:51:33,865 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:51:33,865 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:51:33,872 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:51:33,872 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:51:33,873 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:51:33,873 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:51:33,873 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:51:33,873 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:51:33,873 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:51:33,873 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:51:33,874 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:51:33,874 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:51:33,874 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:51:33,874 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:51:33,874 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:51:33,875 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:51:33,875 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:51:33,876 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:51:33,876 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:51:33,876 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:51:33,876 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:51:33,877 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~nondet29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:51:33,877 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:51:33,877 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:51:33,877 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:51:33,878 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:51:33,878 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~nondet28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:51:33,878 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:51:33,878 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:51:33,879 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:51:33,879 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:51:33,879 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:51:33,879 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:51:33,880 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:51:33,880 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:51:33,880 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:51:33,880 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:51:33,881 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:51:33,881 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:51:33,884 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:51:33,884 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:51:33,884 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:51:33,885 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:51:33,887 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:51:33,887 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:51:33,887 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:51:33,887 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:51:33,890 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2020-11-30 00:51:33,904 INFO L253 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2020-11-30 00:51:33,945 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-11-30 00:51:33,945 INFO L378 AbstractCegarLoop]: Hoare is true [2020-11-30 00:51:33,945 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-11-30 00:51:33,945 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-11-30 00:51:33,946 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-11-30 00:51:33,946 INFO L382 AbstractCegarLoop]: Difference is false [2020-11-30 00:51:33,946 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-11-30 00:51:33,946 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-11-30 00:51:33,966 INFO L129 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2020-11-30 00:51:33,968 INFO L144 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 131 places, 121 transitions, 262 flow [2020-11-30 00:51:33,973 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 131 places, 121 transitions, 262 flow [2020-11-30 00:51:33,975 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 131 places, 121 transitions, 262 flow [2020-11-30 00:51:34,104 INFO L129 PetriNetUnfolder]: 3/117 cut-off events. [2020-11-30 00:51:34,104 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-11-30 00:51:34,111 INFO L80 FinitePrefix]: Finished finitePrefix Result has 130 conditions, 117 events. 3/117 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 87 event pairs, 0 based on Foata normal form. 0/112 useless extension candidates. Maximal degree in co-relation 79. Up to 2 conditions per place. [2020-11-30 00:51:34,116 INFO L116 LiptonReduction]: Number of co-enabled transitions 2726 [2020-11-30 00:51:35,168 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-30 00:51:35,169 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 00:51:35,171 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-30 00:51:35,171 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 00:51:35,182 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-30 00:51:35,183 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:51:35,192 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-30 00:51:35,193 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:51:35,235 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-30 00:51:35,235 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 00:51:35,237 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-30 00:51:35,237 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 00:51:35,242 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-30 00:51:35,242 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:51:35,246 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-30 00:51:35,246 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:51:35,329 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-11-30 00:51:35,329 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:51:35,331 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-11-30 00:51:35,332 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:51:35,333 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-11-30 00:51:35,333 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:51:35,587 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-11-30 00:51:35,588 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 00:51:35,878 WARN L193 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 50 [2020-11-30 00:51:36,163 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-11-30 00:51:36,164 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:51:36,166 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-11-30 00:51:36,166 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:51:36,167 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-11-30 00:51:36,168 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:51:36,724 WARN L193 SmtUtils]: Spent 408.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 60 [2020-11-30 00:51:36,873 WARN L193 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2020-11-30 00:51:37,092 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-11-30 00:51:37,092 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 00:51:37,326 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-11-30 00:51:37,327 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:51:37,329 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-11-30 00:51:37,329 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:51:37,330 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-11-30 00:51:37,331 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:51:37,332 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 1] term [2020-11-30 00:51:37,332 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:51:37,333 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 1] term [2020-11-30 00:51:37,334 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:51:37,361 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 5, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-11-30 00:51:37,361 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:51:37,363 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-11-30 00:51:37,363 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:51:37,365 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-11-30 00:51:37,366 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:51:37,368 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-11-30 00:51:37,368 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:51:37,391 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 3, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-11-30 00:51:37,391 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-11-30 00:51:37,396 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-11-30 00:51:37,396 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-11-30 00:51:37,399 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 3, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-11-30 00:51:37,399 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-11-30 00:51:37,403 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-11-30 00:51:37,404 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 00:51:37,407 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 3, 6, 3, 7, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-11-30 00:51:37,407 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 00:51:37,410 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 2, 6, 3, 7, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-11-30 00:51:37,410 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 00:51:37,574 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 4, 3, 3, 2, 1] term [2020-11-30 00:51:37,574 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:51:37,576 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-11-30 00:51:37,576 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:51:37,577 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 1] term [2020-11-30 00:51:37,577 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:51:37,578 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 1] term [2020-11-30 00:51:37,579 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:51:37,615 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 5, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-11-30 00:51:37,616 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:51:37,618 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-11-30 00:51:37,618 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:51:37,619 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-11-30 00:51:37,620 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:51:37,621 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-11-30 00:51:37,622 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:51:37,623 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-11-30 00:51:37,624 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:51:37,629 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 3, 2, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-11-30 00:51:37,630 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-11-30 00:51:37,634 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-11-30 00:51:37,634 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-11-30 00:51:37,637 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 3, 2, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-11-30 00:51:37,637 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-11-30 00:51:37,641 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-11-30 00:51:37,641 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 00:51:37,646 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 3, 6, 3, 7, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-11-30 00:51:37,646 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 00:51:37,649 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 2, 6, 3, 7, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-11-30 00:51:37,649 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 00:51:38,293 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-11-30 00:51:38,294 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:51:38,295 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-11-30 00:51:38,295 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:51:38,296 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-11-30 00:51:38,296 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:51:38,329 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-11-30 00:51:38,329 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:51:38,331 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-11-30 00:51:38,332 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:51:38,336 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-11-30 00:51:38,336 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:51:38,340 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 3, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-11-30 00:51:38,340 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-11-30 00:51:38,348 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-11-30 00:51:38,349 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-11-30 00:51:38,353 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 3, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-11-30 00:51:38,353 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-11-30 00:51:38,356 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-11-30 00:51:38,357 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 00:51:38,359 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 3, 6, 3, 7, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-11-30 00:51:38,359 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 00:51:38,361 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 2, 6, 3, 7, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-11-30 00:51:38,362 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 00:51:38,468 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-11-30 00:51:38,469 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:51:38,470 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-11-30 00:51:38,470 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:51:38,471 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-11-30 00:51:38,471 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:51:38,494 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 5, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-11-30 00:51:38,495 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:51:38,496 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-11-30 00:51:38,496 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:51:38,497 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-11-30 00:51:38,498 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:51:38,500 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-11-30 00:51:38,500 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:51:38,514 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 3, 2, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-11-30 00:51:38,514 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-11-30 00:51:38,517 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-11-30 00:51:38,518 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-11-30 00:51:38,521 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 3, 2, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-11-30 00:51:38,522 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-11-30 00:51:38,530 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-11-30 00:51:38,530 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 00:51:38,533 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 3, 6, 3, 7, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-11-30 00:51:38,533 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 00:51:38,537 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 2, 6, 3, 7, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-11-30 00:51:38,538 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 00:51:38,772 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-30 00:51:38,773 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 00:51:38,774 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-30 00:51:38,774 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 00:51:38,776 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-30 00:51:38,777 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:51:38,780 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-11-30 00:51:38,783 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:51:38,801 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-30 00:51:38,801 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 00:51:38,802 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-30 00:51:38,803 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 00:51:38,805 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-30 00:51:38,806 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:51:38,809 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-30 00:51:38,809 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:51:39,217 WARN L193 SmtUtils]: Spent 195.00 ms on a formula simplification that was a NOOP. DAG size: 58 [2020-11-30 00:51:39,392 WARN L193 SmtUtils]: Spent 172.00 ms on a formula simplification that was a NOOP. DAG size: 58 [2020-11-30 00:51:39,585 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-30 00:51:39,585 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 00:51:39,586 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-30 00:51:39,586 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 00:51:39,588 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-30 00:51:39,589 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:51:39,591 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-30 00:51:39,591 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:51:39,619 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-30 00:51:39,619 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 00:51:39,620 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-30 00:51:39,620 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 00:51:39,622 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-30 00:51:39,622 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:51:39,624 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-11-30 00:51:39,624 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:51:39,700 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-30 00:51:39,700 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 00:51:39,701 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-30 00:51:39,702 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 00:51:39,704 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-30 00:51:39,704 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:51:39,706 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-11-30 00:51:39,706 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:51:39,748 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-30 00:51:39,748 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 00:51:39,749 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-30 00:51:39,750 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 00:51:39,751 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-30 00:51:39,752 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:51:39,754 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-30 00:51:39,754 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:51:39,969 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-11-30 00:51:39,969 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-11-30 00:51:39,972 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-11-30 00:51:39,972 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 00:51:40,012 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-30 00:51:40,012 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 00:51:40,027 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-11-30 00:51:40,028 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-30 00:51:40,030 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-11-30 00:51:40,030 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-30 00:51:40,031 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-11-30 00:51:40,032 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-30 00:51:40,034 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-11-30 00:51:40,034 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:51:40,036 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:51:40,036 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:51:40,039 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:51:40,039 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:51:40,206 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-30 00:51:40,207 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 00:51:40,216 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-11-30 00:51:40,217 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-30 00:51:40,218 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-11-30 00:51:40,218 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-30 00:51:40,220 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-11-30 00:51:40,221 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-30 00:51:40,223 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-11-30 00:51:40,223 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:51:40,225 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:51:40,226 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:51:40,227 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:51:40,227 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:51:40,271 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-11-30 00:51:40,271 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-11-30 00:51:40,274 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-11-30 00:51:40,274 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 00:51:40,348 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-30 00:51:40,349 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 00:51:40,350 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-30 00:51:40,350 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 00:51:40,352 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-30 00:51:40,353 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:51:40,354 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-30 00:51:40,355 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:51:40,377 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-30 00:51:40,378 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 00:51:40,379 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-30 00:51:40,379 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 00:51:40,381 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-30 00:51:40,381 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:51:40,383 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-11-30 00:51:40,383 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:51:40,727 WARN L193 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 66 [2020-11-30 00:51:40,845 WARN L193 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 66 [2020-11-30 00:51:41,027 WARN L193 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 69 [2020-11-30 00:51:41,156 WARN L193 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 69 [2020-11-30 00:51:41,822 WARN L193 SmtUtils]: Spent 644.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 126 [2020-11-30 00:51:42,102 WARN L193 SmtUtils]: Spent 268.00 ms on a formula simplification that was a NOOP. DAG size: 122 [2020-11-30 00:51:42,109 INFO L131 LiptonReduction]: Checked pairs total: 7617 [2020-11-30 00:51:42,109 INFO L133 LiptonReduction]: Total number of compositions: 105 [2020-11-30 00:51:42,122 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 46 places, 34 transitions, 88 flow [2020-11-30 00:51:42,490 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 3562 states. [2020-11-30 00:51:42,492 INFO L276 IsEmpty]: Start isEmpty. Operand 3562 states. [2020-11-30 00:51:42,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-11-30 00:51:42,505 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:51:42,505 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 00:51:42,506 INFO L429 AbstractCegarLoop]: === Iteration 1 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 00:51:42,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:51:42,516 INFO L82 PathProgramCache]: Analyzing trace with hash -1979479494, now seen corresponding path program 1 times [2020-11-30 00:51:42,528 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:51:42,529 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [586337935] [2020-11-30 00:51:42,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:51:42,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:51:42,979 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:51:42,980 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [586337935] [2020-11-30 00:51:42,981 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 00:51:42,982 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-11-30 00:51:42,982 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [947113018] [2020-11-30 00:51:42,987 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-30 00:51:42,988 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:51:43,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-30 00:51:43,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 00:51:43,012 INFO L87 Difference]: Start difference. First operand 3562 states. Second operand 3 states. [2020-11-30 00:51:43,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:51:43,215 INFO L93 Difference]: Finished difference Result 3082 states and 12048 transitions. [2020-11-30 00:51:43,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-30 00:51:43,218 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2020-11-30 00:51:43,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:51:43,289 INFO L225 Difference]: With dead ends: 3082 [2020-11-30 00:51:43,290 INFO L226 Difference]: Without dead ends: 2602 [2020-11-30 00:51:43,291 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:51:43,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2602 states. [2020-11-30 00:51:43,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2602 to 2602. [2020-11-30 00:51:43,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2602 states. [2020-11-30 00:51:43,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2602 states to 2602 states and 10064 transitions. [2020-11-30 00:51:43,553 INFO L78 Accepts]: Start accepts. Automaton has 2602 states and 10064 transitions. Word has length 9 [2020-11-30 00:51:43,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:51:43,555 INFO L481 AbstractCegarLoop]: Abstraction has 2602 states and 10064 transitions. [2020-11-30 00:51:43,555 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-30 00:51:43,555 INFO L276 IsEmpty]: Start isEmpty. Operand 2602 states and 10064 transitions. [2020-11-30 00:51:43,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-11-30 00:51:43,560 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:51:43,560 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 00:51:43,561 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-11-30 00:51:43,561 INFO L429 AbstractCegarLoop]: === Iteration 2 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 00:51:43,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:51:43,562 INFO L82 PathProgramCache]: Analyzing trace with hash -771984337, now seen corresponding path program 1 times [2020-11-30 00:51:43,562 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:51:43,563 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019242437] [2020-11-30 00:51:43,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:51:43,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:51:43,738 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:51:43,738 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019242437] [2020-11-30 00:51:43,739 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 00:51:43,739 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-11-30 00:51:43,739 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1211694266] [2020-11-30 00:51:43,740 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-30 00:51:43,740 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:51:43,741 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-30 00:51:43,741 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-30 00:51:43,741 INFO L87 Difference]: Start difference. First operand 2602 states and 10064 transitions. Second operand 4 states. [2020-11-30 00:51:43,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:51:43,829 INFO L93 Difference]: Finished difference Result 2762 states and 10352 transitions. [2020-11-30 00:51:43,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-30 00:51:43,830 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2020-11-30 00:51:43,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:51:43,859 INFO L225 Difference]: With dead ends: 2762 [2020-11-30 00:51:43,859 INFO L226 Difference]: Without dead ends: 2282 [2020-11-30 00:51:43,860 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-30 00:51:43,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2282 states. [2020-11-30 00:51:44,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2282 to 2282. [2020-11-30 00:51:44,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2282 states. [2020-11-30 00:51:44,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2282 states to 2282 states and 8688 transitions. [2020-11-30 00:51:44,079 INFO L78 Accepts]: Start accepts. Automaton has 2282 states and 8688 transitions. Word has length 12 [2020-11-30 00:51:44,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:51:44,079 INFO L481 AbstractCegarLoop]: Abstraction has 2282 states and 8688 transitions. [2020-11-30 00:51:44,079 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-30 00:51:44,079 INFO L276 IsEmpty]: Start isEmpty. Operand 2282 states and 8688 transitions. [2020-11-30 00:51:44,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-11-30 00:51:44,088 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:51:44,088 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 00:51:44,089 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-11-30 00:51:44,089 INFO L429 AbstractCegarLoop]: === Iteration 3 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 00:51:44,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:51:44,101 INFO L82 PathProgramCache]: Analyzing trace with hash 1153132983, now seen corresponding path program 1 times [2020-11-30 00:51:44,102 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:51:44,102 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1814948294] [2020-11-30 00:51:44,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:51:44,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:51:44,243 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:51:44,244 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1814948294] [2020-11-30 00:51:44,244 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 00:51:44,244 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-11-30 00:51:44,244 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [162665756] [2020-11-30 00:51:44,245 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-30 00:51:44,245 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:51:44,246 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-30 00:51:44,246 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-30 00:51:44,246 INFO L87 Difference]: Start difference. First operand 2282 states and 8688 transitions. Second operand 4 states. [2020-11-30 00:51:44,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:51:44,313 INFO L93 Difference]: Finished difference Result 2346 states and 8704 transitions. [2020-11-30 00:51:44,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-30 00:51:44,313 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2020-11-30 00:51:44,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:51:44,338 INFO L225 Difference]: With dead ends: 2346 [2020-11-30 00:51:44,339 INFO L226 Difference]: Without dead ends: 2026 [2020-11-30 00:51:44,339 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-30 00:51:44,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2026 states. [2020-11-30 00:51:44,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2026 to 2026. [2020-11-30 00:51:44,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2026 states. [2020-11-30 00:51:44,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2026 states to 2026 states and 7600 transitions. [2020-11-30 00:51:44,442 INFO L78 Accepts]: Start accepts. Automaton has 2026 states and 7600 transitions. Word has length 14 [2020-11-30 00:51:44,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:51:44,442 INFO L481 AbstractCegarLoop]: Abstraction has 2026 states and 7600 transitions. [2020-11-30 00:51:44,443 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-30 00:51:44,443 INFO L276 IsEmpty]: Start isEmpty. Operand 2026 states and 7600 transitions. [2020-11-30 00:51:44,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-11-30 00:51:44,448 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:51:44,448 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 00:51:44,449 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-11-30 00:51:44,449 INFO L429 AbstractCegarLoop]: === Iteration 4 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 00:51:44,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:51:44,450 INFO L82 PathProgramCache]: Analyzing trace with hash -1146857803, now seen corresponding path program 1 times [2020-11-30 00:51:44,450 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:51:44,451 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [934938057] [2020-11-30 00:51:44,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:51:44,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:51:44,639 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:51:44,639 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [934938057] [2020-11-30 00:51:44,639 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 00:51:44,639 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-11-30 00:51:44,640 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1412589010] [2020-11-30 00:51:44,640 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-30 00:51:44,640 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:51:44,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-30 00:51:44,641 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-30 00:51:44,641 INFO L87 Difference]: Start difference. First operand 2026 states and 7600 transitions. Second operand 4 states. [2020-11-30 00:51:44,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:51:44,711 INFO L93 Difference]: Finished difference Result 2170 states and 7972 transitions. [2020-11-30 00:51:44,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-30 00:51:44,712 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2020-11-30 00:51:44,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:51:44,736 INFO L225 Difference]: With dead ends: 2170 [2020-11-30 00:51:44,736 INFO L226 Difference]: Without dead ends: 1978 [2020-11-30 00:51:44,737 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-30 00:51:44,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1978 states. [2020-11-30 00:51:44,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1978 to 1978. [2020-11-30 00:51:44,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1978 states. [2020-11-30 00:51:44,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1978 states to 1978 states and 7388 transitions. [2020-11-30 00:51:44,913 INFO L78 Accepts]: Start accepts. Automaton has 1978 states and 7388 transitions. Word has length 16 [2020-11-30 00:51:44,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:51:44,914 INFO L481 AbstractCegarLoop]: Abstraction has 1978 states and 7388 transitions. [2020-11-30 00:51:44,914 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-30 00:51:44,914 INFO L276 IsEmpty]: Start isEmpty. Operand 1978 states and 7388 transitions. [2020-11-30 00:51:44,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-11-30 00:51:44,920 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:51:44,920 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 00:51:44,921 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-11-30 00:51:44,921 INFO L429 AbstractCegarLoop]: === Iteration 5 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 00:51:44,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:51:44,922 INFO L82 PathProgramCache]: Analyzing trace with hash 804302063, now seen corresponding path program 1 times [2020-11-30 00:51:44,922 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:51:44,922 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2134914021] [2020-11-30 00:51:44,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:51:45,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:51:45,116 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:51:45,117 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2134914021] [2020-11-30 00:51:45,117 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 00:51:45,117 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-30 00:51:45,117 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1035120310] [2020-11-30 00:51:45,117 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-30 00:51:45,118 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:51:45,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-30 00:51:45,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-30 00:51:45,118 INFO L87 Difference]: Start difference. First operand 1978 states and 7388 transitions. Second operand 4 states. [2020-11-30 00:51:45,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:51:45,190 INFO L93 Difference]: Finished difference Result 2014 states and 6852 transitions. [2020-11-30 00:51:45,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-30 00:51:45,190 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2020-11-30 00:51:45,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:51:45,207 INFO L225 Difference]: With dead ends: 2014 [2020-11-30 00:51:45,208 INFO L226 Difference]: Without dead ends: 1534 [2020-11-30 00:51:45,208 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:51:45,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1534 states. [2020-11-30 00:51:45,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1534 to 1534. [2020-11-30 00:51:45,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1534 states. [2020-11-30 00:51:45,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1534 states to 1534 states and 5168 transitions. [2020-11-30 00:51:45,275 INFO L78 Accepts]: Start accepts. Automaton has 1534 states and 5168 transitions. Word has length 17 [2020-11-30 00:51:45,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:51:45,275 INFO L481 AbstractCegarLoop]: Abstraction has 1534 states and 5168 transitions. [2020-11-30 00:51:45,276 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-30 00:51:45,276 INFO L276 IsEmpty]: Start isEmpty. Operand 1534 states and 5168 transitions. [2020-11-30 00:51:45,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-11-30 00:51:45,280 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:51:45,281 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 00:51:45,281 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-11-30 00:51:45,281 INFO L429 AbstractCegarLoop]: === Iteration 6 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 00:51:45,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:51:45,282 INFO L82 PathProgramCache]: Analyzing trace with hash 1901638700, now seen corresponding path program 1 times [2020-11-30 00:51:45,282 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:51:45,283 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2076225318] [2020-11-30 00:51:45,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:51:45,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:51:45,401 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:51:45,401 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2076225318] [2020-11-30 00:51:45,401 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 00:51:45,402 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-30 00:51:45,402 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1793111714] [2020-11-30 00:51:45,402 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-30 00:51:45,402 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:51:45,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-30 00:51:45,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-30 00:51:45,403 INFO L87 Difference]: Start difference. First operand 1534 states and 5168 transitions. Second operand 4 states. [2020-11-30 00:51:45,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:51:45,503 INFO L93 Difference]: Finished difference Result 2258 states and 7350 transitions. [2020-11-30 00:51:45,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-30 00:51:45,504 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2020-11-30 00:51:45,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:51:45,520 INFO L225 Difference]: With dead ends: 2258 [2020-11-30 00:51:45,521 INFO L226 Difference]: Without dead ends: 1594 [2020-11-30 00:51:45,521 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:51:45,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1594 states. [2020-11-30 00:51:45,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1594 to 1498. [2020-11-30 00:51:45,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1498 states. [2020-11-30 00:51:45,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1498 states to 1498 states and 4814 transitions. [2020-11-30 00:51:45,586 INFO L78 Accepts]: Start accepts. Automaton has 1498 states and 4814 transitions. Word has length 19 [2020-11-30 00:51:45,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:51:45,586 INFO L481 AbstractCegarLoop]: Abstraction has 1498 states and 4814 transitions. [2020-11-30 00:51:45,586 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-30 00:51:45,587 INFO L276 IsEmpty]: Start isEmpty. Operand 1498 states and 4814 transitions. [2020-11-30 00:51:45,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-11-30 00:51:45,594 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:51:45,595 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 00:51:45,595 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-11-30 00:51:45,595 INFO L429 AbstractCegarLoop]: === Iteration 7 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 00:51:45,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:51:45,596 INFO L82 PathProgramCache]: Analyzing trace with hash 1871436876, now seen corresponding path program 1 times [2020-11-30 00:51:45,596 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:51:45,596 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1621788529] [2020-11-30 00:51:45,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:51:45,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:51:45,745 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:51:45,745 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1621788529] [2020-11-30 00:51:45,745 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 00:51:45,745 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-30 00:51:45,745 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [987830921] [2020-11-30 00:51:45,746 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-30 00:51:45,746 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:51:45,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-30 00:51:45,747 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-11-30 00:51:45,747 INFO L87 Difference]: Start difference. First operand 1498 states and 4814 transitions. Second operand 5 states. [2020-11-30 00:51:45,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:51:45,840 INFO L93 Difference]: Finished difference Result 2246 states and 7024 transitions. [2020-11-30 00:51:45,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-30 00:51:45,841 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2020-11-30 00:51:45,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:51:45,874 INFO L225 Difference]: With dead ends: 2246 [2020-11-30 00:51:45,878 INFO L226 Difference]: Without dead ends: 1618 [2020-11-30 00:51:45,879 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-11-30 00:51:45,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1618 states. [2020-11-30 00:51:45,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1618 to 1498. [2020-11-30 00:51:45,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1498 states. [2020-11-30 00:51:45,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1498 states to 1498 states and 4584 transitions. [2020-11-30 00:51:45,948 INFO L78 Accepts]: Start accepts. Automaton has 1498 states and 4584 transitions. Word has length 19 [2020-11-30 00:51:45,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:51:45,948 INFO L481 AbstractCegarLoop]: Abstraction has 1498 states and 4584 transitions. [2020-11-30 00:51:45,948 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-30 00:51:45,949 INFO L276 IsEmpty]: Start isEmpty. Operand 1498 states and 4584 transitions. [2020-11-30 00:51:45,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-11-30 00:51:45,953 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:51:45,953 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 00:51:45,953 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-11-30 00:51:45,954 INFO L429 AbstractCegarLoop]: === Iteration 8 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 00:51:45,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:51:45,955 INFO L82 PathProgramCache]: Analyzing trace with hash 14869666, now seen corresponding path program 1 times [2020-11-30 00:51:45,955 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:51:45,956 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [462127255] [2020-11-30 00:51:45,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:51:46,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:51:46,153 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:51:46,153 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [462127255] [2020-11-30 00:51:46,153 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 00:51:46,153 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-30 00:51:46,154 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1447683213] [2020-11-30 00:51:46,154 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-30 00:51:46,154 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:51:46,154 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-30 00:51:46,155 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-11-30 00:51:46,155 INFO L87 Difference]: Start difference. First operand 1498 states and 4584 transitions. Second operand 5 states. [2020-11-30 00:51:46,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:51:46,233 INFO L93 Difference]: Finished difference Result 1276 states and 3534 transitions. [2020-11-30 00:51:46,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-30 00:51:46,234 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2020-11-30 00:51:46,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:51:46,238 INFO L225 Difference]: With dead ends: 1276 [2020-11-30 00:51:46,238 INFO L226 Difference]: Without dead ends: 976 [2020-11-30 00:51:46,240 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-11-30 00:51:46,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 976 states. [2020-11-30 00:51:46,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 976 to 976. [2020-11-30 00:51:46,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 976 states. [2020-11-30 00:51:46,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 976 states to 976 states and 2650 transitions. [2020-11-30 00:51:46,276 INFO L78 Accepts]: Start accepts. Automaton has 976 states and 2650 transitions. Word has length 19 [2020-11-30 00:51:46,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:51:46,277 INFO L481 AbstractCegarLoop]: Abstraction has 976 states and 2650 transitions. [2020-11-30 00:51:46,277 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-30 00:51:46,277 INFO L276 IsEmpty]: Start isEmpty. Operand 976 states and 2650 transitions. [2020-11-30 00:51:46,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-11-30 00:51:46,280 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:51:46,281 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:51:46,281 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-11-30 00:51:46,281 INFO L429 AbstractCegarLoop]: === Iteration 9 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 00:51:46,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:51:46,282 INFO L82 PathProgramCache]: Analyzing trace with hash 674412449, now seen corresponding path program 1 times [2020-11-30 00:51:46,282 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:51:46,284 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1357788379] [2020-11-30 00:51:46,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:51:46,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:51:46,495 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:51:46,495 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1357788379] [2020-11-30 00:51:46,495 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 00:51:46,495 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-11-30 00:51:46,495 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1276379183] [2020-11-30 00:51:46,496 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-30 00:51:46,496 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:51:46,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-30 00:51:46,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-11-30 00:51:46,497 INFO L87 Difference]: Start difference. First operand 976 states and 2650 transitions. Second operand 6 states. [2020-11-30 00:51:46,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:51:46,605 INFO L93 Difference]: Finished difference Result 835 states and 2214 transitions. [2020-11-30 00:51:46,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-30 00:51:46,607 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2020-11-30 00:51:46,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:51:46,609 INFO L225 Difference]: With dead ends: 835 [2020-11-30 00:51:46,609 INFO L226 Difference]: Without dead ends: 672 [2020-11-30 00:51:46,610 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-11-30 00:51:46,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 672 states. [2020-11-30 00:51:46,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 672 to 672. [2020-11-30 00:51:46,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 672 states. [2020-11-30 00:51:46,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 672 states to 672 states and 1758 transitions. [2020-11-30 00:51:46,636 INFO L78 Accepts]: Start accepts. Automaton has 672 states and 1758 transitions. Word has length 21 [2020-11-30 00:51:46,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:51:46,637 INFO L481 AbstractCegarLoop]: Abstraction has 672 states and 1758 transitions. [2020-11-30 00:51:46,637 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-30 00:51:46,637 INFO L276 IsEmpty]: Start isEmpty. Operand 672 states and 1758 transitions. [2020-11-30 00:51:46,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-11-30 00:51:46,640 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:51:46,640 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 00:51:46,640 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-11-30 00:51:46,640 INFO L429 AbstractCegarLoop]: === Iteration 10 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 00:51:46,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:51:46,641 INFO L82 PathProgramCache]: Analyzing trace with hash 1623272586, now seen corresponding path program 1 times [2020-11-30 00:51:46,641 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:51:46,641 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [399862761] [2020-11-30 00:51:46,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:51:46,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:51:46,876 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:51:46,877 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [399862761] [2020-11-30 00:51:46,877 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 00:51:46,877 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-11-30 00:51:46,877 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2055883299] [2020-11-30 00:51:46,878 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-11-30 00:51:46,878 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:51:46,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-30 00:51:46,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-11-30 00:51:46,879 INFO L87 Difference]: Start difference. First operand 672 states and 1758 transitions. Second operand 7 states. [2020-11-30 00:51:47,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:51:47,032 INFO L93 Difference]: Finished difference Result 638 states and 1690 transitions. [2020-11-30 00:51:47,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-30 00:51:47,033 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 24 [2020-11-30 00:51:47,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:51:47,034 INFO L225 Difference]: With dead ends: 638 [2020-11-30 00:51:47,034 INFO L226 Difference]: Without dead ends: 242 [2020-11-30 00:51:47,035 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2020-11-30 00:51:47,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2020-11-30 00:51:47,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 242. [2020-11-30 00:51:47,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 242 states. [2020-11-30 00:51:47,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 598 transitions. [2020-11-30 00:51:47,046 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 598 transitions. Word has length 24 [2020-11-30 00:51:47,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:51:47,047 INFO L481 AbstractCegarLoop]: Abstraction has 242 states and 598 transitions. [2020-11-30 00:51:47,047 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-11-30 00:51:47,047 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 598 transitions. [2020-11-30 00:51:47,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-11-30 00:51:47,048 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:51:47,049 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 00:51:47,049 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-11-30 00:51:47,049 INFO L429 AbstractCegarLoop]: === Iteration 11 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 00:51:47,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:51:47,050 INFO L82 PathProgramCache]: Analyzing trace with hash 617818840, now seen corresponding path program 1 times [2020-11-30 00:51:47,050 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:51:47,050 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1333719068] [2020-11-30 00:51:47,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:51:47,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:51:47,199 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:51:47,199 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1333719068] [2020-11-30 00:51:47,199 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 00:51:47,199 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-30 00:51:47,200 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [691291891] [2020-11-30 00:51:47,200 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-30 00:51:47,200 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:51:47,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-30 00:51:47,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-11-30 00:51:47,201 INFO L87 Difference]: Start difference. First operand 242 states and 598 transitions. Second operand 5 states. [2020-11-30 00:51:47,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:51:47,249 INFO L93 Difference]: Finished difference Result 320 states and 780 transitions. [2020-11-30 00:51:47,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-30 00:51:47,250 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2020-11-30 00:51:47,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:51:47,251 INFO L225 Difference]: With dead ends: 320 [2020-11-30 00:51:47,251 INFO L226 Difference]: Without dead ends: 93 [2020-11-30 00:51:47,251 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-11-30 00:51:47,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2020-11-30 00:51:47,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2020-11-30 00:51:47,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2020-11-30 00:51:47,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 199 transitions. [2020-11-30 00:51:47,255 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 199 transitions. Word has length 27 [2020-11-30 00:51:47,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:51:47,256 INFO L481 AbstractCegarLoop]: Abstraction has 93 states and 199 transitions. [2020-11-30 00:51:47,256 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-30 00:51:47,256 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 199 transitions. [2020-11-30 00:51:47,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-11-30 00:51:47,260 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:51:47,260 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 00:51:47,261 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-11-30 00:51:47,261 INFO L429 AbstractCegarLoop]: === Iteration 12 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 00:51:47,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:51:47,262 INFO L82 PathProgramCache]: Analyzing trace with hash 1908645416, now seen corresponding path program 2 times [2020-11-30 00:51:47,262 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:51:47,262 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1542830528] [2020-11-30 00:51:47,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:51:47,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:51:47,688 WARN L193 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 31 [2020-11-30 00:51:47,833 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:51:47,833 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1542830528] [2020-11-30 00:51:47,833 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 00:51:47,833 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-11-30 00:51:47,834 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1241978460] [2020-11-30 00:51:47,834 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-11-30 00:51:47,834 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:51:47,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-11-30 00:51:47,835 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2020-11-30 00:51:47,835 INFO L87 Difference]: Start difference. First operand 93 states and 199 transitions. Second operand 8 states. [2020-11-30 00:51:48,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:51:48,133 INFO L93 Difference]: Finished difference Result 112 states and 234 transitions. [2020-11-30 00:51:48,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-11-30 00:51:48,134 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 27 [2020-11-30 00:51:48,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:51:48,135 INFO L225 Difference]: With dead ends: 112 [2020-11-30 00:51:48,135 INFO L226 Difference]: Without dead ends: 57 [2020-11-30 00:51:48,135 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2020-11-30 00:51:48,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2020-11-30 00:51:48,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2020-11-30 00:51:48,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2020-11-30 00:51:48,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 99 transitions. [2020-11-30 00:51:48,138 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 99 transitions. Word has length 27 [2020-11-30 00:51:48,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:51:48,138 INFO L481 AbstractCegarLoop]: Abstraction has 57 states and 99 transitions. [2020-11-30 00:51:48,138 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-11-30 00:51:48,138 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 99 transitions. [2020-11-30 00:51:48,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-11-30 00:51:48,138 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:51:48,139 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 00:51:48,139 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-11-30 00:51:48,139 INFO L429 AbstractCegarLoop]: === Iteration 13 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 00:51:48,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:51:48,139 INFO L82 PathProgramCache]: Analyzing trace with hash 1603522346, now seen corresponding path program 3 times [2020-11-30 00:51:48,140 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:51:48,140 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [693011380] [2020-11-30 00:51:48,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:51:48,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:51:48,198 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:51:48,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:51:48,276 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:51:48,348 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-30 00:51:48,348 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-11-30 00:51:48,348 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-11-30 00:51:48,388 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:51:48,389 WARN L224 RCFGBacktranslator]: unable to determine which branch was taken at C: __VERIFIER_atomic_begin() [814] [2020-11-30 00:51:48,389 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:51:48,390 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 00:51:48,390 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:51:48,390 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 00:51:48,390 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:51:48,390 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 00:51:48,391 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:51:48,391 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 00:51:48,391 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:51:48,391 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 00:51:48,392 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:51:48,392 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 00:51:48,392 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:51:48,392 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 00:51:48,392 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:51:48,393 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 00:51:48,393 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:51:48,393 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 00:51:48,393 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:51:48,394 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 00:51:48,394 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:51:48,394 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 00:51:48,394 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:51:48,394 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 00:51:48,395 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:51:48,395 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 00:51:48,395 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:51:48,395 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 00:51:48,398 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:51:48,398 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 00:51:48,398 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:51:48,398 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 00:51:48,399 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:51:48,399 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 00:51:48,399 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:51:48,399 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 00:51:48,400 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:51:48,400 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 00:51:48,400 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:51:48,400 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 00:51:48,400 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:51:48,401 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 00:51:48,401 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:51:48,401 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 00:51:48,401 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:51:48,401 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 00:51:48,402 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:51:48,402 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 00:51:48,402 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:51:48,402 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 00:51:48,403 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:51:48,403 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 00:51:48,403 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:51:48,403 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 00:51:48,404 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:51:48,404 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 00:51:48,404 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:51:48,404 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 00:51:48,405 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:51:48,405 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 00:51:48,405 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:51:48,405 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 00:51:48,406 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:51:48,407 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 00:51:48,407 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:51:48,407 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 00:51:48,407 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:51:48,408 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 00:51:48,408 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:51:48,408 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 00:51:48,408 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:51:48,408 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 00:51:48,409 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:51:48,409 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 00:51:48,556 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.11 12:51:48 BasicIcfg [2020-11-30 00:51:48,557 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-11-30 00:51:48,557 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-11-30 00:51:48,557 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-11-30 00:51:48,558 INFO L275 PluginConnector]: Witness Printer initialized [2020-11-30 00:51:48,558 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 12:51:33" (3/4) ... [2020-11-30 00:51:48,561 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2020-11-30 00:51:48,593 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:51:48,593 WARN L224 RCFGBacktranslator]: unable to determine which branch was taken at C: __VERIFIER_atomic_begin() [814] [2020-11-30 00:51:48,593 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:51:48,594 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 00:51:48,594 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:51:48,594 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 00:51:48,594 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:51:48,594 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 00:51:48,594 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:51:48,595 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 00:51:48,596 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:51:48,597 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 00:51:48,597 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:51:48,597 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 00:51:48,597 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:51:48,597 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 00:51:48,598 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:51:48,598 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 00:51:48,598 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:51:48,598 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 00:51:48,598 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:51:48,598 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 00:51:48,599 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:51:48,599 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 00:51:48,599 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:51:48,599 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 00:51:48,599 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:51:48,600 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 00:51:48,600 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:51:48,600 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 00:51:48,601 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:51:48,601 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 00:51:48,601 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:51:48,601 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 00:51:48,602 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:51:48,602 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 00:51:48,603 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:51:48,603 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 00:51:48,603 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:51:48,603 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 00:51:48,603 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:51:48,603 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 00:51:48,604 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:51:48,604 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 00:51:48,604 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:51:48,604 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 00:51:48,604 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:51:48,604 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 00:51:48,605 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:51:48,605 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 00:51:48,605 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:51:48,605 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 00:51:48,605 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:51:48,606 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 00:51:48,606 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:51:48,606 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 00:51:48,606 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:51:48,606 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 00:51:48,606 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:51:48,607 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 00:51:48,607 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:51:48,607 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 00:51:48,607 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:51:48,607 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 00:51:48,608 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:51:48,608 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 00:51:48,608 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:51:48,608 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 00:51:48,609 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:51:48,609 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 00:51:48,609 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:51:48,609 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 00:51:48,609 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:51:48,609 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 00:51:48,610 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:51:48,610 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 00:51:48,798 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_ceb58bf6-d8c1-46e8-b3a3-c042f12cb3da/bin/uautomizer/witness.graphml [2020-11-30 00:51:48,799 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-11-30 00:51:48,800 INFO L168 Benchmark]: Toolchain (without parser) took 20609.83 ms. Allocated memory was 88.1 MB in the beginning and 367.0 MB in the end (delta: 278.9 MB). Free memory was 56.5 MB in the beginning and 288.0 MB in the end (delta: -231.4 MB). Peak memory consumption was 229.0 MB. Max. memory is 16.1 GB. [2020-11-30 00:51:48,801 INFO L168 Benchmark]: CDTParser took 0.39 ms. Allocated memory is still 88.1 MB. Free memory was 47.8 MB in the beginning and 47.7 MB in the end (delta: 41.2 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-11-30 00:51:48,802 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1024.52 ms. Allocated memory was 88.1 MB in the beginning and 107.0 MB in the end (delta: 18.9 MB). Free memory was 56.5 MB in the beginning and 59.0 MB in the end (delta: -2.5 MB). Peak memory consumption was 16.8 MB. Max. memory is 16.1 GB. [2020-11-30 00:51:48,802 INFO L168 Benchmark]: Boogie Procedure Inliner took 128.27 ms. Allocated memory is still 107.0 MB. Free memory was 59.0 MB in the beginning and 56.4 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-11-30 00:51:48,803 INFO L168 Benchmark]: Boogie Preprocessor took 77.23 ms. Allocated memory is still 107.0 MB. Free memory was 56.4 MB in the beginning and 53.9 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-11-30 00:51:48,803 INFO L168 Benchmark]: RCFGBuilder took 4259.68 ms. Allocated memory was 107.0 MB in the beginning and 130.0 MB in the end (delta: 23.1 MB). Free memory was 53.9 MB in the beginning and 61.5 MB in the end (delta: -7.6 MB). Peak memory consumption was 46.2 MB. Max. memory is 16.1 GB. [2020-11-30 00:51:48,804 INFO L168 Benchmark]: TraceAbstraction took 14861.18 ms. Allocated memory was 130.0 MB in the beginning and 367.0 MB in the end (delta: 237.0 MB). Free memory was 61.5 MB in the beginning and 115.0 MB in the end (delta: -53.5 MB). Peak memory consumption was 183.5 MB. Max. memory is 16.1 GB. [2020-11-30 00:51:48,804 INFO L168 Benchmark]: Witness Printer took 241.66 ms. Allocated memory is still 367.0 MB. Free memory was 115.0 MB in the beginning and 288.0 MB in the end (delta: -173.0 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. [2020-11-30 00:51:48,808 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.39 ms. Allocated memory is still 88.1 MB. Free memory was 47.8 MB in the beginning and 47.7 MB in the end (delta: 41.2 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 1024.52 ms. Allocated memory was 88.1 MB in the beginning and 107.0 MB in the end (delta: 18.9 MB). Free memory was 56.5 MB in the beginning and 59.0 MB in the end (delta: -2.5 MB). Peak memory consumption was 16.8 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 128.27 ms. Allocated memory is still 107.0 MB. Free memory was 59.0 MB in the beginning and 56.4 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 77.23 ms. Allocated memory is still 107.0 MB. Free memory was 56.4 MB in the beginning and 53.9 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 4259.68 ms. Allocated memory was 107.0 MB in the beginning and 130.0 MB in the end (delta: 23.1 MB). Free memory was 53.9 MB in the beginning and 61.5 MB in the end (delta: -7.6 MB). Peak memory consumption was 46.2 MB. Max. memory is 16.1 GB. * TraceAbstraction took 14861.18 ms. Allocated memory was 130.0 MB in the beginning and 367.0 MB in the end (delta: 237.0 MB). Free memory was 61.5 MB in the beginning and 115.0 MB in the end (delta: -53.5 MB). Peak memory consumption was 183.5 MB. Max. memory is 16.1 GB. * Witness Printer took 241.66 ms. Allocated memory is still 367.0 MB. Free memory was 115.0 MB in the beginning and 288.0 MB in the end (delta: -173.0 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 1824 VarBasedMoverChecksPositive, 81 VarBasedMoverChecksNegative, 26 SemBasedMoverChecksPositive, 55 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 2.7s, 212 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 8.1s, 131 PlacesBefore, 46 PlacesAfterwards, 121 TransitionsBefore, 34 TransitionsAfterwards, 2726 CoEnabledTransitionPairs, 7 FixpointIterations, 42 TrivialSequentialCompositions, 53 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 8 ConcurrentYvCompositions, 2 ChoiceCompositions, 105 TotalNumberOfCompositions, 7617 MoverChecksTotal - CounterExampleResult [Line: 17]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p1_EAX = 0; [L714] 0 int __unbuffered_p2_EAX = 0; [L716] 0 int __unbuffered_p2_EBX = 0; [L718] 0 int __unbuffered_p3_EAX = 0; [L720] 0 int __unbuffered_p3_EBX = 0; [L722] 0 int a = 0; [L723] 0 _Bool main$tmp_guard0; [L724] 0 _Bool main$tmp_guard1; [L726] 0 int x = 0; [L728] 0 int y = 0; [L730] 0 int z = 0; [L731] 0 _Bool z$flush_delayed; [L732] 0 int z$mem_tmp; [L733] 0 _Bool z$r_buff0_thd0; [L734] 0 _Bool z$r_buff0_thd1; [L735] 0 _Bool z$r_buff0_thd2; [L736] 0 _Bool z$r_buff0_thd3; [L737] 0 _Bool z$r_buff0_thd4; [L738] 0 _Bool z$r_buff1_thd0; [L739] 0 _Bool z$r_buff1_thd1; [L740] 0 _Bool z$r_buff1_thd2; [L741] 0 _Bool z$r_buff1_thd3; [L742] 0 _Bool z$r_buff1_thd4; [L743] 0 _Bool z$read_delayed; [L744] 0 int *z$read_delayed_var; [L745] 0 int z$w_buff0; [L746] 0 _Bool z$w_buff0_used; [L747] 0 int z$w_buff1; [L748] 0 _Bool z$w_buff1_used; [L749] 0 _Bool weak$$choice0; [L750] 0 _Bool weak$$choice2; [L869] 0 pthread_t t149; [L870] FCALL, FORK 0 pthread_create(&t149, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_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_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L871] 0 pthread_t t150; [L872] FCALL, FORK 0 pthread_create(&t150, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_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_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L873] 0 pthread_t t151; [L874] FCALL, FORK 0 pthread_create(&t151, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, 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_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L875] 0 pthread_t t152; [L876] FCALL, FORK 0 pthread_create(&t152, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, 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_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L815] 4 z$w_buff1 = z$w_buff0 [L816] 4 z$w_buff0 = 1 [L817] 4 z$w_buff1_used = z$w_buff0_used [L818] 4 z$w_buff0_used = (_Bool)1 [L18] COND FALSE 4 !(!expression) [L820] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L821] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L822] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L823] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L824] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L825] 4 z$r_buff0_thd4 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, 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_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L829] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L830] 4 z$flush_delayed = weak$$choice2 [L831] 4 z$mem_tmp = z [L832] EXPR 4 !z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff1) [L832] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff1 [L832] EXPR 4 !z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff1) [L832] 4 z = !z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff1) [L833] EXPR 4 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff0)) [L833] EXPR 4 !z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff0) [L833] EXPR 4 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff0)) [L833] 4 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff0)) [L834] EXPR 4 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff1 : z$w_buff1)) [L834] EXPR 4 !z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff1 : z$w_buff1) [L834] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff1 : z$w_buff1 [L834] EXPR 4 !z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff1 : z$w_buff1) [L834] EXPR 4 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff1 : z$w_buff1)) [L834] 4 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff1 : z$w_buff1)) [L835] EXPR 4 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used)) [L835] 4 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used)) [L836] EXPR 4 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L836] EXPR 4 !z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0) [L836] EXPR 4 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L836] 4 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L837] EXPR 4 weak$$choice2 ? z$r_buff0_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff0_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4)) [L837] 4 z$r_buff0_thd4 = weak$$choice2 ? z$r_buff0_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff0_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4)) [L838] EXPR 4 weak$$choice2 ? z$r_buff1_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff1_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L838] EXPR 4 !z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff1_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0) [L838] EXPR 4 weak$$choice2 ? z$r_buff1_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff1_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L838] 4 z$r_buff1_thd4 = weak$$choice2 ? z$r_buff1_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff1_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L839] 4 __unbuffered_p3_EAX = z [L840] EXPR 4 z$flush_delayed ? z$mem_tmp : z [L840] 4 z = z$flush_delayed ? z$mem_tmp : z [L841] 4 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=4, 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=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L844] 4 __unbuffered_p3_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=4, 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=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_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=4, 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=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L757] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_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=4, 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=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L762] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L764] 1 return 0; [L769] 2 x = 2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=4, weak$$choice2=1, x=2, 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_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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 __unbuffered_p1_EAX = y VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=4, weak$$choice2=1, x=2, 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_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L777] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L779] 2 return 0; [L784] 3 y = 1 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=4, weak$$choice2=1, x=2, 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=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L787] 3 __unbuffered_p2_EAX = y VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=4, weak$$choice2=1, x=2, 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=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L790] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L791] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L792] 3 z$flush_delayed = weak$$choice2 [L793] 3 z$mem_tmp = z [L794] 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) [L794] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1 [L794] 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) [L794] 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) [L795] 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)) [L795] 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)) [L796] 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)) [L796] 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)) [L797] 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)) [L797] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used) [L797] 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)) [L797] 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)) [L798] 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)) [L798] 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)) [L799] 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)) [L799] 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)) [L800] 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)) [L800] 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) [L800] 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)) [L800] 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)) [L801] 3 __unbuffered_p2_EBX = z [L802] EXPR 3 z$flush_delayed ? z$mem_tmp : z [L802] 3 z = z$flush_delayed ? z$mem_tmp : z [L803] 3 z$flush_delayed = (_Bool)0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=255, x=2, 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=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L847] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L847] EXPR 4 z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z [L847] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L847] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L848] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L848] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L849] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L849] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L850] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L850] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L851] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 [L851] 4 z$r_buff1_thd4 = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 [L808] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L810] 3 return 0; [L854] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L856] 4 return 0; [L878] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=255, x=2, 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=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L3] COND FALSE 0 !(!cond) [L882] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L882] EXPR 0 z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z [L882] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L882] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L883] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L883] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L884] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L884] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L885] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L885] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L886] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L886] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L889] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L18] COND TRUE 0 !expression [L17] COND FALSE 0 !(0) [L17] 0 __assert_fail ("0", "mix005_tso.opt.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=255, x=2, 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=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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 5 procedures, 119 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 14.4s, OverallIterations: 13, TraceHistogramMax: 1, AutomataDifference: 1.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 8.5s, HoareTripleCheckerStatistics: 426 SDtfs, 672 SDslu, 799 SDs, 0 SdLazy, 184 SolverSat, 90 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 65 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3562occurred 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: 1.0s AutomataMinimizationTime, 12 MinimizatonAttempts, 216 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 251 NumberOfCodeBlocks, 251 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 212 ConstructedInterpolants, 0 QuantifiedInterpolants, 23115 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 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...