./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/safe011_power.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a4ecdabc Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_0e001564-45a1-4a0f-89d0-fb8a63c95091/bin/utaipan/data/config -Xmx15G -Xms4m -jar /tmp/vcloud-vcloud-master/worker/run_dir_0e001564-45a1-4a0f-89d0-fb8a63c95091/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_0e001564-45a1-4a0f-89d0-fb8a63c95091/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_0e001564-45a1-4a0f-89d0-fb8a63c95091/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-wmm/safe011_power.opt.i -s /tmp/vcloud-vcloud-master/worker/run_dir_0e001564-45a1-4a0f-89d0-fb8a63c95091/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_0e001564-45a1-4a0f-89d0-fb8a63c95091/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 615a212c0eecd0a3199c84d27ecc87f5d04134da ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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:40:10,560 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-28 07:40:10,562 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-28 07:40:10,612 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-28 07:40:10,613 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-28 07:40:10,614 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-28 07:40:10,616 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-28 07:40:10,619 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-28 07:40:10,627 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-28 07:40:10,630 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-28 07:40:10,631 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-28 07:40:10,633 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-28 07:40:10,635 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-28 07:40:10,638 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-28 07:40:10,640 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-28 07:40:10,643 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-28 07:40:10,644 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-28 07:40:10,650 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-28 07:40:10,653 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-28 07:40:10,659 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-28 07:40:10,664 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-28 07:40:10,666 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-28 07:40:10,668 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-28 07:40:10,669 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-28 07:40:10,676 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-28 07:40:10,676 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-28 07:40:10,677 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-28 07:40:10,679 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-28 07:40:10,679 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-28 07:40:10,687 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-28 07:40:10,687 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-28 07:40:10,688 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-28 07:40:10,689 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-28 07:40:10,690 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-28 07:40:10,691 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-28 07:40:10,692 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-28 07:40:10,692 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-28 07:40:10,692 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-28 07:40:10,693 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-28 07:40:10,694 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-28 07:40:10,694 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-28 07:40:10,695 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_0e001564-45a1-4a0f-89d0-fb8a63c95091/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2020-11-28 07:40:10,719 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-28 07:40:10,720 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-28 07:40:10,721 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2020-11-28 07:40:10,721 INFO L138 SettingsManager]: * User list type=DISABLED [2020-11-28 07:40:10,721 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2020-11-28 07:40:10,721 INFO L138 SettingsManager]: * Explicit value domain=true [2020-11-28 07:40:10,721 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2020-11-28 07:40:10,722 INFO L138 SettingsManager]: * Octagon Domain=false [2020-11-28 07:40:10,722 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2020-11-28 07:40:10,722 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2020-11-28 07:40:10,722 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2020-11-28 07:40:10,722 INFO L138 SettingsManager]: * Interval Domain=false [2020-11-28 07:40:10,722 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2020-11-28 07:40:10,723 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2020-11-28 07:40:10,723 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2020-11-28 07:40:10,724 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-28 07:40:10,724 INFO L138 SettingsManager]: * sizeof long=4 [2020-11-28 07:40:10,724 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-11-28 07:40:10,724 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-11-28 07:40:10,724 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-28 07:40:10,724 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-11-28 07:40:10,725 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-11-28 07:40:10,725 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-11-28 07:40:10,725 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2020-11-28 07:40:10,725 INFO L138 SettingsManager]: * sizeof long double=12 [2020-11-28 07:40:10,725 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-11-28 07:40:10,726 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-28 07:40:10,726 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-11-28 07:40:10,726 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-28 07:40:10,726 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-11-28 07:40:10,726 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-11-28 07:40:10,726 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-28 07:40:10,727 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-28 07:40:10,727 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-11-28 07:40:10,727 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-11-28 07:40:10,727 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2020-11-28 07:40:10,727 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-11-28 07:40:10,728 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-11-28 07:40:10,728 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-11-28 07:40:10,728 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-11-28 07:40:10,728 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_0e001564-45a1-4a0f-89d0-fb8a63c95091/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_0e001564-45a1-4a0f-89d0-fb8a63c95091/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 -> 615a212c0eecd0a3199c84d27ecc87f5d04134da [2020-11-28 07:40:10,976 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-28 07:40:11,023 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-28 07:40:11,026 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-28 07:40:11,027 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-28 07:40:11,029 INFO L275 PluginConnector]: CDTParser initialized [2020-11-28 07:40:11,030 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_0e001564-45a1-4a0f-89d0-fb8a63c95091/bin/utaipan/../../sv-benchmarks/c/pthread-wmm/safe011_power.opt.i [2020-11-28 07:40:11,120 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_0e001564-45a1-4a0f-89d0-fb8a63c95091/bin/utaipan/data/f09a37a45/f9f3e7aed2b04506bd7b2a621c6aa0b6/FLAG2d360eb2e [2020-11-28 07:40:11,666 INFO L306 CDTParser]: Found 1 translation units. [2020-11-28 07:40:11,670 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_0e001564-45a1-4a0f-89d0-fb8a63c95091/sv-benchmarks/c/pthread-wmm/safe011_power.opt.i [2020-11-28 07:40:11,690 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_0e001564-45a1-4a0f-89d0-fb8a63c95091/bin/utaipan/data/f09a37a45/f9f3e7aed2b04506bd7b2a621c6aa0b6/FLAG2d360eb2e [2020-11-28 07:40:11,973 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_0e001564-45a1-4a0f-89d0-fb8a63c95091/bin/utaipan/data/f09a37a45/f9f3e7aed2b04506bd7b2a621c6aa0b6 [2020-11-28 07:40:11,975 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-28 07:40:11,977 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-11-28 07:40:11,979 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-28 07:40:11,980 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-28 07:40:11,983 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-28 07:40:11,984 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 07:40:11" (1/1) ... [2020-11-28 07:40:11,986 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@45ffbaaa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 07:40:11, skipping insertion in model container [2020-11-28 07:40:11,987 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 07:40:11" (1/1) ... [2020-11-28 07:40:11,994 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-11-28 07:40:12,042 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-28 07:40:12,509 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-28 07:40:12,518 INFO L203 MainTranslator]: Completed pre-run [2020-11-28 07:40:12,616 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-28 07:40:12,717 INFO L208 MainTranslator]: Completed translation [2020-11-28 07:40:12,719 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 07:40:12 WrapperNode [2020-11-28 07:40:12,719 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-28 07:40:12,721 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-11-28 07:40:12,721 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-11-28 07:40:12,721 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-11-28 07:40:12,731 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:40:12" (1/1) ... [2020-11-28 07:40:12,770 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:40:12" (1/1) ... [2020-11-28 07:40:12,819 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-11-28 07:40:12,820 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-11-28 07:40:12,820 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-11-28 07:40:12,820 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-11-28 07:40:12,837 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 07:40:12" (1/1) ... [2020-11-28 07:40:12,838 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 07:40:12" (1/1) ... [2020-11-28 07:40:12,857 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 07:40:12" (1/1) ... [2020-11-28 07:40:12,858 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 07:40:12" (1/1) ... [2020-11-28 07:40:12,885 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 07:40:12" (1/1) ... [2020-11-28 07:40:12,889 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 07:40:12" (1/1) ... [2020-11-28 07:40:12,893 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 07:40:12" (1/1) ... [2020-11-28 07:40:12,911 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-11-28 07:40:12,912 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-11-28 07:40:12,912 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-11-28 07:40:12,913 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-11-28 07:40:12,914 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 07:40:12" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0e001564-45a1-4a0f-89d0-fb8a63c95091/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:40:12,995 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-11-28 07:40:12,995 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-11-28 07:40:12,995 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-11-28 07:40:12,996 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-11-28 07:40:12,996 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-11-28 07:40:12,996 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-11-28 07:40:12,996 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-11-28 07:40:12,996 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-11-28 07:40:12,998 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-11-28 07:40:12,998 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-11-28 07:40:12,998 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-11-28 07:40:12,998 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-11-28 07:40:12,998 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-11-28 07:40:12,998 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-11-28 07:40:13,000 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:40:15,625 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-11-28 07:40:15,626 INFO L298 CfgBuilder]: Removed 14 assume(true) statements. [2020-11-28 07:40:15,628 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 07:40:15 BoogieIcfgContainer [2020-11-28 07:40:15,628 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-11-28 07:40:15,629 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-11-28 07:40:15,629 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-11-28 07:40:15,634 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-11-28 07:40:15,634 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 07:40:11" (1/3) ... [2020-11-28 07:40:15,635 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f117545 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 07:40:15, skipping insertion in model container [2020-11-28 07:40:15,635 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 07:40:12" (2/3) ... [2020-11-28 07:40:15,635 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f117545 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 07:40:15, skipping insertion in model container [2020-11-28 07:40:15,636 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 07:40:15" (3/3) ... [2020-11-28 07:40:15,637 INFO L111 eAbstractionObserver]: Analyzing ICFG safe011_power.opt.i [2020-11-28 07:40:15,651 WARN L153 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-11-28 07:40:15,651 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-11-28 07:40:15,656 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-11-28 07:40:15,657 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-11-28 07:40:15,690 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:40:15,691 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:40:15,691 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:40:15,691 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:40:15,691 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:40:15,692 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:40:15,692 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:40:15,692 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:40:15,692 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:40:15,692 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:40:15,692 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:40:15,693 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:40:15,693 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:40:15,694 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:40:15,694 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:40:15,694 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:40:15,694 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:40:15,695 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:40:15,695 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:40:15,695 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:40:15,695 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:40:15,695 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:40:15,696 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:40:15,696 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:40:15,696 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:40:15,696 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:40:15,696 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:40:15,697 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:40:15,697 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:40:15,697 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:40:15,697 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:40:15,697 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:40:15,698 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:40:15,698 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:40:15,698 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:40:15,699 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:40:15,699 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:40:15,699 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:40:15,699 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:40:15,699 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:40:15,700 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:40:15,700 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:40:15,700 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:40:15,700 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:40:15,700 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:40:15,701 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:40:15,701 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:40:15,701 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:40:15,701 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:40:15,703 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:40:15,704 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:40:15,704 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:40:15,704 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:40:15,704 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:40:15,705 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:40:15,705 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:40:15,705 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:40:15,705 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:40:15,705 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:40:15,707 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:40:15,708 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:40:15,708 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:40:15,708 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:40:15,708 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:40:15,708 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:40:15,708 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:40:15,708 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:40:15,709 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:40:15,709 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:40:15,709 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:40:15,709 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:40:15,709 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:40:15,709 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:40:15,711 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:40:15,712 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:40:15,712 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:40:15,712 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:40:15,712 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:40:15,712 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:40:15,712 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:40:15,713 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:40:15,713 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:40:15,713 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:40:15,719 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2020-11-28 07:40:15,730 INFO L253 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2020-11-28 07:40:15,749 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-11-28 07:40:15,750 INFO L378 AbstractCegarLoop]: Hoare is true [2020-11-28 07:40:15,750 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-11-28 07:40:15,750 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-11-28 07:40:15,750 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-11-28 07:40:15,750 INFO L382 AbstractCegarLoop]: Difference is false [2020-11-28 07:40:15,751 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-11-28 07:40:15,751 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-11-28 07:40:15,761 INFO L129 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2020-11-28 07:40:15,763 INFO L144 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 108 places, 101 transitions, 217 flow [2020-11-28 07:40:15,766 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 108 places, 101 transitions, 217 flow [2020-11-28 07:40:15,768 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 108 places, 101 transitions, 217 flow [2020-11-28 07:40:15,810 INFO L129 PetriNetUnfolder]: 3/98 cut-off events. [2020-11-28 07:40:15,810 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-11-28 07:40:15,814 INFO L80 FinitePrefix]: Finished finitePrefix Result has 108 conditions, 98 events. 3/98 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 76 event pairs, 0 based on Foata normal form. 0/93 useless extension candidates. Maximal degree in co-relation 65. Up to 2 conditions per place. [2020-11-28 07:40:15,817 INFO L116 LiptonReduction]: Number of co-enabled transitions 1862 [2020-11-28 07:40:16,014 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term [2020-11-28 07:40:16,015 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 07:40:16,019 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-11-28 07:40:16,020 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 07:40:16,078 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term [2020-11-28 07:40:16,078 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 07:40:16,080 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-11-28 07:40:16,081 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 07:40:16,319 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-28 07:40:16,319 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 07:40:16,330 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 1] term [2020-11-28 07:40:16,330 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 07:40:16,332 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 1] term [2020-11-28 07:40:16,332 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 07:40:16,337 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-11-28 07:40:16,337 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-28 07:40:16,344 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-11-28 07:40:16,345 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-28 07:40:16,348 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-11-28 07:40:16,349 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-28 07:40:16,352 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[10, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-11-28 07:40:16,352 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 07:40:16,355 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-11-28 07:40:16,356 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 07:40:16,359 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-11-28 07:40:16,360 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 07:40:16,422 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 1] term [2020-11-28 07:40:16,422 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 07:40:16,423 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-11-28 07:40:16,423 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 07:40:16,427 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 4, 3, 1] term [2020-11-28 07:40:16,427 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-11-28 07:40:16,431 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-11-28 07:40:16,431 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 07:40:16,601 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term [2020-11-28 07:40:16,602 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 07:40:16,602 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-11-28 07:40:16,602 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 07:40:16,629 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term [2020-11-28 07:40:16,630 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 07:40:16,630 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-11-28 07:40:16,630 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 07:40:16,657 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-11-28 07:40:16,657 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 07:40:17,102 WARN L193 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 48 [2020-11-28 07:40:17,121 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-11-28 07:40:17,121 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 07:40:17,189 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 1] term [2020-11-28 07:40:17,190 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 07:40:17,190 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-11-28 07:40:17,190 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 07:40:17,193 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 4, 3, 1] term [2020-11-28 07:40:17,193 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-11-28 07:40:17,196 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-11-28 07:40:17,196 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 07:40:17,261 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 07:40:17,261 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 07:40:17,264 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 1] term [2020-11-28 07:40:17,264 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 07:40:17,265 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 1] term [2020-11-28 07:40:17,265 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 07:40:17,268 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-11-28 07:40:17,269 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-28 07:40:17,270 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-11-28 07:40:17,270 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-28 07:40:17,273 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-11-28 07:40:17,273 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-28 07:40:17,275 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[10, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-11-28 07:40:17,275 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 07:40:17,278 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-11-28 07:40:17,278 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 07:40:17,280 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 6, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-11-28 07:40:17,280 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 07:40:17,350 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term [2020-11-28 07:40:17,350 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 07:40:17,351 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-11-28 07:40:17,351 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 07:40:17,382 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 3, 3, 2, 1] term [2020-11-28 07:40:17,383 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 07:40:17,383 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 1] term [2020-11-28 07:40:17,384 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 07:40:17,450 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 07:40:17,450 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 07:40:17,452 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 1] term [2020-11-28 07:40:17,453 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 07:40:17,454 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 1] term [2020-11-28 07:40:17,454 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 07:40:17,457 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-11-28 07:40:17,457 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-28 07:40:17,459 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-11-28 07:40:17,459 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-28 07:40:17,461 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-11-28 07:40:17,462 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-28 07:40:17,464 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[10, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-11-28 07:40:17,464 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 07:40:17,466 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-11-28 07:40:17,466 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 07:40:17,467 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-11-28 07:40:17,468 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 07:40:17,520 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 1] term [2020-11-28 07:40:17,520 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 07:40:17,521 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-11-28 07:40:17,521 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 07:40:17,524 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 4, 3, 1] term [2020-11-28 07:40:17,524 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-11-28 07:40:17,527 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-11-28 07:40:17,527 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 07:40:17,587 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-11-28 07:40:17,587 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 07:40:17,588 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-11-28 07:40:17,588 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 07:40:17,590 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-11-28 07:40:17,590 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 07:40:17,592 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term [2020-11-28 07:40:17,592 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 07:40:17,593 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-11-28 07:40:17,593 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 07:40:17,616 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 2, 1] term [2020-11-28 07:40:17,616 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 07:40:17,616 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-11-28 07:40:17,617 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 07:40:18,824 WARN L193 SmtUtils]: Spent 1.18 s on a formula simplification. DAG size of input: 226 DAG size of output: 185 [2020-11-28 07:40:18,852 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 2, 1] term [2020-11-28 07:40:18,852 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 07:40:18,852 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-11-28 07:40:18,853 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 07:40:19,651 WARN L193 SmtUtils]: Spent 764.00 ms on a formula simplification. DAG size of input: 141 DAG size of output: 121 [2020-11-28 07:40:19,784 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-28 07:40:19,785 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 07:40:19,785 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 07:40:19,786 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 07:40:19,788 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-28 07:40:19,788 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 07:40:19,790 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-28 07:40:19,790 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 07:40:19,822 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-28 07:40:19,822 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 07:40:19,823 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 07:40:19,823 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 07:40:19,825 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-28 07:40:19,825 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 07:40:19,827 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-28 07:40:19,828 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 07:40:20,016 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 07:40:20,016 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 07:40:20,017 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 07:40:20,017 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 07:40:20,019 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-28 07:40:20,020 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 07:40:20,022 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-28 07:40:20,022 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 07:40:20,044 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-28 07:40:20,044 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 07:40:20,045 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 07:40:20,045 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 07:40:20,047 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-28 07:40:20,048 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 07:40:20,050 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-28 07:40:20,050 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 07:40:20,077 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 07:40:20,077 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 07:40:20,078 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 07:40:20,079 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 07:40:20,080 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-28 07:40:20,081 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 07:40:20,083 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-28 07:40:20,083 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 07:40:20,105 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-28 07:40:20,106 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 07:40:20,107 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 07:40:20,107 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 07:40:20,109 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-28 07:40:20,109 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 07:40:20,111 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-28 07:40:20,111 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 07:40:20,193 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-28 07:40:20,194 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 07:40:20,194 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 07:40:20,195 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 07:40:20,196 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-28 07:40:20,196 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 07:40:20,198 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-28 07:40:20,198 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 07:40:20,215 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-28 07:40:20,215 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 07:40:20,215 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 07:40:20,215 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 07:40:20,216 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-28 07:40:20,217 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 07:40:20,218 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-28 07:40:20,218 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 07:40:20,296 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-11-28 07:40:20,296 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 07:40:20,481 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-28 07:40:20,482 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 07:40:20,482 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 07:40:20,482 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 07:40:20,484 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-28 07:40:20,484 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 07:40:20,486 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-28 07:40:20,486 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 07:40:20,506 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 07:40:20,507 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 07:40:20,507 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 07:40:20,507 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 07:40:20,508 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-28 07:40:20,508 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 07:40:20,509 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-28 07:40:20,510 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 07:40:20,808 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 07:40:20,808 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 07:40:20,809 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 07:40:20,809 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 07:40:20,811 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-28 07:40:20,811 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 07:40:20,813 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-28 07:40:20,813 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 07:40:20,848 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-28 07:40:20,849 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 07:40:20,849 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 07:40:20,849 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 07:40:20,851 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-28 07:40:20,851 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 07:40:20,853 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-28 07:40:20,853 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 07:40:21,012 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 1] term [2020-11-28 07:40:21,012 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-28 07:40:21,014 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 4, 3, 1] term [2020-11-28 07:40:21,014 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 07:40:21,030 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 4, 3, 4, 3, 1] term [2020-11-28 07:40:21,030 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 07:40:21,031 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 4, 3, 1] term [2020-11-28 07:40:21,032 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 07:40:21,032 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 07:40:21,032 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 07:40:21,033 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 07:40:21,033 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 07:40:21,035 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-11-28 07:40:21,035 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 07:40:21,037 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-11-28 07:40:21,037 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 07:40:21,040 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 4, 3, 1] term [2020-11-28 07:40:21,041 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 07:40:21,042 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-11-28 07:40:21,043 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 07:40:21,044 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-11-28 07:40:21,044 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 07:40:21,313 WARN L193 SmtUtils]: Spent 235.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 63 [2020-11-28 07:40:21,692 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-28 07:40:21,692 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 07:40:21,693 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 07:40:21,693 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 07:40:21,694 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-28 07:40:21,695 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 07:40:21,696 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-28 07:40:21,696 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 07:40:21,719 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 07:40:21,719 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 07:40:21,720 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 07:40:21,720 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 07:40:21,722 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-28 07:40:21,722 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 07:40:21,724 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-11-28 07:40:21,724 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 07:40:21,745 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-28 07:40:21,745 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 07:40:21,746 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 07:40:21,746 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 07:40:21,747 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-28 07:40:21,748 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 07:40:21,749 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-11-28 07:40:21,749 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 07:40:21,770 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-28 07:40:21,771 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 07:40:21,771 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 07:40:21,772 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 07:40:21,773 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-28 07:40:21,773 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 07:40:21,775 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-28 07:40:21,775 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 07:40:21,850 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-28 07:40:21,850 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 07:40:21,851 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 07:40:21,851 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 07:40:21,853 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-28 07:40:21,853 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 07:40:21,854 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-28 07:40:21,855 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 07:40:21,872 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 07:40:21,872 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 07:40:21,873 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 07:40:21,873 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 07:40:21,874 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-28 07:40:21,875 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 07:40:21,876 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-11-28 07:40:21,876 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 07:40:21,948 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 4, 3, 4, 3, 1] term [2020-11-28 07:40:21,949 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 07:40:21,950 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 4, 3, 1] term [2020-11-28 07:40:21,950 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 07:40:21,951 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 07:40:21,951 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 07:40:21,952 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 07:40:21,952 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 07:40:21,954 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-11-28 07:40:21,954 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 07:40:21,955 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-11-28 07:40:21,956 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 07:40:21,957 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 4, 3, 1] term [2020-11-28 07:40:21,957 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 07:40:21,958 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-11-28 07:40:21,958 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 07:40:21,959 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 5, 3, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-11-28 07:40:21,960 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 07:40:21,988 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 1] term [2020-11-28 07:40:21,988 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-28 07:40:21,990 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 4, 3, 1] term [2020-11-28 07:40:21,990 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 07:40:22,913 WARN L193 SmtUtils]: Spent 892.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 108 [2020-11-28 07:40:23,183 WARN L193 SmtUtils]: Spent 268.00 ms on a formula simplification that was a NOOP. DAG size: 105 [2020-11-28 07:40:23,801 WARN L193 SmtUtils]: Spent 615.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 108 [2020-11-28 07:40:24,074 WARN L193 SmtUtils]: Spent 270.00 ms on a formula simplification that was a NOOP. DAG size: 105 [2020-11-28 07:40:24,078 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 07:40:24,078 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 07:40:24,079 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 07:40:24,079 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 07:40:24,081 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-28 07:40:24,081 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 07:40:24,083 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-11-28 07:40:24,083 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 07:40:24,124 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 07:40:24,125 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 07:40:24,126 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 07:40:24,126 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 07:40:24,128 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-28 07:40:24,128 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 07:40:24,130 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-28 07:40:24,130 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 07:40:24,153 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-28 07:40:24,153 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 07:40:24,154 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 07:40:24,154 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 07:40:24,156 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-28 07:40:24,156 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 07:40:24,158 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-28 07:40:24,159 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 07:40:24,172 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-28 07:40:24,173 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 07:40:24,173 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 07:40:24,173 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 07:40:24,174 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-28 07:40:24,175 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 07:40:24,176 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-11-28 07:40:24,176 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 07:40:24,205 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-28 07:40:24,205 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 07:40:24,206 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 07:40:24,206 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 07:40:24,208 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-28 07:40:24,208 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 07:40:24,209 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-11-28 07:40:24,210 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 07:40:24,226 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-28 07:40:24,226 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 07:40:24,227 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 07:40:24,227 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 07:40:24,229 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-28 07:40:24,229 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 07:40:24,230 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-28 07:40:24,231 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 07:40:24,606 WARN L193 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 70 [2020-11-28 07:40:24,722 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 6, 3, 6, 3, 2, 1] term [2020-11-28 07:40:24,722 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-28 07:40:24,727 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 6, 3, 6, 3, 2, 1] term [2020-11-28 07:40:24,727 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 07:40:24,746 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 3, 6, 2, 2, 1] term [2020-11-28 07:40:24,746 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 07:40:24,747 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 2, 3, 2, 1] term [2020-11-28 07:40:24,747 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 07:40:24,748 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 07:40:24,748 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 07:40:24,749 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 07:40:24,749 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 07:40:24,751 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 3, 6, 3, 3, 2, 3, 2, 3, 2, 1] term [2020-11-28 07:40:24,752 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 07:40:24,753 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 3, 6, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-28 07:40:24,753 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 07:40:24,755 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 6, 3, 6, 3, 2, 1] term [2020-11-28 07:40:24,755 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 07:40:24,756 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 6, 3, 6, 3, 6, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-28 07:40:24,756 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 07:40:24,758 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 6, 3, 6, 3, 6, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-28 07:40:24,758 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 07:40:24,787 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 6, 3, 6, 3, 2, 1] term [2020-11-28 07:40:24,788 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-28 07:40:24,789 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 6, 3, 6, 3, 2, 1] term [2020-11-28 07:40:24,790 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 07:40:24,836 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 3, 6, 2, 2, 1] term [2020-11-28 07:40:24,836 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 07:40:24,837 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 2, 3, 2, 1] term [2020-11-28 07:40:24,837 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 07:40:24,837 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 07:40:24,838 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 07:40:24,839 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 07:40:24,839 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 07:40:24,840 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 3, 6, 3, 3, 2, 3, 2, 3, 2, 1] term [2020-11-28 07:40:24,841 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 07:40:24,842 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 3, 6, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-28 07:40:24,842 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 07:40:24,844 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 6, 3, 6, 3, 2, 1] term [2020-11-28 07:40:24,844 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 07:40:24,846 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 6, 3, 6, 3, 6, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-28 07:40:24,846 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 07:40:24,847 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 6, 3, 6, 3, 6, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-28 07:40:24,848 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 07:40:24,882 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 3, 6, 2, 2, 1] term [2020-11-28 07:40:24,882 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 07:40:24,883 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 2, 3, 2, 1] term [2020-11-28 07:40:24,883 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 07:40:24,884 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 07:40:24,884 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 07:40:24,885 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 07:40:24,885 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 07:40:24,887 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 3, 6, 3, 3, 2, 3, 2, 3, 2, 1] term [2020-11-28 07:40:24,887 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 07:40:24,888 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 3, 6, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-28 07:40:24,889 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 07:40:24,890 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 6, 3, 6, 3, 2, 1] term [2020-11-28 07:40:24,891 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 07:40:24,892 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 6, 3, 6, 3, 6, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-28 07:40:24,893 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 07:40:24,894 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 6, 3, 6, 3, 6, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-28 07:40:24,895 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 07:40:24,912 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 6, 3, 6, 3, 2, 1] term [2020-11-28 07:40:24,912 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-28 07:40:24,914 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 6, 3, 6, 3, 2, 1] term [2020-11-28 07:40:24,914 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 07:40:25,408 WARN L193 SmtUtils]: Spent 391.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 112 [2020-11-28 07:40:25,571 WARN L193 SmtUtils]: Spent 161.00 ms on a formula simplification that was a NOOP. DAG size: 108 [2020-11-28 07:40:26,216 WARN L193 SmtUtils]: Spent 629.00 ms on a formula simplification. DAG size of input: 138 DAG size of output: 129 [2020-11-28 07:40:26,481 WARN L193 SmtUtils]: Spent 263.00 ms on a formula simplification that was a NOOP. DAG size: 126 [2020-11-28 07:40:26,542 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 2, 1] term [2020-11-28 07:40:26,543 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-28 07:40:26,544 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 2, 1] term [2020-11-28 07:40:26,544 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 07:40:26,579 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 4, 3, 2, 1] term [2020-11-28 07:40:26,580 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 07:40:26,580 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 3, 2, 1] term [2020-11-28 07:40:26,580 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 07:40:26,581 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 07:40:26,581 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 07:40:26,582 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 07:40:26,582 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 07:40:26,583 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 3, 2, 3, 2, 3, 2, 1] term [2020-11-28 07:40:26,584 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 07:40:26,584 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 3, 2, 3, 2, 3, 2, 1] term [2020-11-28 07:40:26,585 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 07:40:26,586 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 2, 1] term [2020-11-28 07:40:26,586 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 07:40:26,588 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 4, 3, 4, 3, 3, 2, 3, 2, 3, 2, 1] term [2020-11-28 07:40:26,588 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 07:40:26,589 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 5, 3, 4, 3, 4, 3, 3, 2, 3, 2, 3, 2, 1] term [2020-11-28 07:40:26,589 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 07:40:26,650 INFO L131 LiptonReduction]: Checked pairs total: 5308 [2020-11-28 07:40:26,650 INFO L133 LiptonReduction]: Total number of compositions: 94 [2020-11-28 07:40:26,655 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 36 places, 27 transitions, 69 flow [2020-11-28 07:40:26,728 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 822 states. [2020-11-28 07:40:26,730 INFO L276 IsEmpty]: Start isEmpty. Operand 822 states. [2020-11-28 07:40:26,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-11-28 07:40:26,735 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 07:40:26,735 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-11-28 07:40:26,737 INFO L429 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 07:40:26,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 07:40:26,743 INFO L82 PathProgramCache]: Analyzing trace with hash 1050690805, now seen corresponding path program 1 times [2020-11-28 07:40:26,752 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-28 07:40:26,753 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1565381209] [2020-11-28 07:40:26,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 07:40:26,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 07:40:27,033 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:40:27,033 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1565381209] [2020-11-28 07:40:27,034 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 07:40:27,034 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-11-28 07:40:27,035 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [16483318] [2020-11-28 07:40:27,039 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-28 07:40:27,039 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-28 07:40:27,059 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-28 07:40:27,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-28 07:40:27,063 INFO L87 Difference]: Start difference. First operand 822 states. Second operand 3 states. [2020-11-28 07:40:27,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 07:40:27,224 INFO L93 Difference]: Finished difference Result 687 states and 2150 transitions. [2020-11-28 07:40:27,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-28 07:40:27,227 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-11-28 07:40:27,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 07:40:27,261 INFO L225 Difference]: With dead ends: 687 [2020-11-28 07:40:27,262 INFO L226 Difference]: Without dead ends: 562 [2020-11-28 07:40:27,263 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:40:27,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 562 states. [2020-11-28 07:40:27,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 562 to 562. [2020-11-28 07:40:27,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 562 states. [2020-11-28 07:40:27,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 562 states to 562 states and 1725 transitions. [2020-11-28 07:40:27,389 INFO L78 Accepts]: Start accepts. Automaton has 562 states and 1725 transitions. Word has length 5 [2020-11-28 07:40:27,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 07:40:27,390 INFO L481 AbstractCegarLoop]: Abstraction has 562 states and 1725 transitions. [2020-11-28 07:40:27,390 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-28 07:40:27,390 INFO L276 IsEmpty]: Start isEmpty. Operand 562 states and 1725 transitions. [2020-11-28 07:40:27,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-11-28 07:40:27,392 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 07:40:27,392 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 07:40:27,392 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-11-28 07:40:27,393 INFO L429 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 07:40:27,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 07:40:27,397 INFO L82 PathProgramCache]: Analyzing trace with hash -1116931926, now seen corresponding path program 1 times [2020-11-28 07:40:27,397 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-28 07:40:27,397 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [145097850] [2020-11-28 07:40:27,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 07:40:27,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 07:40:27,556 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:40:27,557 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [145097850] [2020-11-28 07:40:27,557 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 07:40:27,557 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-11-28 07:40:27,557 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [695182325] [2020-11-28 07:40:27,558 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-28 07:40:27,558 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-28 07:40:27,559 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-28 07:40:27,559 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-11-28 07:40:27,559 INFO L87 Difference]: Start difference. First operand 562 states and 1725 transitions. Second operand 4 states. [2020-11-28 07:40:27,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 07:40:27,601 INFO L93 Difference]: Finished difference Result 537 states and 1635 transitions. [2020-11-28 07:40:27,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-28 07:40:27,611 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 9 [2020-11-28 07:40:27,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 07:40:27,618 INFO L225 Difference]: With dead ends: 537 [2020-11-28 07:40:27,618 INFO L226 Difference]: Without dead ends: 537 [2020-11-28 07:40:27,619 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 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:40:27,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 537 states. [2020-11-28 07:40:27,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 537 to 537. [2020-11-28 07:40:27,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 537 states. [2020-11-28 07:40:27,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 537 states to 537 states and 1635 transitions. [2020-11-28 07:40:27,671 INFO L78 Accepts]: Start accepts. Automaton has 537 states and 1635 transitions. Word has length 9 [2020-11-28 07:40:27,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 07:40:27,673 INFO L481 AbstractCegarLoop]: Abstraction has 537 states and 1635 transitions. [2020-11-28 07:40:27,673 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-28 07:40:27,674 INFO L276 IsEmpty]: Start isEmpty. Operand 537 states and 1635 transitions. [2020-11-28 07:40:27,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-11-28 07:40:27,677 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 07:40:27,677 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 07:40:27,677 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-11-28 07:40:27,678 INFO L429 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 07:40:27,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 07:40:27,688 INFO L82 PathProgramCache]: Analyzing trace with hash -264813210, now seen corresponding path program 1 times [2020-11-28 07:40:27,688 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-28 07:40:27,689 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [203893044] [2020-11-28 07:40:27,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 07:40:27,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 07:40:27,809 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:40:27,809 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [203893044] [2020-11-28 07:40:27,810 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 07:40:27,810 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-28 07:40:27,810 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1603486074] [2020-11-28 07:40:27,810 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-28 07:40:27,810 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-28 07:40:27,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-28 07:40:27,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-11-28 07:40:27,811 INFO L87 Difference]: Start difference. First operand 537 states and 1635 transitions. Second operand 5 states. [2020-11-28 07:40:27,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 07:40:27,894 INFO L93 Difference]: Finished difference Result 709 states and 2092 transitions. [2020-11-28 07:40:27,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-28 07:40:27,895 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2020-11-28 07:40:27,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 07:40:27,898 INFO L225 Difference]: With dead ends: 709 [2020-11-28 07:40:27,899 INFO L226 Difference]: Without dead ends: 409 [2020-11-28 07:40:27,899 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-11-28 07:40:27,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 409 states. [2020-11-28 07:40:27,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 409 to 409. [2020-11-28 07:40:27,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 409 states. [2020-11-28 07:40:27,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 409 states to 409 states and 1163 transitions. [2020-11-28 07:40:27,915 INFO L78 Accepts]: Start accepts. Automaton has 409 states and 1163 transitions. Word has length 10 [2020-11-28 07:40:27,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 07:40:27,916 INFO L481 AbstractCegarLoop]: Abstraction has 409 states and 1163 transitions. [2020-11-28 07:40:27,916 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-28 07:40:27,916 INFO L276 IsEmpty]: Start isEmpty. Operand 409 states and 1163 transitions. [2020-11-28 07:40:27,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-11-28 07:40:27,918 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 07:40:27,918 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 07:40:27,918 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-11-28 07:40:27,918 INFO L429 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 07:40:27,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 07:40:27,919 INFO L82 PathProgramCache]: Analyzing trace with hash 1902469587, now seen corresponding path program 1 times [2020-11-28 07:40:27,919 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-28 07:40:27,920 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [502864710] [2020-11-28 07:40:27,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 07:40:27,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 07:40:28,013 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:40:28,013 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [502864710] [2020-11-28 07:40:28,013 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 07:40:28,013 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-11-28 07:40:28,014 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1359647810] [2020-11-28 07:40:28,014 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-28 07:40:28,014 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-28 07:40:28,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-28 07:40:28,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-28 07:40:28,015 INFO L87 Difference]: Start difference. First operand 409 states and 1163 transitions. Second operand 3 states. [2020-11-28 07:40:28,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 07:40:28,029 INFO L93 Difference]: Finished difference Result 406 states and 1152 transitions. [2020-11-28 07:40:28,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-28 07:40:28,030 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2020-11-28 07:40:28,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 07:40:28,034 INFO L225 Difference]: With dead ends: 406 [2020-11-28 07:40:28,034 INFO L226 Difference]: Without dead ends: 406 [2020-11-28 07:40:28,034 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:40:28,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 406 states. [2020-11-28 07:40:28,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 406 to 406. [2020-11-28 07:40:28,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 406 states. [2020-11-28 07:40:28,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 406 states to 406 states and 1152 transitions. [2020-11-28 07:40:28,050 INFO L78 Accepts]: Start accepts. Automaton has 406 states and 1152 transitions. Word has length 12 [2020-11-28 07:40:28,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 07:40:28,051 INFO L481 AbstractCegarLoop]: Abstraction has 406 states and 1152 transitions. [2020-11-28 07:40:28,051 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-28 07:40:28,051 INFO L276 IsEmpty]: Start isEmpty. Operand 406 states and 1152 transitions. [2020-11-28 07:40:28,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-11-28 07:40:28,055 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 07:40:28,056 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 07:40:28,056 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-11-28 07:40:28,056 INFO L429 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 07:40:28,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 07:40:28,056 INFO L82 PathProgramCache]: Analyzing trace with hash 1052860892, now seen corresponding path program 1 times [2020-11-28 07:40:28,057 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-28 07:40:28,057 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1182938250] [2020-11-28 07:40:28,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 07:40:28,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 07:40:28,188 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:40:28,188 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1182938250] [2020-11-28 07:40:28,188 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 07:40:28,188 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-28 07:40:28,188 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [311919432] [2020-11-28 07:40:28,189 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-28 07:40:28,189 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-28 07:40:28,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-28 07:40:28,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-11-28 07:40:28,190 INFO L87 Difference]: Start difference. First operand 406 states and 1152 transitions. Second operand 5 states. [2020-11-28 07:40:28,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 07:40:28,338 INFO L93 Difference]: Finished difference Result 403 states and 1140 transitions. [2020-11-28 07:40:28,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-28 07:40:28,339 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2020-11-28 07:40:28,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 07:40:28,343 INFO L225 Difference]: With dead ends: 403 [2020-11-28 07:40:28,343 INFO L226 Difference]: Without dead ends: 403 [2020-11-28 07:40:28,343 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-11-28 07:40:28,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 403 states. [2020-11-28 07:40:28,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 403 to 403. [2020-11-28 07:40:28,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 403 states. [2020-11-28 07:40:28,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 403 states to 403 states and 1140 transitions. [2020-11-28 07:40:28,359 INFO L78 Accepts]: Start accepts. Automaton has 403 states and 1140 transitions. Word has length 13 [2020-11-28 07:40:28,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 07:40:28,359 INFO L481 AbstractCegarLoop]: Abstraction has 403 states and 1140 transitions. [2020-11-28 07:40:28,359 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-28 07:40:28,360 INFO L276 IsEmpty]: Start isEmpty. Operand 403 states and 1140 transitions. [2020-11-28 07:40:28,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-11-28 07:40:28,361 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 07:40:28,361 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 07:40:28,361 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-11-28 07:40:28,361 INFO L429 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 07:40:28,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 07:40:28,361 INFO L82 PathProgramCache]: Analyzing trace with hash 1358785877, now seen corresponding path program 1 times [2020-11-28 07:40:28,362 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-28 07:40:28,362 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [688242838] [2020-11-28 07:40:28,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 07:40:28,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 07:40:28,469 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:40:28,469 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [688242838] [2020-11-28 07:40:28,469 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 07:40:28,470 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-28 07:40:28,470 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1364372363] [2020-11-28 07:40:28,470 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-28 07:40:28,470 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-28 07:40:28,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-28 07:40:28,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-28 07:40:28,471 INFO L87 Difference]: Start difference. First operand 403 states and 1140 transitions. Second operand 4 states. [2020-11-28 07:40:28,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 07:40:28,517 INFO L93 Difference]: Finished difference Result 397 states and 1004 transitions. [2020-11-28 07:40:28,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-28 07:40:28,518 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2020-11-28 07:40:28,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 07:40:28,521 INFO L225 Difference]: With dead ends: 397 [2020-11-28 07:40:28,521 INFO L226 Difference]: Without dead ends: 304 [2020-11-28 07:40:28,522 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:40:28,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2020-11-28 07:40:28,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 304. [2020-11-28 07:40:28,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 304 states. [2020-11-28 07:40:28,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 760 transitions. [2020-11-28 07:40:28,533 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 760 transitions. Word has length 14 [2020-11-28 07:40:28,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 07:40:28,534 INFO L481 AbstractCegarLoop]: Abstraction has 304 states and 760 transitions. [2020-11-28 07:40:28,534 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-28 07:40:28,534 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 760 transitions. [2020-11-28 07:40:28,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-11-28 07:40:28,535 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 07:40:28,535 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 07:40:28,535 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-11-28 07:40:28,536 INFO L429 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 07:40:28,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 07:40:28,536 INFO L82 PathProgramCache]: Analyzing trace with hash 1672631430, now seen corresponding path program 1 times [2020-11-28 07:40:28,536 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-28 07:40:28,537 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1587181400] [2020-11-28 07:40:28,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 07:40:28,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 07:40:28,606 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:40:28,606 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1587181400] [2020-11-28 07:40:28,606 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 07:40:28,607 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-11-28 07:40:28,607 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1297916] [2020-11-28 07:40:28,607 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-28 07:40:28,607 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-28 07:40:28,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-28 07:40:28,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-28 07:40:28,608 INFO L87 Difference]: Start difference. First operand 304 states and 760 transitions. Second operand 4 states. [2020-11-28 07:40:28,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 07:40:28,638 INFO L93 Difference]: Finished difference Result 332 states and 813 transitions. [2020-11-28 07:40:28,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-28 07:40:28,640 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2020-11-28 07:40:28,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 07:40:28,642 INFO L225 Difference]: With dead ends: 332 [2020-11-28 07:40:28,642 INFO L226 Difference]: Without dead ends: 272 [2020-11-28 07:40:28,642 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-28 07:40:28,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2020-11-28 07:40:28,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 272. [2020-11-28 07:40:28,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 272 states. [2020-11-28 07:40:28,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 674 transitions. [2020-11-28 07:40:28,653 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 674 transitions. Word has length 14 [2020-11-28 07:40:28,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 07:40:28,653 INFO L481 AbstractCegarLoop]: Abstraction has 272 states and 674 transitions. [2020-11-28 07:40:28,653 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-28 07:40:28,653 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 674 transitions. [2020-11-28 07:40:28,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-11-28 07:40:28,654 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 07:40:28,654 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 07:40:28,655 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-11-28 07:40:28,655 INFO L429 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 07:40:28,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 07:40:28,655 INFO L82 PathProgramCache]: Analyzing trace with hash -143567105, now seen corresponding path program 1 times [2020-11-28 07:40:28,656 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-28 07:40:28,656 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [584716844] [2020-11-28 07:40:28,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 07:40:28,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 07:40:28,768 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:40:28,768 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [584716844] [2020-11-28 07:40:28,768 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 07:40:28,768 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-28 07:40:28,769 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [719238519] [2020-11-28 07:40:28,769 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-28 07:40:28,769 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-28 07:40:28,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-28 07:40:28,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-11-28 07:40:28,770 INFO L87 Difference]: Start difference. First operand 272 states and 674 transitions. Second operand 5 states. [2020-11-28 07:40:28,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 07:40:28,823 INFO L93 Difference]: Finished difference Result 224 states and 509 transitions. [2020-11-28 07:40:28,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-28 07:40:28,825 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2020-11-28 07:40:28,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 07:40:28,827 INFO L225 Difference]: With dead ends: 224 [2020-11-28 07:40:28,827 INFO L226 Difference]: Without dead ends: 179 [2020-11-28 07:40:28,827 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-11-28 07:40:28,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2020-11-28 07:40:28,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 179. [2020-11-28 07:40:28,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2020-11-28 07:40:28,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 399 transitions. [2020-11-28 07:40:28,834 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 399 transitions. Word has length 15 [2020-11-28 07:40:28,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 07:40:28,835 INFO L481 AbstractCegarLoop]: Abstraction has 179 states and 399 transitions. [2020-11-28 07:40:28,835 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-28 07:40:28,835 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 399 transitions. [2020-11-28 07:40:28,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-11-28 07:40:28,836 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 07:40:28,836 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 07:40:28,836 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-11-28 07:40:28,837 INFO L429 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 07:40:28,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 07:40:28,837 INFO L82 PathProgramCache]: Analyzing trace with hash -150775055, now seen corresponding path program 1 times [2020-11-28 07:40:28,837 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-28 07:40:28,840 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1686850180] [2020-11-28 07:40:28,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 07:40:28,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 07:40:28,917 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:40:28,917 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1686850180] [2020-11-28 07:40:28,917 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 07:40:28,917 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-11-28 07:40:28,917 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [286212937] [2020-11-28 07:40:28,918 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-28 07:40:28,918 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-28 07:40:28,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-28 07:40:28,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-28 07:40:28,918 INFO L87 Difference]: Start difference. First operand 179 states and 399 transitions. Second operand 3 states. [2020-11-28 07:40:28,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 07:40:28,935 INFO L93 Difference]: Finished difference Result 233 states and 504 transitions. [2020-11-28 07:40:28,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-28 07:40:28,936 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2020-11-28 07:40:28,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 07:40:28,937 INFO L225 Difference]: With dead ends: 233 [2020-11-28 07:40:28,937 INFO L226 Difference]: Without dead ends: 181 [2020-11-28 07:40:28,938 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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:40:28,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2020-11-28 07:40:28,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 178. [2020-11-28 07:40:28,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178 states. [2020-11-28 07:40:28,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 383 transitions. [2020-11-28 07:40:28,944 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 383 transitions. Word has length 17 [2020-11-28 07:40:28,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 07:40:28,945 INFO L481 AbstractCegarLoop]: Abstraction has 178 states and 383 transitions. [2020-11-28 07:40:28,945 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-28 07:40:28,945 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 383 transitions. [2020-11-28 07:40:28,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-11-28 07:40:28,946 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 07:40:28,946 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 07:40:28,946 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-11-28 07:40:28,946 INFO L429 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 07:40:28,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 07:40:28,947 INFO L82 PathProgramCache]: Analyzing trace with hash -774509350, now seen corresponding path program 1 times [2020-11-28 07:40:28,947 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-28 07:40:28,947 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [599397276] [2020-11-28 07:40:28,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 07:40:28,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 07:40:29,181 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:40:29,181 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [599397276] [2020-11-28 07:40:29,181 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 07:40:29,181 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-28 07:40:29,181 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [15239454] [2020-11-28 07:40:29,182 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-28 07:40:29,182 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-28 07:40:29,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-28 07:40:29,182 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-11-28 07:40:29,182 INFO L87 Difference]: Start difference. First operand 178 states and 383 transitions. Second operand 6 states. [2020-11-28 07:40:29,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 07:40:29,275 INFO L93 Difference]: Finished difference Result 247 states and 509 transitions. [2020-11-28 07:40:29,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-28 07:40:29,276 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2020-11-28 07:40:29,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 07:40:29,278 INFO L225 Difference]: With dead ends: 247 [2020-11-28 07:40:29,278 INFO L226 Difference]: Without dead ends: 189 [2020-11-28 07:40:29,278 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-11-28 07:40:29,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2020-11-28 07:40:29,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 186. [2020-11-28 07:40:29,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2020-11-28 07:40:29,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 381 transitions. [2020-11-28 07:40:29,285 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 381 transitions. Word has length 18 [2020-11-28 07:40:29,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 07:40:29,286 INFO L481 AbstractCegarLoop]: Abstraction has 186 states and 381 transitions. [2020-11-28 07:40:29,286 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-28 07:40:29,286 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 381 transitions. [2020-11-28 07:40:29,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-11-28 07:40:29,287 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 07:40:29,287 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 07:40:29,287 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-11-28 07:40:29,288 INFO L429 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 07:40:29,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 07:40:29,288 INFO L82 PathProgramCache]: Analyzing trace with hash 348268492, now seen corresponding path program 1 times [2020-11-28 07:40:29,288 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-28 07:40:29,289 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1197165350] [2020-11-28 07:40:29,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 07:40:29,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 07:40:29,411 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:40:29,411 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1197165350] [2020-11-28 07:40:29,412 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 07:40:29,412 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-11-28 07:40:29,412 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [181249682] [2020-11-28 07:40:29,412 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-28 07:40:29,412 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-28 07:40:29,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-28 07:40:29,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-11-28 07:40:29,413 INFO L87 Difference]: Start difference. First operand 186 states and 381 transitions. Second operand 6 states. [2020-11-28 07:40:29,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 07:40:29,492 INFO L93 Difference]: Finished difference Result 167 states and 343 transitions. [2020-11-28 07:40:29,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-28 07:40:29,493 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2020-11-28 07:40:29,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 07:40:29,494 INFO L225 Difference]: With dead ends: 167 [2020-11-28 07:40:29,494 INFO L226 Difference]: Without dead ends: 74 [2020-11-28 07:40:29,495 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-11-28 07:40:29,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2020-11-28 07:40:29,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 62. [2020-11-28 07:40:29,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2020-11-28 07:40:29,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 109 transitions. [2020-11-28 07:40:29,498 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 109 transitions. Word has length 18 [2020-11-28 07:40:29,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 07:40:29,498 INFO L481 AbstractCegarLoop]: Abstraction has 62 states and 109 transitions. [2020-11-28 07:40:29,498 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-28 07:40:29,498 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 109 transitions. [2020-11-28 07:40:29,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-11-28 07:40:29,499 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 07:40:29,499 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 07:40:29,499 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-11-28 07:40:29,499 INFO L429 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 07:40:29,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 07:40:29,500 INFO L82 PathProgramCache]: Analyzing trace with hash -166522415, now seen corresponding path program 1 times [2020-11-28 07:40:29,500 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-28 07:40:29,500 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [454840103] [2020-11-28 07:40:29,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 07:40:29,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 07:40:29,737 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:40:29,737 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [454840103] [2020-11-28 07:40:29,738 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 07:40:29,738 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-11-28 07:40:29,738 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1169323982] [2020-11-28 07:40:29,738 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-11-28 07:40:29,738 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-28 07:40:29,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-11-28 07:40:29,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2020-11-28 07:40:29,739 INFO L87 Difference]: Start difference. First operand 62 states and 109 transitions. Second operand 8 states. [2020-11-28 07:40:29,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 07:40:29,898 INFO L93 Difference]: Finished difference Result 82 states and 144 transitions. [2020-11-28 07:40:29,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-28 07:40:29,900 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 21 [2020-11-28 07:40:29,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 07:40:29,901 INFO L225 Difference]: With dead ends: 82 [2020-11-28 07:40:29,901 INFO L226 Difference]: Without dead ends: 50 [2020-11-28 07:40:29,901 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2020-11-28 07:40:29,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2020-11-28 07:40:29,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2020-11-28 07:40:29,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2020-11-28 07:40:29,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 85 transitions. [2020-11-28 07:40:29,903 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 85 transitions. Word has length 21 [2020-11-28 07:40:29,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 07:40:29,903 INFO L481 AbstractCegarLoop]: Abstraction has 50 states and 85 transitions. [2020-11-28 07:40:29,903 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-11-28 07:40:29,904 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 85 transitions. [2020-11-28 07:40:29,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-11-28 07:40:29,904 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 07:40:29,904 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 07:40:29,904 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-11-28 07:40:29,904 INFO L429 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 07:40:29,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 07:40:29,905 INFO L82 PathProgramCache]: Analyzing trace with hash -531994123, now seen corresponding path program 2 times [2020-11-28 07:40:29,905 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-28 07:40:29,905 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [755648366] [2020-11-28 07:40:29,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 07:40:29,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 07:40:29,946 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 07:40:29,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 07:40:29,985 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 07:40:30,016 INFO L173 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2020-11-28 07:40:30,016 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-11-28 07:40:30,017 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-11-28 07:40:30,017 WARN L264 etLargeBlockEncoding]: Failed to translate choice composition: Branch encoders not available. [2020-11-28 07:40:30,030 WARN L124 codingBacktranslator]: Skipped backtranslation of ATE [1057] [1057] L826-->L834: Formula: (let ((.cse7 (= (mod ~x$w_buff0_used~0_In-222297497 256) 0)) (.cse6 (= (mod ~x$r_buff0_thd0~0_In-222297497 256) 0)) (.cse9 (= (mod ~x$r_buff1_thd0~0_In-222297497 256) 0)) (.cse8 (= (mod ~x$w_buff1_used~0_In-222297497 256) 0))) (let ((.cse3 (or .cse9 .cse8)) (.cse1 (not .cse9)) (.cse2 (not .cse8)) (.cse4 (not .cse6)) (.cse5 (not .cse7)) (.cse0 (or .cse6 .cse7))) (and (= |ULTIMATE.start_assume_abort_if_not_#in~cond_Out-222297497| (mod ~main$tmp_guard0~0_In-222297497 256)) (not (= ULTIMATE.start_assume_abort_if_not_~cond_Out-222297497 0)) (or (and .cse0 (or (and (= ~x~0_Out-222297497 ~x$w_buff1~0_In-222297497) .cse1 .cse2) (and .cse3 (= ~x~0_In-222297497 ~x~0_Out-222297497)))) (and .cse4 (= ~x~0_Out-222297497 ~x$w_buff0~0_In-222297497) .cse5)) (or (and (= ~x$w_buff1_used~0_In-222297497 ~x$w_buff1_used~0_Out-222297497) .cse3) (and .cse1 (= ~x$w_buff1_used~0_Out-222297497 0) .cse2)) (or (and .cse4 .cse5 (= ~x$w_buff0_used~0_Out-222297497 0)) (and (= ~x$w_buff0_used~0_In-222297497 ~x$w_buff0_used~0_Out-222297497) .cse0)) (= ULTIMATE.start_assume_abort_if_not_~cond_Out-222297497 |ULTIMATE.start_assume_abort_if_not_#in~cond_Out-222297497|) (= ~x$r_buff0_thd0~0_In-222297497 ~x$r_buff0_thd0~0_Out-222297497) (= ~x$r_buff1_thd0~0_Out-222297497 ~x$r_buff1_thd0~0_In-222297497)))) InVars {~x$w_buff0~0=~x$w_buff0~0_In-222297497, ~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-222297497, ~x$w_buff1~0=~x$w_buff1~0_In-222297497, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-222297497, ~main$tmp_guard0~0=~main$tmp_guard0~0_In-222297497, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-222297497, ~x~0=~x~0_In-222297497, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-222297497} OutVars{~x$w_buff0~0=~x$w_buff0~0_In-222297497, ~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_Out-222297497, ULTIMATE.start_main_#t~ite28=|ULTIMATE.start_main_#t~ite28_Out-222297497|, ULTIMATE.start_main_#t~ite29=|ULTIMATE.start_main_#t~ite29_Out-222297497|, ~x$w_buff1~0=~x$w_buff1~0_In-222297497, ~x$w_buff1_used~0=~x$w_buff1_used~0_Out-222297497, ULTIMATE.start_main_#t~ite26=|ULTIMATE.start_main_#t~ite26_Out-222297497|, ULTIMATE.start_main_#t~ite27=|ULTIMATE.start_main_#t~ite27_Out-222297497|, ~main$tmp_guard0~0=~main$tmp_guard0~0_In-222297497, ULTIMATE.start_main_#t~ite31=|ULTIMATE.start_main_#t~ite31_Out-222297497|, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_Out-222297497, ~x$w_buff0_used~0=~x$w_buff0_used~0_Out-222297497, ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_Out-222297497|, ULTIMATE.start_main_#t~ite30=|ULTIMATE.start_main_#t~ite30_Out-222297497|, ULTIMATE.start_assume_abort_if_not_~cond=ULTIMATE.start_assume_abort_if_not_~cond_Out-222297497, ~x~0=~x~0_Out-222297497} AuxVars[] AssignedVars[~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite28, ULTIMATE.start_main_#t~ite29, ~x$w_buff1_used~0, ULTIMATE.start_main_#t~ite26, ULTIMATE.start_main_#t~ite27, ULTIMATE.start_main_#t~ite31, ~x$r_buff1_thd0~0, ~x$w_buff0_used~0, ULTIMATE.start_assume_abort_if_not_#in~cond, ULTIMATE.start_main_#t~ite30, ULTIMATE.start_assume_abort_if_not_~cond, ~x~0] because there is no mapped edge [2020-11-28 07:40:30,033 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:40:30,034 WARN L224 RCFGBacktranslator]: unable to determine which branch was taken at C: __VERIFIER_atomic_begin() [760] [2020-11-28 07:40:30,035 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:40:30,036 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 07:40:30,036 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:40:30,036 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 07:40:30,036 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:40:30,036 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 07:40:30,036 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:40:30,037 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 07:40:30,037 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:40:30,037 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 07:40:30,037 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:40:30,037 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 07:40:30,038 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:40:30,038 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 07:40:30,038 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:40:30,038 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 07:40:30,038 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:40:30,039 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 07:40:30,039 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:40:30,039 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 07:40:30,039 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:40:30,039 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 07:40:30,039 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:40:30,039 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 07:40:30,040 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:40:30,040 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 07:40:30,040 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:40:30,040 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 07:40:30,041 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:40:30,041 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 07:40:30,041 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:40:30,041 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 07:40:30,041 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:40:30,041 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 07:40:30,042 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:40:30,042 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 07:40:30,042 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:40:30,042 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 07:40:30,043 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:40:30,043 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 07:40:30,043 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:40:30,043 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 07:40:30,043 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:40:30,043 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 07:40:30,044 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:40:30,044 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 07:40:30,044 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:40:30,044 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 07:40:30,044 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:40:30,044 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 07:40:30,045 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:40:30,045 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 07:40:30,045 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:40:30,045 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 07:40:30,045 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:40:30,045 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 07:40:30,046 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:40:30,046 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 07:40:30,046 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:40:30,046 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 07:40:30,137 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 07:40:30 BasicIcfg [2020-11-28 07:40:30,137 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-11-28 07:40:30,137 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-11-28 07:40:30,137 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-11-28 07:40:30,138 INFO L275 PluginConnector]: Witness Printer initialized [2020-11-28 07:40:30,138 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 07:40:15" (3/4) ... [2020-11-28 07:40:30,140 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2020-11-28 07:40:30,149 WARN L124 codingBacktranslator]: Skipped backtranslation of ATE [1057] [1057] L826-->L834: Formula: (let ((.cse7 (= (mod ~x$w_buff0_used~0_In-222297497 256) 0)) (.cse6 (= (mod ~x$r_buff0_thd0~0_In-222297497 256) 0)) (.cse9 (= (mod ~x$r_buff1_thd0~0_In-222297497 256) 0)) (.cse8 (= (mod ~x$w_buff1_used~0_In-222297497 256) 0))) (let ((.cse3 (or .cse9 .cse8)) (.cse1 (not .cse9)) (.cse2 (not .cse8)) (.cse4 (not .cse6)) (.cse5 (not .cse7)) (.cse0 (or .cse6 .cse7))) (and (= |ULTIMATE.start_assume_abort_if_not_#in~cond_Out-222297497| (mod ~main$tmp_guard0~0_In-222297497 256)) (not (= ULTIMATE.start_assume_abort_if_not_~cond_Out-222297497 0)) (or (and .cse0 (or (and (= ~x~0_Out-222297497 ~x$w_buff1~0_In-222297497) .cse1 .cse2) (and .cse3 (= ~x~0_In-222297497 ~x~0_Out-222297497)))) (and .cse4 (= ~x~0_Out-222297497 ~x$w_buff0~0_In-222297497) .cse5)) (or (and (= ~x$w_buff1_used~0_In-222297497 ~x$w_buff1_used~0_Out-222297497) .cse3) (and .cse1 (= ~x$w_buff1_used~0_Out-222297497 0) .cse2)) (or (and .cse4 .cse5 (= ~x$w_buff0_used~0_Out-222297497 0)) (and (= ~x$w_buff0_used~0_In-222297497 ~x$w_buff0_used~0_Out-222297497) .cse0)) (= ULTIMATE.start_assume_abort_if_not_~cond_Out-222297497 |ULTIMATE.start_assume_abort_if_not_#in~cond_Out-222297497|) (= ~x$r_buff0_thd0~0_In-222297497 ~x$r_buff0_thd0~0_Out-222297497) (= ~x$r_buff1_thd0~0_Out-222297497 ~x$r_buff1_thd0~0_In-222297497)))) InVars {~x$w_buff0~0=~x$w_buff0~0_In-222297497, ~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-222297497, ~x$w_buff1~0=~x$w_buff1~0_In-222297497, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-222297497, ~main$tmp_guard0~0=~main$tmp_guard0~0_In-222297497, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-222297497, ~x~0=~x~0_In-222297497, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-222297497} OutVars{~x$w_buff0~0=~x$w_buff0~0_In-222297497, ~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_Out-222297497, ULTIMATE.start_main_#t~ite28=|ULTIMATE.start_main_#t~ite28_Out-222297497|, ULTIMATE.start_main_#t~ite29=|ULTIMATE.start_main_#t~ite29_Out-222297497|, ~x$w_buff1~0=~x$w_buff1~0_In-222297497, ~x$w_buff1_used~0=~x$w_buff1_used~0_Out-222297497, ULTIMATE.start_main_#t~ite26=|ULTIMATE.start_main_#t~ite26_Out-222297497|, ULTIMATE.start_main_#t~ite27=|ULTIMATE.start_main_#t~ite27_Out-222297497|, ~main$tmp_guard0~0=~main$tmp_guard0~0_In-222297497, ULTIMATE.start_main_#t~ite31=|ULTIMATE.start_main_#t~ite31_Out-222297497|, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_Out-222297497, ~x$w_buff0_used~0=~x$w_buff0_used~0_Out-222297497, ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_Out-222297497|, ULTIMATE.start_main_#t~ite30=|ULTIMATE.start_main_#t~ite30_Out-222297497|, ULTIMATE.start_assume_abort_if_not_~cond=ULTIMATE.start_assume_abort_if_not_~cond_Out-222297497, ~x~0=~x~0_Out-222297497} AuxVars[] AssignedVars[~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite28, ULTIMATE.start_main_#t~ite29, ~x$w_buff1_used~0, ULTIMATE.start_main_#t~ite26, ULTIMATE.start_main_#t~ite27, ULTIMATE.start_main_#t~ite31, ~x$r_buff1_thd0~0, ~x$w_buff0_used~0, ULTIMATE.start_assume_abort_if_not_#in~cond, ULTIMATE.start_main_#t~ite30, ULTIMATE.start_assume_abort_if_not_~cond, ~x~0] because there is no mapped edge [2020-11-28 07:40:30,151 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:40:30,151 WARN L224 RCFGBacktranslator]: unable to determine which branch was taken at C: __VERIFIER_atomic_begin() [760] [2020-11-28 07:40:30,151 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:40:30,152 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 07:40:30,152 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:40:30,152 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 07:40:30,152 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:40:30,152 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 07:40:30,152 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:40:30,152 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 07:40:30,153 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:40:30,153 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 07:40:30,153 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:40:30,153 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 07:40:30,153 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:40:30,153 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 07:40:30,154 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:40:30,154 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 07:40:30,154 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:40:30,154 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 07:40:30,154 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:40:30,154 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 07:40:30,154 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:40:30,154 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 07:40:30,155 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:40:30,155 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 07:40:30,155 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:40:30,155 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 07:40:30,155 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:40:30,155 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 07:40:30,155 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:40:30,156 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 07:40:30,156 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:40:30,156 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 07:40:30,156 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:40:30,156 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 07:40:30,156 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:40:30,157 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 07:40:30,157 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:40:30,157 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 07:40:30,157 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:40:30,157 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 07:40:30,157 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:40:30,157 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 07:40:30,158 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:40:30,158 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 07:40:30,158 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:40:30,158 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 07:40:30,158 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:40:30,158 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 07:40:30,158 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:40:30,159 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 07:40:30,159 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:40:30,159 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 07:40:30,159 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:40:30,159 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 07:40:30,159 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:40:30,159 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 07:40:30,159 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:40:30,160 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 07:40:30,160 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:40:30,160 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 07:40:30,263 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_0e001564-45a1-4a0f-89d0-fb8a63c95091/bin/utaipan/witness.graphml [2020-11-28 07:40:30,269 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-11-28 07:40:30,271 INFO L168 Benchmark]: Toolchain (without parser) took 18293.32 ms. Allocated memory was 81.8 MB in the beginning and 327.2 MB in the end (delta: 245.4 MB). Free memory was 54.4 MB in the beginning and 152.6 MB in the end (delta: -98.2 MB). Peak memory consumption was 148.8 MB. Max. memory is 16.1 GB. [2020-11-28 07:40:30,271 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 81.8 MB. Free memory was 62.0 MB in the beginning and 61.9 MB in the end (delta: 36.2 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-11-28 07:40:30,272 INFO L168 Benchmark]: CACSL2BoogieTranslator took 740.11 ms. Allocated memory is still 81.8 MB. Free memory was 54.2 MB in the beginning and 41.5 MB in the end (delta: 12.7 MB). Peak memory consumption was 22.2 MB. Max. memory is 16.1 GB. [2020-11-28 07:40:30,272 INFO L168 Benchmark]: Boogie Procedure Inliner took 98.22 ms. Allocated memory is still 81.8 MB. Free memory was 41.5 MB in the beginning and 38.5 MB in the end (delta: 3.0 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2020-11-28 07:40:30,272 INFO L168 Benchmark]: Boogie Preprocessor took 91.70 ms. Allocated memory is still 81.8 MB. Free memory was 38.5 MB in the beginning and 36.4 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:40:30,273 INFO L168 Benchmark]: RCFGBuilder took 2715.68 ms. Allocated memory was 81.8 MB in the beginning and 125.8 MB in the end (delta: 44.0 MB). Free memory was 36.1 MB in the beginning and 92.4 MB in the end (delta: -56.2 MB). Peak memory consumption was 35.7 MB. Max. memory is 16.1 GB. [2020-11-28 07:40:30,273 INFO L168 Benchmark]: TraceAbstraction took 14507.76 ms. Allocated memory was 125.8 MB in the beginning and 327.2 MB in the end (delta: 201.3 MB). Free memory was 92.4 MB in the beginning and 168.4 MB in the end (delta: -76.0 MB). Peak memory consumption was 125.2 MB. Max. memory is 16.1 GB. [2020-11-28 07:40:30,274 INFO L168 Benchmark]: Witness Printer took 132.03 ms. Allocated memory is still 327.2 MB. Free memory was 168.4 MB in the beginning and 152.6 MB in the end (delta: 15.8 MB). Peak memory consumption was 16.8 MB. Max. memory is 16.1 GB. [2020-11-28 07:40:30,276 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.21 ms. Allocated memory is still 81.8 MB. Free memory was 62.0 MB in the beginning and 61.9 MB in the end (delta: 36.2 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 740.11 ms. Allocated memory is still 81.8 MB. Free memory was 54.2 MB in the beginning and 41.5 MB in the end (delta: 12.7 MB). Peak memory consumption was 22.2 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 98.22 ms. Allocated memory is still 81.8 MB. Free memory was 41.5 MB in the beginning and 38.5 MB in the end (delta: 3.0 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 91.70 ms. Allocated memory is still 81.8 MB. Free memory was 38.5 MB in the beginning and 36.4 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 2715.68 ms. Allocated memory was 81.8 MB in the beginning and 125.8 MB in the end (delta: 44.0 MB). Free memory was 36.1 MB in the beginning and 92.4 MB in the end (delta: -56.2 MB). Peak memory consumption was 35.7 MB. Max. memory is 16.1 GB. * TraceAbstraction took 14507.76 ms. Allocated memory was 125.8 MB in the beginning and 327.2 MB in the end (delta: 201.3 MB). Free memory was 92.4 MB in the beginning and 168.4 MB in the end (delta: -76.0 MB). Peak memory consumption was 125.2 MB. Max. memory is 16.1 GB. * Witness Printer took 132.03 ms. Allocated memory is still 327.2 MB. Free memory was 168.4 MB in the beginning and 152.6 MB in the end (delta: 15.8 MB). Peak memory consumption was 16.8 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 1371 VarBasedMoverChecksPositive, 98 VarBasedMoverChecksNegative, 41 SemBasedMoverChecksPositive, 57 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 2.6s, 139 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 10.8s, 108 PlacesBefore, 36 PlacesAfterwards, 101 TransitionsBefore, 27 TransitionsAfterwards, 1862 CoEnabledTransitionPairs, 7 FixpointIterations, 35 TrivialSequentialCompositions, 44 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 13 ConcurrentYvCompositions, 2 ChoiceCompositions, 94 TotalNumberOfCompositions, 5308 MoverChecksTotal - CounterExampleResult [Line: 17]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p2_EAX = 0; [L712] 0 _Bool main$tmp_guard0; [L713] 0 _Bool main$tmp_guard1; [L715] 0 int x = 0; [L716] 0 _Bool x$flush_delayed; [L717] 0 int x$mem_tmp; [L718] 0 _Bool x$r_buff0_thd0; [L719] 0 _Bool x$r_buff0_thd1; [L720] 0 _Bool x$r_buff0_thd2; [L721] 0 _Bool x$r_buff0_thd3; [L722] 0 _Bool x$r_buff1_thd0; [L723] 0 _Bool x$r_buff1_thd1; [L724] 0 _Bool x$r_buff1_thd2; [L725] 0 _Bool x$r_buff1_thd3; [L726] 0 _Bool x$read_delayed; [L727] 0 int *x$read_delayed_var; [L728] 0 int x$w_buff0; [L729] 0 _Bool x$w_buff0_used; [L730] 0 int x$w_buff1; [L731] 0 _Bool x$w_buff1_used; [L733] 0 int y = 0; [L735] 0 int z = 0; [L736] 0 _Bool weak$$choice0; [L737] 0 _Bool weak$$choice2; [L818] 0 pthread_t t2028; [L819] FCALL, FORK 0 pthread_create(&t2028, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L820] 0 pthread_t t2029; [L821] FCALL, FORK 0 pthread_create(&t2029, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L761] 2 x$w_buff1 = x$w_buff0 [L762] 2 x$w_buff0 = 2 [L763] 2 x$w_buff1_used = x$w_buff0_used [L764] 2 x$w_buff0_used = (_Bool)1 [L18] COND FALSE 2 !(!expression) [L766] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L767] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L768] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L769] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L770] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L773] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L822] 0 pthread_t t2030; [L823] FCALL, FORK 0 pthread_create(&t2030, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L790] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L793] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L741] 1 z = 2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L796] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L796] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L796] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L796] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L797] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L797] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L798] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L798] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L799] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L799] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L800] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L800] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L803] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L805] 3 return 0; [L744] 1 x = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L776] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L776] EXPR 2 x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x [L776] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L776] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L777] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L777] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L778] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L778] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L779] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L779] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L780] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L780] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L783] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L785] 2 return 0; [L747] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L747] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L748] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L748] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L749] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L749] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L750] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L750] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L751] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L751] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L754] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L756] 1 return 0; [L825] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L836] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L837] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L838] 0 x$flush_delayed = weak$$choice2 [L839] 0 x$mem_tmp = x [L840] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L840] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L841] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L841] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L842] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L842] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1) [L842] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L842] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L843] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L843] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used) [L843] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L843] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L844] EXPR 0 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L844] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L845] EXPR 0 weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L845] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0) [L845] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L845] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0) [L845] EXPR 0 weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L845] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L846] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L846] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L846] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L846] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L847] 0 main$tmp_guard1 = !(x == 2 && z == 2 && __unbuffered_p2_EAX == 1) [L848] EXPR 0 x$flush_delayed ? x$mem_tmp : x [L848] 0 x = x$flush_delayed ? x$mem_tmp : x [L849] 0 x$flush_delayed = (_Bool)0 [L18] COND TRUE 0 !expression [L17] COND FALSE 0 !(0) [L17] 0 __assert_fail ("0", "safe011_power.opt.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=51, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 99 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 14.2s, OverallIterations: 13, TraceHistogramMax: 1, AutomataDifference: 1.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 10.9s, HoareTripleCheckerStatistics: 241 SDtfs, 374 SDslu, 364 SDs, 0 SdLazy, 198 SolverSat, 88 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 48 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=822occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 12 MinimizatonAttempts, 18 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 187 NumberOfCodeBlocks, 187 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 154 ConstructedInterpolants, 0 QuantifiedInterpolants, 16737 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...