./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix043_rmo.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_70186b58-838b-4b97-a306-52a1358b71f4/bin/utaipan/data/config -Xmx15G -Xms4m -jar /tmp/vcloud-vcloud-master/worker/run_dir_70186b58-838b-4b97-a306-52a1358b71f4/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_70186b58-838b-4b97-a306-52a1358b71f4/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_70186b58-838b-4b97-a306-52a1358b71f4/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix043_rmo.opt.i -s /tmp/vcloud-vcloud-master/worker/run_dir_70186b58-838b-4b97-a306-52a1358b71f4/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_70186b58-838b-4b97-a306-52a1358b71f4/bin/utaipan --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c65ecaf753542f03caed436b8096b879abe036b5 ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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-28 07:41:32,481 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-28 07:41:32,483 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-28 07:41:32,561 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-28 07:41:32,561 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-28 07:41:32,562 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-28 07:41:32,564 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-28 07:41:32,567 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-28 07:41:32,579 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-28 07:41:32,581 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-28 07:41:32,582 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-28 07:41:32,583 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-28 07:41:32,584 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-28 07:41:32,585 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-28 07:41:32,587 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-28 07:41:32,588 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-28 07:41:32,589 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-28 07:41:32,591 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-28 07:41:32,593 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-28 07:41:32,596 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-28 07:41:32,598 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-28 07:41:32,599 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-28 07:41:32,600 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-28 07:41:32,601 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-28 07:41:32,605 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-28 07:41:32,605 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-28 07:41:32,606 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-28 07:41:32,607 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-28 07:41:32,607 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-28 07:41:32,609 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-28 07:41:32,609 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-28 07:41:32,610 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-28 07:41:32,611 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-28 07:41:32,612 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-28 07:41:32,613 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-28 07:41:32,614 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-28 07:41:32,615 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-28 07:41:32,615 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-28 07:41:32,615 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-28 07:41:32,617 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-28 07:41:32,618 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-28 07:41:32,620 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_70186b58-838b-4b97-a306-52a1358b71f4/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2020-11-28 07:41:32,657 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-28 07:41:32,658 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-28 07:41:32,659 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2020-11-28 07:41:32,660 INFO L138 SettingsManager]: * User list type=DISABLED [2020-11-28 07:41:32,660 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2020-11-28 07:41:32,660 INFO L138 SettingsManager]: * Explicit value domain=true [2020-11-28 07:41:32,660 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2020-11-28 07:41:32,660 INFO L138 SettingsManager]: * Octagon Domain=false [2020-11-28 07:41:32,660 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2020-11-28 07:41:32,661 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2020-11-28 07:41:32,662 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2020-11-28 07:41:32,662 INFO L138 SettingsManager]: * Interval Domain=false [2020-11-28 07:41:32,662 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2020-11-28 07:41:32,662 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2020-11-28 07:41:32,662 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2020-11-28 07:41:32,663 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-28 07:41:32,663 INFO L138 SettingsManager]: * sizeof long=4 [2020-11-28 07:41:32,663 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-11-28 07:41:32,664 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-11-28 07:41:32,664 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-28 07:41:32,664 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-11-28 07:41:32,664 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-11-28 07:41:32,664 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-11-28 07:41:32,665 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2020-11-28 07:41:32,665 INFO L138 SettingsManager]: * sizeof long double=12 [2020-11-28 07:41:32,665 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-11-28 07:41:32,665 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-28 07:41:32,665 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-11-28 07:41:32,665 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-28 07:41:32,667 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-11-28 07:41:32,667 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-11-28 07:41:32,667 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-28 07:41:32,668 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-28 07:41:32,668 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-11-28 07:41:32,668 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-11-28 07:41:32,668 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2020-11-28 07:41:32,668 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-11-28 07:41:32,669 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-11-28 07:41:32,669 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-11-28 07:41:32,669 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-11-28 07:41:32,669 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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_70186b58-838b-4b97-a306-52a1358b71f4/bin/utaipan/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_70186b58-838b-4b97-a306-52a1358b71f4/bin/utaipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> c65ecaf753542f03caed436b8096b879abe036b5 [2020-11-28 07:41:32,954 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-28 07:41:32,979 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-28 07:41:32,981 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-28 07:41:32,992 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-28 07:41:32,994 INFO L275 PluginConnector]: CDTParser initialized [2020-11-28 07:41:32,994 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_70186b58-838b-4b97-a306-52a1358b71f4/bin/utaipan/../../sv-benchmarks/c/pthread-wmm/mix043_rmo.opt.i [2020-11-28 07:41:33,064 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_70186b58-838b-4b97-a306-52a1358b71f4/bin/utaipan/data/a4e8b8ad2/688195df3aa3468699ee070d6f0d8efd/FLAG17230d92d [2020-11-28 07:41:33,555 INFO L306 CDTParser]: Found 1 translation units. [2020-11-28 07:41:33,555 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_70186b58-838b-4b97-a306-52a1358b71f4/sv-benchmarks/c/pthread-wmm/mix043_rmo.opt.i [2020-11-28 07:41:33,578 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_70186b58-838b-4b97-a306-52a1358b71f4/bin/utaipan/data/a4e8b8ad2/688195df3aa3468699ee070d6f0d8efd/FLAG17230d92d [2020-11-28 07:41:34,078 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_70186b58-838b-4b97-a306-52a1358b71f4/bin/utaipan/data/a4e8b8ad2/688195df3aa3468699ee070d6f0d8efd [2020-11-28 07:41:34,081 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-28 07:41:34,082 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-11-28 07:41:34,084 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-28 07:41:34,084 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-28 07:41:34,087 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-28 07:41:34,088 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 07:41:34" (1/1) ... [2020-11-28 07:41:34,090 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@73de6deb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 07:41:34, skipping insertion in model container [2020-11-28 07:41:34,091 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 07:41:34" (1/1) ... [2020-11-28 07:41:34,098 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-11-28 07:41:34,146 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-28 07:41:34,557 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-28 07:41:34,572 INFO L203 MainTranslator]: Completed pre-run [2020-11-28 07:41:34,666 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-28 07:41:34,772 INFO L208 MainTranslator]: Completed translation [2020-11-28 07:41:34,773 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 07:41:34 WrapperNode [2020-11-28 07:41:34,776 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-28 07:41:34,778 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-11-28 07:41:34,778 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-11-28 07:41:34,778 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-11-28 07:41:34,786 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 07:41:34" (1/1) ... [2020-11-28 07:41:34,821 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 07:41:34" (1/1) ... [2020-11-28 07:41:34,890 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-11-28 07:41:34,891 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-11-28 07:41:34,891 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-11-28 07:41:34,891 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-11-28 07:41:34,903 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 07:41:34" (1/1) ... [2020-11-28 07:41:34,904 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 07:41:34" (1/1) ... [2020-11-28 07:41:34,918 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 07:41:34" (1/1) ... [2020-11-28 07:41:34,918 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 07:41:34" (1/1) ... [2020-11-28 07:41:34,929 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 07:41:34" (1/1) ... [2020-11-28 07:41:34,933 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 07:41:34" (1/1) ... [2020-11-28 07:41:34,936 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 07:41:34" (1/1) ... [2020-11-28 07:41:34,941 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-11-28 07:41:34,942 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-11-28 07:41:34,942 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-11-28 07:41:34,942 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-11-28 07:41:34,943 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 07:41:34" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_70186b58-838b-4b97-a306-52a1358b71f4/bin/utaipan/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-28 07:41:35,028 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-11-28 07:41:35,029 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-11-28 07:41:35,029 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-11-28 07:41:35,029 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-11-28 07:41:35,029 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-11-28 07:41:35,029 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-11-28 07:41:35,029 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-11-28 07:41:35,030 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-11-28 07:41:35,031 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-11-28 07:41:35,032 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-11-28 07:41:35,032 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2020-11-28 07:41:35,032 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2020-11-28 07:41:35,032 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-11-28 07:41:35,032 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-11-28 07:41:35,032 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-11-28 07:41:35,032 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-11-28 07:41:35,034 WARN L208 CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-11-28 07:41:37,709 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-11-28 07:41:37,709 INFO L298 CfgBuilder]: Removed 14 assume(true) statements. [2020-11-28 07:41:37,711 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 07:41:37 BoogieIcfgContainer [2020-11-28 07:41:37,711 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-11-28 07:41:37,713 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-11-28 07:41:37,713 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-11-28 07:41:37,717 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-11-28 07:41:37,717 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 07:41:34" (1/3) ... [2020-11-28 07:41:37,718 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1803bc0d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 07:41:37, skipping insertion in model container [2020-11-28 07:41:37,718 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 07:41:34" (2/3) ... [2020-11-28 07:41:37,719 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1803bc0d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 07:41:37, skipping insertion in model container [2020-11-28 07:41:37,719 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 07:41:37" (3/3) ... [2020-11-28 07:41:37,720 INFO L111 eAbstractionObserver]: Analyzing ICFG mix043_rmo.opt.i [2020-11-28 07:41:37,731 WARN L153 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-11-28 07:41:37,732 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-11-28 07:41:37,738 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-11-28 07:41:37,739 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-11-28 07:41:37,772 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:41:37,772 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:41:37,773 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:41:37,773 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:41:37,773 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:41:37,773 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:41:37,774 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:41:37,774 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:41:37,774 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:41:37,774 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:41:37,775 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:41:37,775 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:41:37,775 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:41:37,776 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:41:37,776 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:41:37,776 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:41:37,776 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:41:37,777 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:41:37,777 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:41:37,777 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:41:37,777 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:41:37,777 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:41:37,777 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:41:37,778 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:41:37,779 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:41:37,780 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:41:37,780 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:41:37,780 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:41:37,780 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:41:37,781 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:41:37,781 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:41:37,781 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:41:37,781 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:41:37,782 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:41:37,782 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:41:37,782 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:41:37,782 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:41:37,782 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:41:37,782 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:41:37,783 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:41:37,783 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:41:37,783 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:41:37,783 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:41:37,784 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:41:37,784 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:41:37,784 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:41:37,785 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:41:37,785 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:41:37,787 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:41:37,787 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:41:37,787 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:41:37,788 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:41:37,788 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:41:37,788 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:41:37,788 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:41:37,788 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:41:37,789 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:41:37,789 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:41:37,791 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:41:37,791 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:41:37,791 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:41:37,792 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:41:37,792 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:41:37,792 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:41:37,792 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:41:37,792 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:41:37,792 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:41:37,793 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:41:37,793 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:41:37,793 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:41:37,793 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:41:37,793 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:41:37,795 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:41:37,795 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:41:37,796 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:41:37,796 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:41:37,798 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:41:37,798 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:41:37,798 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:41:37,798 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:41:37,800 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2020-11-28 07:41:37,811 INFO L253 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2020-11-28 07:41:37,840 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-11-28 07:41:37,841 INFO L378 AbstractCegarLoop]: Hoare is true [2020-11-28 07:41:37,841 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-11-28 07:41:37,841 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-11-28 07:41:37,841 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-11-28 07:41:37,842 INFO L382 AbstractCegarLoop]: Difference is false [2020-11-28 07:41:37,842 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-11-28 07:41:37,842 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-11-28 07:41:37,860 INFO L129 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2020-11-28 07:41:37,862 INFO L144 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 132 places, 122 transitions, 264 flow [2020-11-28 07:41:37,871 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 132 places, 122 transitions, 264 flow [2020-11-28 07:41:37,873 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 132 places, 122 transitions, 264 flow [2020-11-28 07:41:37,945 INFO L129 PetriNetUnfolder]: 3/118 cut-off events. [2020-11-28 07:41:37,946 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-11-28 07:41:37,951 INFO L80 FinitePrefix]: Finished finitePrefix Result has 131 conditions, 118 events. 3/118 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 90 event pairs, 0 based on Foata normal form. 0/113 useless extension candidates. Maximal degree in co-relation 80. Up to 2 conditions per place. [2020-11-28 07:41:37,959 INFO L116 LiptonReduction]: Number of co-enabled transitions 2830 [2020-11-28 07:41:38,084 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 07:41:38,088 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 07:41:38,090 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 07:41:38,091 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 07:41:38,096 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-28 07:41:38,099 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 07:41:38,105 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-28 07:41:38,107 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 07:41:38,150 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-28 07:41:38,150 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 07:41:38,152 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 07:41:38,152 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 07:41:38,158 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-28 07:41:38,159 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 07:41:38,164 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-28 07:41:38,166 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 07:41:38,520 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 07:41:38,521 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 07:41:38,522 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 07:41:38,522 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 07:41:38,532 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-28 07:41:38,532 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 07:41:38,535 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-28 07:41:38,536 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 07:41:38,574 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 07:41:38,575 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 07:41:38,576 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 07:41:38,577 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 07:41:38,580 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-28 07:41:38,580 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 07:41:38,585 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-28 07:41:38,586 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 07:41:38,807 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term [2020-11-28 07:41:38,807 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 07:41:38,808 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-11-28 07:41:38,809 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 07:41:38,838 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term [2020-11-28 07:41:38,838 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 07:41:38,839 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-11-28 07:41:38,840 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 07:41:40,282 WARN L193 SmtUtils]: Spent 1.41 s on a formula simplification. DAG size of input: 230 DAG size of output: 190 [2020-11-28 07:41:40,328 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 2, 1] term [2020-11-28 07:41:40,328 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 07:41:40,329 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-11-28 07:41:40,329 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 07:41:42,063 WARN L193 SmtUtils]: Spent 1.71 s on a formula simplification. DAG size of input: 148 DAG size of output: 128 [2020-11-28 07:41:42,359 WARN L193 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 51 [2020-11-28 07:41:42,406 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 07:41:42,406 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 07:41:42,407 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 07:41:42,407 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 07:41:42,410 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-28 07:41:42,410 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 07:41:42,412 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-28 07:41:42,413 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 07:41:42,437 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-28 07:41:42,437 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 07:41:42,438 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 07:41:42,439 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 07:41:42,441 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-28 07:41:42,441 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 07:41:42,443 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-28 07:41:42,443 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 07:41:42,613 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 07:41:42,613 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 07:41:42,615 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 07:41:42,615 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 07:41:42,618 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-28 07:41:42,618 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 07:41:42,621 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-28 07:41:42,621 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 07:41:42,660 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-28 07:41:42,660 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 07:41:42,661 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 07:41:42,662 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 07:41:42,664 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-28 07:41:42,665 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 07:41:42,667 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-28 07:41:42,667 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 07:41:43,062 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-11-28 07:41:43,063 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 07:41:43,172 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-11-28 07:41:43,172 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 07:41:43,886 WARN L193 SmtUtils]: Spent 339.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 60 [2020-11-28 07:41:44,685 WARN L193 SmtUtils]: Spent 423.00 ms on a formula simplification that was a NOOP. DAG size: 128 [2020-11-28 07:41:45,048 WARN L193 SmtUtils]: Spent 359.00 ms on a formula simplification that was a NOOP. DAG size: 128 [2020-11-28 07:41:45,076 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-11-28 07:41:45,076 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 07:41:45,259 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-28 07:41:45,259 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 07:41:45,260 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 07:41:45,261 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 07:41:45,263 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-28 07:41:45,266 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 07:41:45,268 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-28 07:41:45,268 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 07:41:45,283 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-28 07:41:45,284 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 07:41:45,285 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 07:41:45,285 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 07:41:45,287 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-28 07:41:45,287 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 07:41:45,289 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-28 07:41:45,289 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 07:41:45,388 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 07:41:45,388 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 07:41:45,389 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 07:41:45,389 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 07:41:45,391 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-28 07:41:45,392 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 07:41:45,394 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-28 07:41:45,394 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 07:41:45,411 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-28 07:41:45,411 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 07:41:45,412 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 07:41:45,412 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 07:41:45,414 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-28 07:41:45,414 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 07:41:45,416 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-11-28 07:41:45,416 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 07:41:45,501 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-28 07:41:45,502 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 07:41:45,503 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 07:41:45,503 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 07:41:45,505 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-28 07:41:45,506 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 07:41:45,508 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-28 07:41:45,508 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 07:41:45,537 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 07:41:45,538 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 07:41:45,538 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 07:41:45,539 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 07:41:45,541 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-28 07:41:45,541 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 07:41:45,543 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-28 07:41:45,544 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 07:41:46,996 WARN L193 SmtUtils]: Spent 1.09 s on a formula simplification. DAG size of input: 131 DAG size of output: 113 [2020-11-28 07:41:47,340 WARN L193 SmtUtils]: Spent 341.00 ms on a formula simplification that was a NOOP. DAG size: 110 [2020-11-28 07:41:47,616 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 8, 3, 8, 2, 2, 1] term [2020-11-28 07:41:47,616 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 07:41:47,617 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 8, 2, 3, 2, 1] term [2020-11-28 07:41:47,618 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 07:41:47,618 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 07:41:47,619 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 07:41:47,620 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 07:41:47,620 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 07:41:47,622 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 8, 3, 8, 3, 3, 2, 3, 2, 3, 2, 1] term [2020-11-28 07:41:47,622 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 07:41:47,624 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 8, 3, 8, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-28 07:41:47,625 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 07:41:47,626 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 8, 3, 8, 3, 2, 2, 1] term [2020-11-28 07:41:47,627 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 07:41:47,629 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 8, 3, 8, 3, 8, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-28 07:41:47,629 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 07:41:47,631 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 8, 3, 8, 3, 8, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-28 07:41:47,635 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 07:41:47,659 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 8, 3, 8, 3, 2, 2, 1] term [2020-11-28 07:41:47,659 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-28 07:41:47,661 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 8, 3, 8, 3, 2, 2, 1] term [2020-11-28 07:41:47,662 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 07:41:47,797 WARN L193 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 65 [2020-11-28 07:41:49,793 WARN L193 SmtUtils]: Spent 1.69 s on a formula simplification. DAG size of input: 145 DAG size of output: 136 [2020-11-28 07:41:50,778 WARN L193 SmtUtils]: Spent 983.00 ms on a formula simplification. DAG size of input: 133 DAG size of output: 132 [2020-11-28 07:41:50,969 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 8, 3, 8, 2, 2, 1] term [2020-11-28 07:41:50,969 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 07:41:50,970 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 8, 2, 3, 2, 1] term [2020-11-28 07:41:50,970 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 07:41:50,971 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 07:41:50,971 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 07:41:50,972 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 07:41:50,973 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 07:41:50,974 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 8, 3, 8, 3, 3, 2, 3, 2, 3, 2, 1] term [2020-11-28 07:41:50,974 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 07:41:50,975 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 8, 3, 8, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-28 07:41:50,976 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 07:41:50,978 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 8, 3, 8, 3, 2, 2, 1] term [2020-11-28 07:41:50,978 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 07:41:50,987 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 8, 3, 8, 3, 8, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-28 07:41:50,987 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 07:41:50,989 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 8, 3, 8, 3, 8, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-28 07:41:50,989 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 07:41:51,011 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 8, 3, 8, 3, 2, 2, 1] term [2020-11-28 07:41:51,012 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-28 07:41:51,013 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 8, 3, 8, 3, 2, 2, 1] term [2020-11-28 07:41:51,013 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 07:41:51,040 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-28 07:41:51,040 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 07:41:51,041 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 07:41:51,041 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 07:41:51,043 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-28 07:41:51,043 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 07:41:51,045 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-11-28 07:41:51,045 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 07:41:51,060 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 07:41:51,060 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 07:41:51,061 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 07:41:51,061 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 07:41:51,063 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-28 07:41:51,063 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 07:41:51,065 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-28 07:41:51,065 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 07:41:51,101 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 8, 3, 8, 3, 2, 2, 1] term [2020-11-28 07:41:51,101 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-28 07:41:51,103 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 8, 3, 8, 3, 2, 2, 1] term [2020-11-28 07:41:51,103 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 07:41:51,124 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 8, 3, 8, 2, 2, 1] term [2020-11-28 07:41:51,125 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 07:41:51,125 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 8, 2, 3, 2, 1] term [2020-11-28 07:41:51,125 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 07:41:51,126 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 07:41:51,126 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 07:41:51,127 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 07:41:51,127 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 07:41:51,129 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 8, 3, 8, 3, 3, 2, 3, 2, 3, 2, 1] term [2020-11-28 07:41:51,129 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 07:41:51,130 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 8, 3, 8, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-28 07:41:51,131 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 07:41:51,133 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 8, 3, 8, 3, 2, 2, 1] term [2020-11-28 07:41:51,133 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 07:41:51,135 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 8, 3, 8, 3, 8, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-28 07:41:51,136 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 07:41:51,137 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 8, 3, 8, 3, 8, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-28 07:41:51,137 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 07:41:51,272 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 8, 3, 8, 3, 2, 2, 1] term [2020-11-28 07:41:51,272 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-28 07:41:51,274 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 8, 3, 8, 3, 2, 2, 1] term [2020-11-28 07:41:51,274 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 07:41:51,296 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 8, 3, 8, 2, 2, 1] term [2020-11-28 07:41:51,296 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 07:41:51,297 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 8, 2, 3, 2, 1] term [2020-11-28 07:41:51,298 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 07:41:51,298 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 07:41:51,299 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 07:41:51,299 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 07:41:51,300 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 07:41:51,301 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 8, 3, 8, 3, 3, 2, 3, 2, 3, 2, 1] term [2020-11-28 07:41:51,301 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 07:41:51,302 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 8, 3, 8, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-28 07:41:51,303 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 07:41:51,311 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 8, 3, 8, 3, 2, 2, 1] term [2020-11-28 07:41:51,311 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 07:41:51,312 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 8, 3, 8, 3, 8, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-28 07:41:51,313 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 07:41:51,314 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 8, 3, 8, 3, 8, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-28 07:41:51,314 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 07:41:51,930 WARN L193 SmtUtils]: Spent 513.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 126 [2020-11-28 07:41:52,156 WARN L193 SmtUtils]: Spent 224.00 ms on a formula simplification that was a NOOP. DAG size: 122 [2020-11-28 07:41:52,644 WARN L193 SmtUtils]: Spent 437.00 ms on a formula simplification that was a NOOP. DAG size: 140 [2020-11-28 07:41:53,050 WARN L193 SmtUtils]: Spent 403.00 ms on a formula simplification that was a NOOP. DAG size: 140 [2020-11-28 07:41:53,124 INFO L131 LiptonReduction]: Checked pairs total: 6354 [2020-11-28 07:41:53,124 INFO L133 LiptonReduction]: Total number of compositions: 103 [2020-11-28 07:41:53,130 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 45 places, 32 transitions, 84 flow [2020-11-28 07:41:53,376 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 3002 states. [2020-11-28 07:41:53,378 INFO L276 IsEmpty]: Start isEmpty. Operand 3002 states. [2020-11-28 07:41:53,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-11-28 07:41:53,390 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 07:41:53,390 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 07:41:53,397 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-28 07:41:53,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 07:41:53,404 INFO L82 PathProgramCache]: Analyzing trace with hash 2090102638, now seen corresponding path program 1 times [2020-11-28 07:41:53,413 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-28 07:41:53,414 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [406242521] [2020-11-28 07:41:53,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 07:41:53,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 07:41:53,687 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-28 07:41:53,688 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [406242521] [2020-11-28 07:41:53,688 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 07:41:53,689 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-11-28 07:41:53,689 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [456171512] [2020-11-28 07:41:53,694 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-28 07:41:53,694 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-28 07:41:53,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-28 07:41:53,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-28 07:41:53,713 INFO L87 Difference]: Start difference. First operand 3002 states. Second operand 3 states. [2020-11-28 07:41:53,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 07:41:53,892 INFO L93 Difference]: Finished difference Result 2602 states and 10064 transitions. [2020-11-28 07:41:53,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-28 07:41:53,897 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2020-11-28 07:41:53,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 07:41:53,955 INFO L225 Difference]: With dead ends: 2602 [2020-11-28 07:41:53,955 INFO L226 Difference]: Without dead ends: 2122 [2020-11-28 07:41:53,957 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-28 07:41:54,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2122 states. [2020-11-28 07:41:54,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2122 to 2122. [2020-11-28 07:41:54,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2122 states. [2020-11-28 07:41:54,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2122 states to 2122 states and 8080 transitions. [2020-11-28 07:41:54,164 INFO L78 Accepts]: Start accepts. Automaton has 2122 states and 8080 transitions. Word has length 9 [2020-11-28 07:41:54,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 07:41:54,165 INFO L481 AbstractCegarLoop]: Abstraction has 2122 states and 8080 transitions. [2020-11-28 07:41:54,165 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-28 07:41:54,165 INFO L276 IsEmpty]: Start isEmpty. Operand 2122 states and 8080 transitions. [2020-11-28 07:41:54,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-11-28 07:41:54,172 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 07:41:54,172 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 07:41:54,172 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-11-28 07:41:54,173 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-28 07:41:54,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 07:41:54,176 INFO L82 PathProgramCache]: Analyzing trace with hash -1455991290, now seen corresponding path program 1 times [2020-11-28 07:41:54,177 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-28 07:41:54,177 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1320037569] [2020-11-28 07:41:54,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 07:41:54,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 07:41:54,367 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-28 07:41:54,367 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1320037569] [2020-11-28 07:41:54,367 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 07:41:54,367 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-11-28 07:41:54,368 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [441657929] [2020-11-28 07:41:54,369 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-28 07:41:54,369 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-28 07:41:54,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-28 07:41:54,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-28 07:41:54,370 INFO L87 Difference]: Start difference. First operand 2122 states and 8080 transitions. Second operand 3 states. [2020-11-28 07:41:54,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 07:41:54,433 INFO L93 Difference]: Finished difference Result 2042 states and 7736 transitions. [2020-11-28 07:41:54,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-28 07:41:54,434 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2020-11-28 07:41:54,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 07:41:54,456 INFO L225 Difference]: With dead ends: 2042 [2020-11-28 07:41:54,456 INFO L226 Difference]: Without dead ends: 2042 [2020-11-28 07:41:54,457 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-28 07:41:54,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2042 states. [2020-11-28 07:41:54,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2042 to 2042. [2020-11-28 07:41:54,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2042 states. [2020-11-28 07:41:54,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2042 states to 2042 states and 7736 transitions. [2020-11-28 07:41:54,554 INFO L78 Accepts]: Start accepts. Automaton has 2042 states and 7736 transitions. Word has length 11 [2020-11-28 07:41:54,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 07:41:54,554 INFO L481 AbstractCegarLoop]: Abstraction has 2042 states and 7736 transitions. [2020-11-28 07:41:54,554 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-28 07:41:54,555 INFO L276 IsEmpty]: Start isEmpty. Operand 2042 states and 7736 transitions. [2020-11-28 07:41:54,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-11-28 07:41:54,560 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 07:41:54,561 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 07:41:54,561 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-11-28 07:41:54,561 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-28 07:41:54,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 07:41:54,571 INFO L82 PathProgramCache]: Analyzing trace with hash 2108909411, now seen corresponding path program 1 times [2020-11-28 07:41:54,571 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-28 07:41:54,571 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1823970191] [2020-11-28 07:41:54,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 07:41:54,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 07:41:54,694 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-28 07:41:54,695 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1823970191] [2020-11-28 07:41:54,695 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 07:41:54,695 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-11-28 07:41:54,695 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1030661166] [2020-11-28 07:41:54,696 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-28 07:41:54,696 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-28 07:41:54,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-28 07:41:54,696 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-11-28 07:41:54,696 INFO L87 Difference]: Start difference. First operand 2042 states and 7736 transitions. Second operand 4 states. [2020-11-28 07:41:54,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 07:41:54,797 INFO L93 Difference]: Finished difference Result 1962 states and 7392 transitions. [2020-11-28 07:41:54,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-28 07:41:54,798 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2020-11-28 07:41:54,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 07:41:54,818 INFO L225 Difference]: With dead ends: 1962 [2020-11-28 07:41:54,818 INFO L226 Difference]: Without dead ends: 1962 [2020-11-28 07:41:54,819 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-11-28 07:41:54,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1962 states. [2020-11-28 07:41:54,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1962 to 1962. [2020-11-28 07:41:54,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1962 states. [2020-11-28 07:41:54,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1962 states to 1962 states and 7392 transitions. [2020-11-28 07:41:54,909 INFO L78 Accepts]: Start accepts. Automaton has 1962 states and 7392 transitions. Word has length 12 [2020-11-28 07:41:54,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 07:41:54,909 INFO L481 AbstractCegarLoop]: Abstraction has 1962 states and 7392 transitions. [2020-11-28 07:41:54,910 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-28 07:41:54,910 INFO L276 IsEmpty]: Start isEmpty. Operand 1962 states and 7392 transitions. [2020-11-28 07:41:54,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-11-28 07:41:54,913 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 07:41:54,913 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 07:41:54,913 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-11-28 07:41:54,913 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-28 07:41:54,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 07:41:54,914 INFO L82 PathProgramCache]: Analyzing trace with hash 951680485, now seen corresponding path program 1 times [2020-11-28 07:41:54,914 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-28 07:41:54,915 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1237598284] [2020-11-28 07:41:54,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 07:41:54,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 07:41:55,146 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-28 07:41:55,146 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1237598284] [2020-11-28 07:41:55,146 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 07:41:55,147 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-28 07:41:55,147 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1480057882] [2020-11-28 07:41:55,147 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-28 07:41:55,147 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-28 07:41:55,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-28 07:41:55,148 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-11-28 07:41:55,148 INFO L87 Difference]: Start difference. First operand 1962 states and 7392 transitions. Second operand 5 states. [2020-11-28 07:41:55,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 07:41:55,240 INFO L93 Difference]: Finished difference Result 1898 states and 7104 transitions. [2020-11-28 07:41:55,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-28 07:41:55,242 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2020-11-28 07:41:55,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 07:41:55,261 INFO L225 Difference]: With dead ends: 1898 [2020-11-28 07:41:55,261 INFO L226 Difference]: Without dead ends: 1898 [2020-11-28 07:41:55,261 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-11-28 07:41:55,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1898 states. [2020-11-28 07:41:55,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1898 to 1898. [2020-11-28 07:41:55,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1898 states. [2020-11-28 07:41:55,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1898 states to 1898 states and 7104 transitions. [2020-11-28 07:41:55,338 INFO L78 Accepts]: Start accepts. Automaton has 1898 states and 7104 transitions. Word has length 13 [2020-11-28 07:41:55,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 07:41:55,338 INFO L481 AbstractCegarLoop]: Abstraction has 1898 states and 7104 transitions. [2020-11-28 07:41:55,338 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-28 07:41:55,338 INFO L276 IsEmpty]: Start isEmpty. Operand 1898 states and 7104 transitions. [2020-11-28 07:41:55,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-11-28 07:41:55,342 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 07:41:55,342 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 07:41:55,342 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-11-28 07:41:55,342 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-28 07:41:55,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 07:41:55,343 INFO L82 PathProgramCache]: Analyzing trace with hash 343190440, now seen corresponding path program 1 times [2020-11-28 07:41:55,343 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-28 07:41:55,343 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [271907358] [2020-11-28 07:41:55,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 07:41:55,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 07:41:55,635 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-28 07:41:55,635 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [271907358] [2020-11-28 07:41:55,635 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 07:41:55,635 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-28 07:41:55,636 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [607728118] [2020-11-28 07:41:55,636 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-28 07:41:55,636 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-28 07:41:55,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-28 07:41:55,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-11-28 07:41:55,637 INFO L87 Difference]: Start difference. First operand 1898 states and 7104 transitions. Second operand 6 states. [2020-11-28 07:41:55,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 07:41:55,994 INFO L93 Difference]: Finished difference Result 2154 states and 8016 transitions. [2020-11-28 07:41:55,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-28 07:41:55,995 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2020-11-28 07:41:55,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 07:41:56,052 INFO L225 Difference]: With dead ends: 2154 [2020-11-28 07:41:56,052 INFO L226 Difference]: Without dead ends: 2154 [2020-11-28 07:41:56,052 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-11-28 07:41:56,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2154 states. [2020-11-28 07:41:56,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2154 to 2154. [2020-11-28 07:41:56,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2154 states. [2020-11-28 07:41:56,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2154 states to 2154 states and 8016 transitions. [2020-11-28 07:41:56,136 INFO L78 Accepts]: Start accepts. Automaton has 2154 states and 8016 transitions. Word has length 15 [2020-11-28 07:41:56,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 07:41:56,137 INFO L481 AbstractCegarLoop]: Abstraction has 2154 states and 8016 transitions. [2020-11-28 07:41:56,137 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-28 07:41:56,137 INFO L276 IsEmpty]: Start isEmpty. Operand 2154 states and 8016 transitions. [2020-11-28 07:41:56,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-11-28 07:41:56,140 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 07:41:56,141 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 07:41:56,141 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-11-28 07:41:56,142 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-28 07:41:56,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 07:41:56,142 INFO L82 PathProgramCache]: Analyzing trace with hash -263159932, now seen corresponding path program 1 times [2020-11-28 07:41:56,142 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-28 07:41:56,143 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [569443756] [2020-11-28 07:41:56,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 07:41:56,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 07:41:56,255 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-28 07:41:56,256 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [569443756] [2020-11-28 07:41:56,256 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 07:41:56,256 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-28 07:41:56,256 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1902273113] [2020-11-28 07:41:56,256 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-28 07:41:56,256 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-28 07:41:56,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-28 07:41:56,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-28 07:41:56,257 INFO L87 Difference]: Start difference. First operand 2154 states and 8016 transitions. Second operand 4 states. [2020-11-28 07:41:56,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 07:41:56,324 INFO L93 Difference]: Finished difference Result 2262 states and 7675 transitions. [2020-11-28 07:41:56,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-28 07:41:56,325 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2020-11-28 07:41:56,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 07:41:56,340 INFO L225 Difference]: With dead ends: 2262 [2020-11-28 07:41:56,340 INFO L226 Difference]: Without dead ends: 1686 [2020-11-28 07:41:56,341 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-28 07:41:56,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1686 states. [2020-11-28 07:41:56,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1686 to 1686. [2020-11-28 07:41:56,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1686 states. [2020-11-28 07:41:56,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1686 states to 1686 states and 5676 transitions. [2020-11-28 07:41:56,399 INFO L78 Accepts]: Start accepts. Automaton has 1686 states and 5676 transitions. Word has length 15 [2020-11-28 07:41:56,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 07:41:56,400 INFO L481 AbstractCegarLoop]: Abstraction has 1686 states and 5676 transitions. [2020-11-28 07:41:56,400 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-28 07:41:56,400 INFO L276 IsEmpty]: Start isEmpty. Operand 1686 states and 5676 transitions. [2020-11-28 07:41:56,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-11-28 07:41:56,403 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 07:41:56,403 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 07:41:56,403 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-11-28 07:41:56,404 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-28 07:41:56,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 07:41:56,404 INFO L82 PathProgramCache]: Analyzing trace with hash 454346801, now seen corresponding path program 1 times [2020-11-28 07:41:56,404 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-28 07:41:56,405 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2133876867] [2020-11-28 07:41:56,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 07:41:56,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 07:41:56,529 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-28 07:41:56,529 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2133876867] [2020-11-28 07:41:56,529 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 07:41:56,529 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-28 07:41:56,529 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1139247024] [2020-11-28 07:41:56,530 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-28 07:41:56,530 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-28 07:41:56,530 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-28 07:41:56,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-11-28 07:41:56,530 INFO L87 Difference]: Start difference. First operand 1686 states and 5676 transitions. Second operand 5 states. [2020-11-28 07:41:56,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 07:41:56,612 INFO L93 Difference]: Finished difference Result 1464 states and 4522 transitions. [2020-11-28 07:41:56,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-28 07:41:56,613 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2020-11-28 07:41:56,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 07:41:56,627 INFO L225 Difference]: With dead ends: 1464 [2020-11-28 07:41:56,632 INFO L226 Difference]: Without dead ends: 1095 [2020-11-28 07:41:56,633 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-11-28 07:41:56,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1095 states. [2020-11-28 07:41:56,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1095 to 1095. [2020-11-28 07:41:56,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1095 states. [2020-11-28 07:41:56,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1095 states to 1095 states and 3312 transitions. [2020-11-28 07:41:56,667 INFO L78 Accepts]: Start accepts. Automaton has 1095 states and 3312 transitions. Word has length 16 [2020-11-28 07:41:56,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 07:41:56,667 INFO L481 AbstractCegarLoop]: Abstraction has 1095 states and 3312 transitions. [2020-11-28 07:41:56,668 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-28 07:41:56,668 INFO L276 IsEmpty]: Start isEmpty. Operand 1095 states and 3312 transitions. [2020-11-28 07:41:56,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-11-28 07:41:56,670 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 07:41:56,671 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-28 07:41:56,671 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-11-28 07:41:56,671 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-28 07:41:56,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 07:41:56,671 INFO L82 PathProgramCache]: Analyzing trace with hash 2006986927, now seen corresponding path program 1 times [2020-11-28 07:41:56,672 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-28 07:41:56,672 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2084595413] [2020-11-28 07:41:56,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 07:41:56,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 07:41:56,755 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-28 07:41:56,755 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2084595413] [2020-11-28 07:41:56,755 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 07:41:56,755 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-28 07:41:56,759 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1743793291] [2020-11-28 07:41:56,759 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-28 07:41:56,760 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-28 07:41:56,760 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-28 07:41:56,760 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-28 07:41:56,760 INFO L87 Difference]: Start difference. First operand 1095 states and 3312 transitions. Second operand 4 states. [2020-11-28 07:41:56,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 07:41:56,795 INFO L93 Difference]: Finished difference Result 1446 states and 4283 transitions. [2020-11-28 07:41:56,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-28 07:41:56,796 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2020-11-28 07:41:56,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 07:41:56,801 INFO L225 Difference]: With dead ends: 1446 [2020-11-28 07:41:56,801 INFO L226 Difference]: Without dead ends: 954 [2020-11-28 07:41:56,802 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-28 07:41:56,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 954 states. [2020-11-28 07:41:56,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 954 to 933. [2020-11-28 07:41:56,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 933 states. [2020-11-28 07:41:56,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 933 states to 933 states and 2678 transitions. [2020-11-28 07:41:56,831 INFO L78 Accepts]: Start accepts. Automaton has 933 states and 2678 transitions. Word has length 19 [2020-11-28 07:41:56,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 07:41:56,831 INFO L481 AbstractCegarLoop]: Abstraction has 933 states and 2678 transitions. [2020-11-28 07:41:56,831 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-28 07:41:56,831 INFO L276 IsEmpty]: Start isEmpty. Operand 933 states and 2678 transitions. [2020-11-28 07:41:56,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-11-28 07:41:56,836 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 07:41:56,836 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-28 07:41:56,836 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-11-28 07:41:56,837 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-28 07:41:56,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 07:41:56,837 INFO L82 PathProgramCache]: Analyzing trace with hash 262437935, now seen corresponding path program 1 times [2020-11-28 07:41:56,837 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-28 07:41:56,840 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1826684787] [2020-11-28 07:41:56,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 07:41:56,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 07:41:56,957 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-28 07:41:56,957 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1826684787] [2020-11-28 07:41:56,957 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 07:41:56,958 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-11-28 07:41:56,958 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [962413319] [2020-11-28 07:41:56,958 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-28 07:41:56,958 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-28 07:41:56,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-28 07:41:56,959 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-11-28 07:41:56,959 INFO L87 Difference]: Start difference. First operand 933 states and 2678 transitions. Second operand 6 states. [2020-11-28 07:41:57,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 07:41:57,049 INFO L93 Difference]: Finished difference Result 806 states and 2276 transitions. [2020-11-28 07:41:57,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-28 07:41:57,050 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2020-11-28 07:41:57,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 07:41:57,054 INFO L225 Difference]: With dead ends: 806 [2020-11-28 07:41:57,054 INFO L226 Difference]: Without dead ends: 704 [2020-11-28 07:41:57,054 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2020-11-28 07:41:57,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 704 states. [2020-11-28 07:41:57,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 704 to 704. [2020-11-28 07:41:57,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 704 states. [2020-11-28 07:41:57,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 704 states to 704 states and 2017 transitions. [2020-11-28 07:41:57,079 INFO L78 Accepts]: Start accepts. Automaton has 704 states and 2017 transitions. Word has length 19 [2020-11-28 07:41:57,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 07:41:57,080 INFO L481 AbstractCegarLoop]: Abstraction has 704 states and 2017 transitions. [2020-11-28 07:41:57,080 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-28 07:41:57,080 INFO L276 IsEmpty]: Start isEmpty. Operand 704 states and 2017 transitions. [2020-11-28 07:41:57,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-11-28 07:41:57,083 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 07:41:57,083 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] [2020-11-28 07:41:57,083 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-11-28 07:41:57,083 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-28 07:41:57,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 07:41:57,085 INFO L82 PathProgramCache]: Analyzing trace with hash 87479135, now seen corresponding path program 1 times [2020-11-28 07:41:57,085 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-28 07:41:57,085 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [846272837] [2020-11-28 07:41:57,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 07:41:57,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 07:41:57,201 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-28 07:41:57,201 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [846272837] [2020-11-28 07:41:57,201 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 07:41:57,201 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-11-28 07:41:57,202 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [647529738] [2020-11-28 07:41:57,202 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-28 07:41:57,202 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-28 07:41:57,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-28 07:41:57,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-11-28 07:41:57,203 INFO L87 Difference]: Start difference. First operand 704 states and 2017 transitions. Second operand 6 states. [2020-11-28 07:41:57,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 07:41:57,320 INFO L93 Difference]: Finished difference Result 1141 states and 3199 transitions. [2020-11-28 07:41:57,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-28 07:41:57,321 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2020-11-28 07:41:57,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 07:41:57,326 INFO L225 Difference]: With dead ends: 1141 [2020-11-28 07:41:57,326 INFO L226 Difference]: Without dead ends: 739 [2020-11-28 07:41:57,326 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2020-11-28 07:41:57,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 739 states. [2020-11-28 07:41:57,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 739 to 617. [2020-11-28 07:41:57,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 617 states. [2020-11-28 07:41:57,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 617 states to 617 states and 1627 transitions. [2020-11-28 07:41:57,357 INFO L78 Accepts]: Start accepts. Automaton has 617 states and 1627 transitions. Word has length 22 [2020-11-28 07:41:57,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 07:41:57,358 INFO L481 AbstractCegarLoop]: Abstraction has 617 states and 1627 transitions. [2020-11-28 07:41:57,358 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-28 07:41:57,358 INFO L276 IsEmpty]: Start isEmpty. Operand 617 states and 1627 transitions. [2020-11-28 07:41:57,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-11-28 07:41:57,361 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 07:41:57,361 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] [2020-11-28 07:41:57,361 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-11-28 07:41:57,361 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-28 07:41:57,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 07:41:57,362 INFO L82 PathProgramCache]: Analyzing trace with hash 123586923, now seen corresponding path program 2 times [2020-11-28 07:41:57,362 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-28 07:41:57,362 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1067378460] [2020-11-28 07:41:57,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 07:41:57,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 07:41:57,493 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-28 07:41:57,493 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1067378460] [2020-11-28 07:41:57,493 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 07:41:57,493 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-11-28 07:41:57,494 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1841001196] [2020-11-28 07:41:57,494 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-11-28 07:41:57,494 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-28 07:41:57,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-28 07:41:57,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-11-28 07:41:57,495 INFO L87 Difference]: Start difference. First operand 617 states and 1627 transitions. Second operand 7 states. [2020-11-28 07:41:57,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 07:41:57,595 INFO L93 Difference]: Finished difference Result 590 states and 1573 transitions. [2020-11-28 07:41:57,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-11-28 07:41:57,596 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 22 [2020-11-28 07:41:57,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 07:41:57,597 INFO L225 Difference]: With dead ends: 590 [2020-11-28 07:41:57,597 INFO L226 Difference]: Without dead ends: 208 [2020-11-28 07:41:57,598 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2020-11-28 07:41:57,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2020-11-28 07:41:57,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 184. [2020-11-28 07:41:57,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2020-11-28 07:41:57,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 454 transitions. [2020-11-28 07:41:57,611 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 454 transitions. Word has length 22 [2020-11-28 07:41:57,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 07:41:57,611 INFO L481 AbstractCegarLoop]: Abstraction has 184 states and 454 transitions. [2020-11-28 07:41:57,611 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-11-28 07:41:57,611 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 454 transitions. [2020-11-28 07:41:57,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-11-28 07:41:57,612 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 07:41:57,612 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] [2020-11-28 07:41:57,613 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-11-28 07:41:57,613 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-28 07:41:57,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 07:41:57,613 INFO L82 PathProgramCache]: Analyzing trace with hash 1913086796, now seen corresponding path program 1 times [2020-11-28 07:41:57,614 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-28 07:41:57,614 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [435013874] [2020-11-28 07:41:57,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 07:41:57,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 07:41:57,684 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-28 07:41:57,685 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [435013874] [2020-11-28 07:41:57,685 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 07:41:57,685 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-28 07:41:57,685 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1720910574] [2020-11-28 07:41:57,685 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-28 07:41:57,685 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-28 07:41:57,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-28 07:41:57,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-28 07:41:57,686 INFO L87 Difference]: Start difference. First operand 184 states and 454 transitions. Second operand 4 states. [2020-11-28 07:41:57,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 07:41:57,708 INFO L93 Difference]: Finished difference Result 234 states and 572 transitions. [2020-11-28 07:41:57,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-28 07:41:57,709 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 26 [2020-11-28 07:41:57,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 07:41:57,710 INFO L225 Difference]: With dead ends: 234 [2020-11-28 07:41:57,710 INFO L226 Difference]: Without dead ends: 92 [2020-11-28 07:41:57,710 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-28 07:41:57,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2020-11-28 07:41:57,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2020-11-28 07:41:57,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2020-11-28 07:41:57,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 198 transitions. [2020-11-28 07:41:57,713 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 198 transitions. Word has length 26 [2020-11-28 07:41:57,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 07:41:57,713 INFO L481 AbstractCegarLoop]: Abstraction has 92 states and 198 transitions. [2020-11-28 07:41:57,713 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-28 07:41:57,713 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 198 transitions. [2020-11-28 07:41:57,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-11-28 07:41:57,715 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 07:41:57,716 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] [2020-11-28 07:41:57,716 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-11-28 07:41:57,716 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-28 07:41:57,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 07:41:57,716 INFO L82 PathProgramCache]: Analyzing trace with hash -1384911540, now seen corresponding path program 2 times [2020-11-28 07:41:57,717 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-28 07:41:57,719 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [505113441] [2020-11-28 07:41:57,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 07:41:57,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 07:41:57,904 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-28 07:41:57,904 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [505113441] [2020-11-28 07:41:57,905 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 07:41:57,905 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-11-28 07:41:57,905 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1167135733] [2020-11-28 07:41:57,905 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-11-28 07:41:57,905 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-28 07:41:57,906 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-28 07:41:57,906 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-11-28 07:41:57,906 INFO L87 Difference]: Start difference. First operand 92 states and 198 transitions. Second operand 7 states. [2020-11-28 07:41:58,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 07:41:58,052 INFO L93 Difference]: Finished difference Result 118 states and 252 transitions. [2020-11-28 07:41:58,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-28 07:41:58,053 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 26 [2020-11-28 07:41:58,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 07:41:58,054 INFO L225 Difference]: With dead ends: 118 [2020-11-28 07:41:58,054 INFO L226 Difference]: Without dead ends: 64 [2020-11-28 07:41:58,054 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2020-11-28 07:41:58,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2020-11-28 07:41:58,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2020-11-28 07:41:58,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2020-11-28 07:41:58,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 122 transitions. [2020-11-28 07:41:58,057 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 122 transitions. Word has length 26 [2020-11-28 07:41:58,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 07:41:58,057 INFO L481 AbstractCegarLoop]: Abstraction has 64 states and 122 transitions. [2020-11-28 07:41:58,057 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-11-28 07:41:58,057 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 122 transitions. [2020-11-28 07:41:58,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-11-28 07:41:58,058 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 07:41:58,058 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] [2020-11-28 07:41:58,058 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-11-28 07:41:58,058 INFO L429 AbstractCegarLoop]: === Iteration 14 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 07:41:58,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 07:41:58,058 INFO L82 PathProgramCache]: Analyzing trace with hash -1866539124, now seen corresponding path program 3 times [2020-11-28 07:41:58,059 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-28 07:41:58,059 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1481681381] [2020-11-28 07:41:58,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 07:41:58,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 07:41:58,099 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 07:41:58,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 07:41:58,136 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 07:41:58,191 INFO L173 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2020-11-28 07:41:58,191 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-11-28 07:41:58,191 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-11-28 07:41:58,192 WARN L264 etLargeBlockEncoding]: Failed to translate choice composition: Branch encoders not available. [2020-11-28 07:41:58,211 WARN L124 codingBacktranslator]: Skipped backtranslation of ATE [1017] [1017] L2-->L866: Formula: (let ((.cse9 (= (mod ~z$w_buff1_used~0_In-651908632 256) 0)) (.cse8 (= 0 (mod ~z$r_buff1_thd0~0_In-651908632 256))) (.cse7 (= (mod ~z$r_buff0_thd0~0_In-651908632 256) 0)) (.cse6 (= (mod ~z$w_buff0_used~0_In-651908632 256) 0))) (let ((.cse5 (or .cse7 .cse6)) (.cse2 (or .cse9 .cse8)) (.cse0 (not .cse9)) (.cse1 (not .cse8)) (.cse3 (not .cse7)) (.cse4 (not .cse6))) (and (not (= ULTIMATE.start_assume_abort_if_not_~cond_Out-651908632 0)) (or (and .cse0 .cse1 (= ~z$w_buff1_used~0_Out-651908632 0)) (and .cse2 (= ~z$w_buff1_used~0_Out-651908632 ~z$w_buff1_used~0_In-651908632))) (= ~z$r_buff1_thd0~0_In-651908632 ~z$r_buff1_thd0~0_Out-651908632) (= ULTIMATE.start_assume_abort_if_not_~cond_Out-651908632 |ULTIMATE.start_assume_abort_if_not_#in~cond_In-651908632|) (or (and .cse3 (= 0 ~z$w_buff0_used~0_Out-651908632) .cse4) (and .cse5 (= ~z$w_buff0_used~0_In-651908632 ~z$w_buff0_used~0_Out-651908632))) (or (and .cse5 (or (and .cse2 (= ~z~0_In-651908632 ~z~0_Out-651908632)) (and .cse0 .cse1 (= ~z$w_buff1~0_In-651908632 ~z~0_Out-651908632)))) (and .cse3 (= ~z~0_Out-651908632 ~z$w_buff0~0_In-651908632) .cse4)) (= ~z$r_buff0_thd0~0_In-651908632 ~z$r_buff0_thd0~0_Out-651908632)))) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In-651908632|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-651908632, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-651908632, ~z$w_buff0~0=~z$w_buff0~0_In-651908632, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-651908632, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-651908632, ~z$w_buff1~0=~z$w_buff1~0_In-651908632, ~z~0=~z~0_In-651908632} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_Out-651908632, ~z$w_buff0~0=~z$w_buff0~0_In-651908632, ~z$w_buff1_used~0=~z$w_buff1_used~0_Out-651908632, ULTIMATE.start_main_#t~ite24=|ULTIMATE.start_main_#t~ite24_Out-651908632|, ULTIMATE.start_main_#t~ite25=|ULTIMATE.start_main_#t~ite25_Out-651908632|, ~z$w_buff1~0=~z$w_buff1~0_In-651908632, ULTIMATE.start_main_#t~ite26=|ULTIMATE.start_main_#t~ite26_Out-651908632|, ULTIMATE.start_main_#t~ite21=|ULTIMATE.start_main_#t~ite21_Out-651908632|, ULTIMATE.start_main_#t~ite22=|ULTIMATE.start_main_#t~ite22_Out-651908632|, ULTIMATE.start_main_#t~ite23=|ULTIMATE.start_main_#t~ite23_Out-651908632|, ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In-651908632|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_Out-651908632, ULTIMATE.start_assume_abort_if_not_~cond=ULTIMATE.start_assume_abort_if_not_~cond_Out-651908632, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_Out-651908632, ~z~0=~z~0_Out-651908632} AuxVars[] AssignedVars[~z$r_buff0_thd0~0, ULTIMATE.start_assume_abort_if_not_~cond, ~z$w_buff0_used~0, ~z$r_buff1_thd0~0, ~z$w_buff1_used~0, ULTIMATE.start_main_#t~ite24, ULTIMATE.start_main_#t~ite25, ULTIMATE.start_main_#t~ite26, ~z~0, ULTIMATE.start_main_#t~ite21, ULTIMATE.start_main_#t~ite22, ULTIMATE.start_main_#t~ite23] because there is no mapped edge [2020-11-28 07:41:58,220 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-28 07:41:58,220 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 07:41:58,220 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-28 07:41:58,221 WARN L224 RCFGBacktranslator]: unable to determine which branch was taken at C: __VERIFIER_atomic_begin() [803] [2020-11-28 07:41:58,223 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-28 07:41:58,223 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 07:41:58,223 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-28 07:41:58,223 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 07:41:58,224 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-28 07:41:58,224 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 07:41:58,224 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-28 07:41:58,225 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 07:41:58,225 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-28 07:41:58,225 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 07:41:58,225 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-28 07:41:58,225 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 07:41:58,226 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-28 07:41:58,226 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 07:41:58,226 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-28 07:41:58,226 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 07:41:58,226 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-28 07:41:58,227 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 07:41:58,227 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-28 07:41:58,227 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 07:41:58,227 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-28 07:41:58,227 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 07:41:58,227 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-28 07:41:58,228 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 07:41:58,228 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-28 07:41:58,228 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 07:41:58,229 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-28 07:41:58,229 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 07:41:58,234 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-28 07:41:58,234 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 07:41:58,234 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-28 07:41:58,234 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 07:41:58,234 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-28 07:41:58,235 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 07:41:58,235 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-28 07:41:58,235 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 07:41:58,235 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-28 07:41:58,235 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 07:41:58,235 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-28 07:41:58,236 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 07:41:58,236 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-28 07:41:58,236 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 07:41:58,341 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 07:41:58 BasicIcfg [2020-11-28 07:41:58,346 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-11-28 07:41:58,346 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-11-28 07:41:58,347 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-11-28 07:41:58,347 INFO L275 PluginConnector]: Witness Printer initialized [2020-11-28 07:41:58,347 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 07:41:37" (3/4) ... [2020-11-28 07:41:58,349 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2020-11-28 07:41:58,363 WARN L124 codingBacktranslator]: Skipped backtranslation of ATE [1017] [1017] L2-->L866: Formula: (let ((.cse9 (= (mod ~z$w_buff1_used~0_In-651908632 256) 0)) (.cse8 (= 0 (mod ~z$r_buff1_thd0~0_In-651908632 256))) (.cse7 (= (mod ~z$r_buff0_thd0~0_In-651908632 256) 0)) (.cse6 (= (mod ~z$w_buff0_used~0_In-651908632 256) 0))) (let ((.cse5 (or .cse7 .cse6)) (.cse2 (or .cse9 .cse8)) (.cse0 (not .cse9)) (.cse1 (not .cse8)) (.cse3 (not .cse7)) (.cse4 (not .cse6))) (and (not (= ULTIMATE.start_assume_abort_if_not_~cond_Out-651908632 0)) (or (and .cse0 .cse1 (= ~z$w_buff1_used~0_Out-651908632 0)) (and .cse2 (= ~z$w_buff1_used~0_Out-651908632 ~z$w_buff1_used~0_In-651908632))) (= ~z$r_buff1_thd0~0_In-651908632 ~z$r_buff1_thd0~0_Out-651908632) (= ULTIMATE.start_assume_abort_if_not_~cond_Out-651908632 |ULTIMATE.start_assume_abort_if_not_#in~cond_In-651908632|) (or (and .cse3 (= 0 ~z$w_buff0_used~0_Out-651908632) .cse4) (and .cse5 (= ~z$w_buff0_used~0_In-651908632 ~z$w_buff0_used~0_Out-651908632))) (or (and .cse5 (or (and .cse2 (= ~z~0_In-651908632 ~z~0_Out-651908632)) (and .cse0 .cse1 (= ~z$w_buff1~0_In-651908632 ~z~0_Out-651908632)))) (and .cse3 (= ~z~0_Out-651908632 ~z$w_buff0~0_In-651908632) .cse4)) (= ~z$r_buff0_thd0~0_In-651908632 ~z$r_buff0_thd0~0_Out-651908632)))) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In-651908632|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-651908632, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-651908632, ~z$w_buff0~0=~z$w_buff0~0_In-651908632, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-651908632, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-651908632, ~z$w_buff1~0=~z$w_buff1~0_In-651908632, ~z~0=~z~0_In-651908632} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_Out-651908632, ~z$w_buff0~0=~z$w_buff0~0_In-651908632, ~z$w_buff1_used~0=~z$w_buff1_used~0_Out-651908632, ULTIMATE.start_main_#t~ite24=|ULTIMATE.start_main_#t~ite24_Out-651908632|, ULTIMATE.start_main_#t~ite25=|ULTIMATE.start_main_#t~ite25_Out-651908632|, ~z$w_buff1~0=~z$w_buff1~0_In-651908632, ULTIMATE.start_main_#t~ite26=|ULTIMATE.start_main_#t~ite26_Out-651908632|, ULTIMATE.start_main_#t~ite21=|ULTIMATE.start_main_#t~ite21_Out-651908632|, ULTIMATE.start_main_#t~ite22=|ULTIMATE.start_main_#t~ite22_Out-651908632|, ULTIMATE.start_main_#t~ite23=|ULTIMATE.start_main_#t~ite23_Out-651908632|, ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In-651908632|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_Out-651908632, ULTIMATE.start_assume_abort_if_not_~cond=ULTIMATE.start_assume_abort_if_not_~cond_Out-651908632, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_Out-651908632, ~z~0=~z~0_Out-651908632} AuxVars[] AssignedVars[~z$r_buff0_thd0~0, ULTIMATE.start_assume_abort_if_not_~cond, ~z$w_buff0_used~0, ~z$r_buff1_thd0~0, ~z$w_buff1_used~0, ULTIMATE.start_main_#t~ite24, ULTIMATE.start_main_#t~ite25, ULTIMATE.start_main_#t~ite26, ~z~0, ULTIMATE.start_main_#t~ite21, ULTIMATE.start_main_#t~ite22, ULTIMATE.start_main_#t~ite23] because there is no mapped edge [2020-11-28 07:41:58,364 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-28 07:41:58,365 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 07:41:58,365 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-28 07:41:58,365 WARN L224 RCFGBacktranslator]: unable to determine which branch was taken at C: __VERIFIER_atomic_begin() [803] [2020-11-28 07:41:58,366 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-28 07:41:58,366 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 07:41:58,366 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-28 07:41:58,366 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 07:41:58,366 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-28 07:41:58,367 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 07:41:58,367 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-28 07:41:58,367 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 07:41:58,367 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-28 07:41:58,367 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 07:41:58,367 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-28 07:41:58,367 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 07:41:58,368 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-28 07:41:58,368 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 07:41:58,368 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-28 07:41:58,368 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 07:41:58,368 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-28 07:41:58,368 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 07:41:58,369 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-28 07:41:58,369 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 07:41:58,369 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-28 07:41:58,369 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 07:41:58,369 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-28 07:41:58,369 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 07:41:58,370 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-28 07:41:58,370 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 07:41:58,370 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-28 07:41:58,370 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 07:41:58,370 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-28 07:41:58,370 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 07:41:58,370 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-28 07:41:58,371 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 07:41:58,371 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-28 07:41:58,371 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 07:41:58,371 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-28 07:41:58,371 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 07:41:58,371 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-28 07:41:58,371 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 07:41:58,372 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-28 07:41:58,372 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 07:41:58,372 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-28 07:41:58,372 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 07:41:58,512 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_70186b58-838b-4b97-a306-52a1358b71f4/bin/utaipan/witness.graphml [2020-11-28 07:41:58,512 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-11-28 07:41:58,513 INFO L168 Benchmark]: Toolchain (without parser) took 24430.73 ms. Allocated memory was 109.1 MB in the beginning and 339.7 MB in the end (delta: 230.7 MB). Free memory was 70.8 MB in the beginning and 295.1 MB in the end (delta: -224.3 MB). Peak memory consumption was 205.0 MB. Max. memory is 16.1 GB. [2020-11-28 07:41:58,514 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 109.1 MB. Free memory was 88.8 MB in the beginning and 88.7 MB in the end (delta: 112.7 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-11-28 07:41:58,514 INFO L168 Benchmark]: CACSL2BoogieTranslator took 693.19 ms. Allocated memory is still 109.1 MB. Free memory was 70.6 MB in the beginning and 59.5 MB in the end (delta: 11.1 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. [2020-11-28 07:41:58,515 INFO L168 Benchmark]: Boogie Procedure Inliner took 112.26 ms. Allocated memory is still 109.1 MB. Free memory was 59.5 MB in the beginning and 56.3 MB in the end (delta: 3.2 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2020-11-28 07:41:58,515 INFO L168 Benchmark]: Boogie Preprocessor took 50.80 ms. Allocated memory is still 109.1 MB. Free memory was 56.3 MB in the beginning and 54.2 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-11-28 07:41:58,516 INFO L168 Benchmark]: RCFGBuilder took 2769.41 ms. Allocated memory was 109.1 MB in the beginning and 134.2 MB in the end (delta: 25.2 MB). Free memory was 54.2 MB in the beginning and 104.0 MB in the end (delta: -49.8 MB). Peak memory consumption was 48.1 MB. Max. memory is 16.1 GB. [2020-11-28 07:41:58,516 INFO L168 Benchmark]: TraceAbstraction took 20632.96 ms. Allocated memory was 134.2 MB in the beginning and 339.7 MB in the end (delta: 205.5 MB). Free memory was 103.0 MB in the beginning and 114.6 MB in the end (delta: -11.6 MB). Peak memory consumption was 192.8 MB. Max. memory is 16.1 GB. [2020-11-28 07:41:58,517 INFO L168 Benchmark]: Witness Printer took 165.52 ms. Allocated memory is still 339.7 MB. Free memory was 114.6 MB in the beginning and 295.1 MB in the end (delta: -180.5 MB). Peak memory consumption was 18.9 MB. Max. memory is 16.1 GB. [2020-11-28 07:41:58,521 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.18 ms. Allocated memory is still 109.1 MB. Free memory was 88.8 MB in the beginning and 88.7 MB in the end (delta: 112.7 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 693.19 ms. Allocated memory is still 109.1 MB. Free memory was 70.6 MB in the beginning and 59.5 MB in the end (delta: 11.1 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 112.26 ms. Allocated memory is still 109.1 MB. Free memory was 59.5 MB in the beginning and 56.3 MB in the end (delta: 3.2 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 50.80 ms. Allocated memory is still 109.1 MB. Free memory was 56.3 MB in the beginning and 54.2 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 2769.41 ms. Allocated memory was 109.1 MB in the beginning and 134.2 MB in the end (delta: 25.2 MB). Free memory was 54.2 MB in the beginning and 104.0 MB in the end (delta: -49.8 MB). Peak memory consumption was 48.1 MB. Max. memory is 16.1 GB. * TraceAbstraction took 20632.96 ms. Allocated memory was 134.2 MB in the beginning and 339.7 MB in the end (delta: 205.5 MB). Free memory was 103.0 MB in the beginning and 114.6 MB in the end (delta: -11.6 MB). Peak memory consumption was 192.8 MB. Max. memory is 16.1 GB. * Witness Printer took 165.52 ms. Allocated memory is still 339.7 MB. Free memory was 114.6 MB in the beginning and 295.1 MB in the end (delta: -180.5 MB). Peak memory consumption was 18.9 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 1897 VarBasedMoverChecksPositive, 90 VarBasedMoverChecksNegative, 25 SemBasedMoverChecksPositive, 65 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 2.2s, 198 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 15.2s, 132 PlacesBefore, 45 PlacesAfterwards, 122 TransitionsBefore, 32 TransitionsAfterwards, 2830 CoEnabledTransitionPairs, 6 FixpointIterations, 42 TrivialSequentialCompositions, 51 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 7 ConcurrentYvCompositions, 3 ChoiceCompositions, 103 TotalNumberOfCompositions, 6354 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_p0_EAX = 0; [L714] 0 int __unbuffered_p1_EAX = 0; [L716] 0 int __unbuffered_p3_EAX = 0; [L718] 0 int __unbuffered_p3_EBX = 0; [L720] 0 int a = 0; [L722] 0 int b = 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; [L848] 0 pthread_t t1149; [L849] FCALL, FORK 0 pthread_create(&t1149, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=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] [L850] 0 pthread_t t1150; [L851] FCALL, FORK 0 pthread_create(&t1150, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=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] [L852] 0 pthread_t t1151; [L853] FCALL, FORK 0 pthread_create(&t1151, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=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] [L854] 0 pthread_t t1152; [L855] FCALL, FORK 0 pthread_create(&t1152, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=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] [L804] 4 z$w_buff1 = z$w_buff0 [L805] 4 z$w_buff0 = 2 [L806] 4 z$w_buff1_used = z$w_buff0_used [L807] 4 z$w_buff0_used = (_Bool)1 [L18] COND TRUE 4 !expression [L17] COND FALSE 4 !(0) [L17] 4 __assert_fail ("0", "mix043_rmo.opt.c", 8, __extension__ __PRETTY_FUNCTION__) [L809] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L810] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L811] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L812] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L813] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L814] 4 z$r_buff0_thd4 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=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=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L817] 4 a = 1 [L820] 4 __unbuffered_p3_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=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=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L823] 4 __unbuffered_p3_EBX = b VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=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=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L754] 1 b = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, 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=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L757] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, 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=2, 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 = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=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=2, 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_p0_EAX=0, __unbuffered_p1_EAX=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}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=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=2, 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_p0_EAX=0, __unbuffered_p1_EAX=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}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=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=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L787] 3 z = 1 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=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=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L826] 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) [L826] EXPR 4 z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z [L826] 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) [L826] 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) [L827] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L827] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L828] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L828] 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 [L829] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L829] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L830] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 [L830] 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 [L833] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L835] 4 return 0; [L790] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L790] EXPR 3 z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z [L790] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L790] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L791] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L791] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L792] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L792] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L793] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L793] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L794] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L794] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L797] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L799] 3 return 0; [L857] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L868] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L869] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L870] 0 z$flush_delayed = weak$$choice2 [L871] 0 z$mem_tmp = z [L872] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L872] 0 z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L873] EXPR 0 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L873] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L874] EXPR 0 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L874] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1) [L874] EXPR 0 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L874] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L875] EXPR 0 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L875] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L876] EXPR 0 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L876] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L877] EXPR 0 weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L877] 0 z$r_buff0_thd0 = weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L878] EXPR 0 weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L878] 0 z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L879] 0 main$tmp_guard1 = !(z == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L880] EXPR 0 z$flush_delayed ? z$mem_tmp : z [L880] 0 z = z$flush_delayed ? z$mem_tmp : z [L881] 0 z$flush_delayed = (_Bool)0 [L18] COND TRUE 0 !expression [L17] COND FALSE 0 !(0) [L17] 0 __assert_fail ("0", "mix043_rmo.opt.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=0, x=1, y=1, z=2, z$flush_delayed=0, z$mem_tmp=2, 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=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 120 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 20.3s, OverallIterations: 14, TraceHistogramMax: 1, AutomataDifference: 1.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 15.5s, HoareTripleCheckerStatistics: 451 SDtfs, 508 SDslu, 776 SDs, 0 SdLazy, 307 SolverSat, 84 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 60 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3002occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.7s AutomataMinimizationTime, 13 MinimizatonAttempts, 167 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 251 NumberOfCodeBlocks, 251 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 212 ConstructedInterpolants, 0 QuantifiedInterpolants, 23375 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 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...