./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/safe034_power.opt_false-unreach-call.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_cc670290-5caf-4636-a293-a681749cb43f/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_cc670290-5caf-4636-a293-a681749cb43f/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_cc670290-5caf-4636-a293-a681749cb43f/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_cc670290-5caf-4636-a293-a681749cb43f/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-wmm/safe034_power.opt_false-unreach-call.i -s /tmp/vcloud-vcloud-master/worker/working_dir_cc670290-5caf-4636-a293-a681749cb43f/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_cc670290-5caf-4636-a293-a681749cb43f/bin-2019/utaipan --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash db4a16c4986c75df8f6a17811333c8e3362ce3a1 .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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.1.23-635dfa2 [2018-12-09 00:28:47,677 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-09 00:28:47,678 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-09 00:28:47,684 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-09 00:28:47,685 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-09 00:28:47,685 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-09 00:28:47,686 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-09 00:28:47,687 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-09 00:28:47,688 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-09 00:28:47,688 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-09 00:28:47,689 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-09 00:28:47,689 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-09 00:28:47,690 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-09 00:28:47,690 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-09 00:28:47,691 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-09 00:28:47,691 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-09 00:28:47,692 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-09 00:28:47,693 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-09 00:28:47,694 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-09 00:28:47,695 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-09 00:28:47,695 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-09 00:28:47,696 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-09 00:28:47,697 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-09 00:28:47,698 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-09 00:28:47,698 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-09 00:28:47,698 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-09 00:28:47,699 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-09 00:28:47,699 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-09 00:28:47,700 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-09 00:28:47,701 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-09 00:28:47,701 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-09 00:28:47,701 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-09 00:28:47,701 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-09 00:28:47,701 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-09 00:28:47,702 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-09 00:28:47,703 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-09 00:28:47,703 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_cc670290-5caf-4636-a293-a681749cb43f/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-12-09 00:28:47,710 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-09 00:28:47,710 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-09 00:28:47,711 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-09 00:28:47,711 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-09 00:28:47,711 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-09 00:28:47,711 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-09 00:28:47,712 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-09 00:28:47,712 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-09 00:28:47,712 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-09 00:28:47,712 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-09 00:28:47,712 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-09 00:28:47,712 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-09 00:28:47,712 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-09 00:28:47,713 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-09 00:28:47,713 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-09 00:28:47,713 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-09 00:28:47,713 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-09 00:28:47,713 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-09 00:28:47,714 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-09 00:28:47,714 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-09 00:28:47,714 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-09 00:28:47,714 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-09 00:28:47,714 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-09 00:28:47,714 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-09 00:28:47,714 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-09 00:28:47,714 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-09 00:28:47,715 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-09 00:28:47,715 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-09 00:28:47,715 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-09 00:28:47,715 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-09 00:28:47,715 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-09 00:28:47,715 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-09 00:28:47,715 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-09 00:28:47,715 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-09 00:28:47,716 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-09 00:28:47,716 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-09 00:28:47,716 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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/working_dir_cc670290-5caf-4636-a293-a681749cb43f/bin-2019/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(__VERIFIER_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 -> db4a16c4986c75df8f6a17811333c8e3362ce3a1 [2018-12-09 00:28:47,733 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-09 00:28:47,740 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-09 00:28:47,742 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-09 00:28:47,743 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-09 00:28:47,743 INFO L276 PluginConnector]: CDTParser initialized [2018-12-09 00:28:47,743 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_cc670290-5caf-4636-a293-a681749cb43f/bin-2019/utaipan/../../sv-benchmarks/c/pthread-wmm/safe034_power.opt_false-unreach-call.i [2018-12-09 00:28:47,780 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_cc670290-5caf-4636-a293-a681749cb43f/bin-2019/utaipan/data/c648f937d/26e0c379727341b2932b13958424517e/FLAG42aad10eb [2018-12-09 00:28:48,246 INFO L307 CDTParser]: Found 1 translation units. [2018-12-09 00:28:48,246 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_cc670290-5caf-4636-a293-a681749cb43f/sv-benchmarks/c/pthread-wmm/safe034_power.opt_false-unreach-call.i [2018-12-09 00:28:48,253 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_cc670290-5caf-4636-a293-a681749cb43f/bin-2019/utaipan/data/c648f937d/26e0c379727341b2932b13958424517e/FLAG42aad10eb [2018-12-09 00:28:48,261 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_cc670290-5caf-4636-a293-a681749cb43f/bin-2019/utaipan/data/c648f937d/26e0c379727341b2932b13958424517e [2018-12-09 00:28:48,263 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-09 00:28:48,264 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-09 00:28:48,265 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-09 00:28:48,265 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-09 00:28:48,267 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-09 00:28:48,267 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 12:28:48" (1/1) ... [2018-12-09 00:28:48,269 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6ab2707f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:28:48, skipping insertion in model container [2018-12-09 00:28:48,269 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 12:28:48" (1/1) ... [2018-12-09 00:28:48,273 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-09 00:28:48,294 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-09 00:28:48,468 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 00:28:48,475 INFO L191 MainTranslator]: Completed pre-run [2018-12-09 00:28:48,546 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 00:28:48,577 INFO L195 MainTranslator]: Completed translation [2018-12-09 00:28:48,577 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:28:48 WrapperNode [2018-12-09 00:28:48,577 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-09 00:28:48,578 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-09 00:28:48,578 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-09 00:28:48,578 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-09 00:28:48,583 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:28:48" (1/1) ... [2018-12-09 00:28:48,593 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:28:48" (1/1) ... [2018-12-09 00:28:48,609 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-09 00:28:48,609 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-09 00:28:48,609 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-09 00:28:48,609 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-09 00:28:48,615 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:28:48" (1/1) ... [2018-12-09 00:28:48,616 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:28:48" (1/1) ... [2018-12-09 00:28:48,618 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:28:48" (1/1) ... [2018-12-09 00:28:48,618 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:28:48" (1/1) ... [2018-12-09 00:28:48,623 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:28:48" (1/1) ... [2018-12-09 00:28:48,626 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:28:48" (1/1) ... [2018-12-09 00:28:48,627 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:28:48" (1/1) ... [2018-12-09 00:28:48,629 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-09 00:28:48,629 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-09 00:28:48,629 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-09 00:28:48,629 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-09 00:28:48,630 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:28:48" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_cc670290-5caf-4636-a293-a681749cb43f/bin-2019/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 [2018-12-09 00:28:48,662 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-09 00:28:48,662 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-09 00:28:48,662 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2018-12-09 00:28:48,662 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-09 00:28:48,662 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2018-12-09 00:28:48,662 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2018-12-09 00:28:48,662 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2018-12-09 00:28:48,662 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2018-12-09 00:28:48,663 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2018-12-09 00:28:48,663 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2018-12-09 00:28:48,663 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2018-12-09 00:28:48,663 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-09 00:28:48,663 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-09 00:28:48,664 WARN L198 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2018-12-09 00:28:48,985 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-09 00:28:48,985 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-12-09 00:28:48,985 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 12:28:48 BoogieIcfgContainer [2018-12-09 00:28:48,985 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-09 00:28:48,986 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-09 00:28:48,986 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-09 00:28:48,988 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-09 00:28:48,988 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 12:28:48" (1/3) ... [2018-12-09 00:28:48,989 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2605a00c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 12:28:48, skipping insertion in model container [2018-12-09 00:28:48,989 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:28:48" (2/3) ... [2018-12-09 00:28:48,989 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2605a00c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 12:28:48, skipping insertion in model container [2018-12-09 00:28:48,989 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 12:28:48" (3/3) ... [2018-12-09 00:28:48,990 INFO L112 eAbstractionObserver]: Analyzing ICFG safe034_power.opt_false-unreach-call.i [2018-12-09 00:28:49,013 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:28:49,014 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:28:49,014 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:28:49,014 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:28:49,014 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet3.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:28:49,014 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet3.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:28:49,015 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:28:49,015 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:28:49,015 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet3.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:28:49,015 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet3.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:28:49,016 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet5.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:28:49,016 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet4.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:28:49,016 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:28:49,016 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:28:49,016 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet4.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:28:49,016 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet5.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:28:49,016 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet4.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:28:49,016 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:28:49,017 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet5.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:28:49,017 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:28:49,017 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet4.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:28:49,017 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet5.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:28:49,017 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:28:49,017 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:28:49,018 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:28:49,018 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:28:49,018 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:28:49,018 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:28:49,018 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:28:49,018 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:28:49,018 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:28:49,019 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:28:49,019 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:28:49,019 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:28:49,019 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:28:49,019 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:28:49,019 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:28:49,020 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:28:49,020 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:28:49,020 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:28:49,020 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:28:49,020 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:28:49,021 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:28:49,021 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:28:49,021 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:28:49,021 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:28:49,021 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:28:49,021 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:28:49,021 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:28:49,022 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:28:49,022 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:28:49,022 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:28:49,022 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:28:49,022 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:28:49,022 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:28:49,023 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:28:49,023 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:28:49,023 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:28:49,023 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:28:49,023 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:28:49,023 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:28:49,024 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:28:49,024 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:28:49,024 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:28:49,024 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:28:49,024 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:28:49,024 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:28:49,024 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:28:49,025 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:28:49,025 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:28:49,025 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:28:49,025 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:28:49,025 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:28:49,025 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:28:49,026 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:28:49,026 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:28:49,026 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:28:49,026 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:28:49,026 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:28:49,026 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:28:49,027 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:28:49,027 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:28:49,027 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:28:49,027 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:28:49,027 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:28:49,027 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:28:49,028 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:28:49,028 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:28:49,028 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:28:49,028 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:28:49,028 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:28:49,028 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:28:49,028 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:28:49,029 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:28:49,029 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:28:49,029 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:28:49,029 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:28:49,029 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:28:49,029 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:28:49,030 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:28:49,030 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:28:49,030 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:28:49,030 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:28:49,030 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:28:49,030 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:28:49,030 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:28:49,031 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet27.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:28:49,031 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet27.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:28:49,031 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:28:49,031 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:28:49,031 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet27.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:28:49,031 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet27.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:28:49,032 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:28:49,032 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:28:49,032 WARN L317 ript$VariableManager]: TermVariabe Thread2_P2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:28:49,032 WARN L317 ript$VariableManager]: TermVariabe Thread2_P2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:28:49,032 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:28:49,032 WARN L317 ript$VariableManager]: TermVariabe Thread2_P2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:28:49,033 WARN L317 ript$VariableManager]: TermVariabe Thread2_P2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:28:49,033 WARN L317 ript$VariableManager]: TermVariabe Thread2_P2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:28:49,033 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:28:49,033 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:28:49,033 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:28:49,033 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:28:49,033 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:28:49,034 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:28:49,034 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:28:49,034 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:28:49,034 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:28:49,034 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:28:49,034 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:28:49,034 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:28:49,035 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:28:49,035 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:28:49,035 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:28:49,035 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:28:49,035 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:28:49,035 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:28:49,035 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:28:49,036 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:28:49,036 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:28:49,036 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:28:49,036 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:28:49,036 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:28:49,036 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~nondet34.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:28:49,036 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~nondet34.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:28:49,036 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:28:49,037 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:28:49,037 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~nondet34.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:28:49,037 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~nondet34.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:28:49,043 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2018-12-09 00:28:49,043 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-09 00:28:49,050 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-12-09 00:28:49,064 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2018-12-09 00:28:49,080 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-09 00:28:49,080 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-09 00:28:49,080 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-09 00:28:49,080 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-09 00:28:49,080 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-09 00:28:49,080 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-09 00:28:49,080 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-09 00:28:49,080 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-09 00:28:49,087 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 144places, 175 transitions [2018-12-09 00:29:08,433 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 149043 states. [2018-12-09 00:29:08,434 INFO L276 IsEmpty]: Start isEmpty. Operand 149043 states. [2018-12-09 00:29:08,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-12-09 00:29:08,444 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:29:08,444 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 00:29:08,446 INFO L423 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:29:08,449 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:29:08,449 INFO L82 PathProgramCache]: Analyzing trace with hash -1284724798, now seen corresponding path program 1 times [2018-12-09 00:29:08,451 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 00:29:08,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:29:08,487 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:29:08,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:29:08,487 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 00:29:08,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:29:08,597 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:29:08,599 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:29:08,599 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 00:29:08,599 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 00:29:08,602 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 00:29:08,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 00:29:08,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 00:29:08,612 INFO L87 Difference]: Start difference. First operand 149043 states. Second operand 4 states. [2018-12-09 00:29:09,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:29:09,876 INFO L93 Difference]: Finished difference Result 257063 states and 1188602 transitions. [2018-12-09 00:29:09,877 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 00:29:09,877 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 44 [2018-12-09 00:29:09,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:29:12,422 INFO L225 Difference]: With dead ends: 257063 [2018-12-09 00:29:12,422 INFO L226 Difference]: Without dead ends: 174813 [2018-12-09 00:29:12,423 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 00:29:13,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174813 states. [2018-12-09 00:29:15,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174813 to 110553. [2018-12-09 00:29:15,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110553 states. [2018-12-09 00:29:15,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110553 states to 110553 states and 511484 transitions. [2018-12-09 00:29:15,431 INFO L78 Accepts]: Start accepts. Automaton has 110553 states and 511484 transitions. Word has length 44 [2018-12-09 00:29:15,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:29:15,432 INFO L480 AbstractCegarLoop]: Abstraction has 110553 states and 511484 transitions. [2018-12-09 00:29:15,432 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 00:29:15,432 INFO L276 IsEmpty]: Start isEmpty. Operand 110553 states and 511484 transitions. [2018-12-09 00:29:15,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-12-09 00:29:15,442 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:29:15,443 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 00:29:15,443 INFO L423 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:29:15,443 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:29:15,443 INFO L82 PathProgramCache]: Analyzing trace with hash -1885719038, now seen corresponding path program 1 times [2018-12-09 00:29:15,443 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 00:29:15,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:29:15,446 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:29:15,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:29:15,447 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 00:29:15,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:29:15,507 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:29:15,507 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:29:15,507 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 00:29:15,507 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 00:29:15,508 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 00:29:15,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 00:29:15,509 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 00:29:15,509 INFO L87 Difference]: Start difference. First operand 110553 states and 511484 transitions. Second operand 5 states. [2018-12-09 00:29:16,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:29:16,816 INFO L93 Difference]: Finished difference Result 240603 states and 1068739 transitions. [2018-12-09 00:29:16,816 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 00:29:16,816 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 52 [2018-12-09 00:29:16,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:29:17,465 INFO L225 Difference]: With dead ends: 240603 [2018-12-09 00:29:17,465 INFO L226 Difference]: Without dead ends: 237053 [2018-12-09 00:29:17,466 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-09 00:29:20,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237053 states. [2018-12-09 00:29:22,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237053 to 160433. [2018-12-09 00:29:22,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160433 states. [2018-12-09 00:29:23,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160433 states to 160433 states and 716928 transitions. [2018-12-09 00:29:23,563 INFO L78 Accepts]: Start accepts. Automaton has 160433 states and 716928 transitions. Word has length 52 [2018-12-09 00:29:23,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:29:23,564 INFO L480 AbstractCegarLoop]: Abstraction has 160433 states and 716928 transitions. [2018-12-09 00:29:23,564 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 00:29:23,564 INFO L276 IsEmpty]: Start isEmpty. Operand 160433 states and 716928 transitions. [2018-12-09 00:29:23,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-12-09 00:29:23,573 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:29:23,574 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 00:29:23,574 INFO L423 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:29:23,574 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:29:23,574 INFO L82 PathProgramCache]: Analyzing trace with hash -1570820033, now seen corresponding path program 1 times [2018-12-09 00:29:23,574 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 00:29:23,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:29:23,576 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:29:23,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:29:23,577 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 00:29:23,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:29:23,623 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:29:23,624 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:29:23,624 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 00:29:23,624 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 00:29:23,624 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 00:29:23,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 00:29:23,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 00:29:23,624 INFO L87 Difference]: Start difference. First operand 160433 states and 716928 transitions. Second operand 5 states. [2018-12-09 00:29:25,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:29:25,198 INFO L93 Difference]: Finished difference Result 317173 states and 1405285 transitions. [2018-12-09 00:29:25,199 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 00:29:25,199 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 53 [2018-12-09 00:29:25,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:29:26,099 INFO L225 Difference]: With dead ends: 317173 [2018-12-09 00:29:26,099 INFO L226 Difference]: Without dead ends: 314273 [2018-12-09 00:29:26,099 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-09 00:29:27,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314273 states. [2018-12-09 00:29:30,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314273 to 178273. [2018-12-09 00:29:30,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178273 states. [2018-12-09 00:29:31,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178273 states to 178273 states and 791490 transitions. [2018-12-09 00:29:31,242 INFO L78 Accepts]: Start accepts. Automaton has 178273 states and 791490 transitions. Word has length 53 [2018-12-09 00:29:31,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:29:31,243 INFO L480 AbstractCegarLoop]: Abstraction has 178273 states and 791490 transitions. [2018-12-09 00:29:31,243 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 00:29:31,243 INFO L276 IsEmpty]: Start isEmpty. Operand 178273 states and 791490 transitions. [2018-12-09 00:29:31,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-12-09 00:29:31,255 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:29:31,256 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 00:29:31,256 INFO L423 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:29:31,256 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:29:31,256 INFO L82 PathProgramCache]: Analyzing trace with hash 2068992963, now seen corresponding path program 1 times [2018-12-09 00:29:31,256 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 00:29:31,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:29:31,258 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:29:31,258 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:29:31,258 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 00:29:31,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:29:31,291 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:29:31,291 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:29:31,291 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 00:29:31,291 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 00:29:31,292 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 00:29:31,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 00:29:31,292 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 00:29:31,292 INFO L87 Difference]: Start difference. First operand 178273 states and 791490 transitions. Second operand 3 states. [2018-12-09 00:29:34,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:29:34,537 INFO L93 Difference]: Finished difference Result 231653 states and 1011274 transitions. [2018-12-09 00:29:34,538 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 00:29:34,538 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2018-12-09 00:29:34,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:29:35,162 INFO L225 Difference]: With dead ends: 231653 [2018-12-09 00:29:35,162 INFO L226 Difference]: Without dead ends: 231653 [2018-12-09 00:29:35,163 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 00:29:36,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231653 states. [2018-12-09 00:29:38,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231653 to 202938. [2018-12-09 00:29:38,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202938 states. [2018-12-09 00:29:39,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202938 states to 202938 states and 893562 transitions. [2018-12-09 00:29:39,528 INFO L78 Accepts]: Start accepts. Automaton has 202938 states and 893562 transitions. Word has length 55 [2018-12-09 00:29:39,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:29:39,528 INFO L480 AbstractCegarLoop]: Abstraction has 202938 states and 893562 transitions. [2018-12-09 00:29:39,528 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 00:29:39,528 INFO L276 IsEmpty]: Start isEmpty. Operand 202938 states and 893562 transitions. [2018-12-09 00:29:39,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-12-09 00:29:39,560 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:29:39,560 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 00:29:39,560 INFO L423 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:29:39,561 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:29:39,561 INFO L82 PathProgramCache]: Analyzing trace with hash -43565154, now seen corresponding path program 1 times [2018-12-09 00:29:39,561 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 00:29:39,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:29:39,562 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:29:39,563 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:29:39,563 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 00:29:39,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:29:39,632 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:29:39,632 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:29:39,632 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 00:29:39,632 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 00:29:39,632 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 00:29:39,633 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 00:29:39,633 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-09 00:29:39,633 INFO L87 Difference]: Start difference. First operand 202938 states and 893562 transitions. Second operand 6 states. [2018-12-09 00:29:41,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:29:41,804 INFO L93 Difference]: Finished difference Result 356173 states and 1552270 transitions. [2018-12-09 00:29:41,804 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-09 00:29:41,804 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 59 [2018-12-09 00:29:41,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:29:42,738 INFO L225 Difference]: With dead ends: 356173 [2018-12-09 00:29:42,738 INFO L226 Difference]: Without dead ends: 352823 [2018-12-09 00:29:42,739 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2018-12-09 00:29:46,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352823 states. [2018-12-09 00:29:50,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 352823 to 205743. [2018-12-09 00:29:50,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205743 states. [2018-12-09 00:29:50,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205743 states to 205743 states and 906781 transitions. [2018-12-09 00:29:50,844 INFO L78 Accepts]: Start accepts. Automaton has 205743 states and 906781 transitions. Word has length 59 [2018-12-09 00:29:50,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:29:50,844 INFO L480 AbstractCegarLoop]: Abstraction has 205743 states and 906781 transitions. [2018-12-09 00:29:50,844 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 00:29:50,844 INFO L276 IsEmpty]: Start isEmpty. Operand 205743 states and 906781 transitions. [2018-12-09 00:29:50,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-12-09 00:29:50,876 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:29:50,876 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 00:29:50,876 INFO L423 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:29:50,876 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:29:50,877 INFO L82 PathProgramCache]: Analyzing trace with hash 396603386, now seen corresponding path program 1 times [2018-12-09 00:29:50,877 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 00:29:50,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:29:50,879 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:29:50,879 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:29:50,879 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 00:29:50,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:29:50,904 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:29:50,904 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:29:50,905 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 00:29:50,905 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 00:29:50,905 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 00:29:50,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 00:29:50,905 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 00:29:50,905 INFO L87 Difference]: Start difference. First operand 205743 states and 906781 transitions. Second operand 3 states. [2018-12-09 00:29:52,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:29:52,436 INFO L93 Difference]: Finished difference Result 227888 states and 1004312 transitions. [2018-12-09 00:29:52,437 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 00:29:52,437 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 59 [2018-12-09 00:29:52,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:29:53,034 INFO L225 Difference]: With dead ends: 227888 [2018-12-09 00:29:53,034 INFO L226 Difference]: Without dead ends: 227888 [2018-12-09 00:29:53,035 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 00:29:54,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227888 states. [2018-12-09 00:29:57,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227888 to 216543. [2018-12-09 00:29:57,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216543 states. [2018-12-09 00:29:57,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216543 states to 216543 states and 954421 transitions. [2018-12-09 00:29:57,850 INFO L78 Accepts]: Start accepts. Automaton has 216543 states and 954421 transitions. Word has length 59 [2018-12-09 00:29:57,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:29:57,851 INFO L480 AbstractCegarLoop]: Abstraction has 216543 states and 954421 transitions. [2018-12-09 00:29:57,851 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 00:29:57,851 INFO L276 IsEmpty]: Start isEmpty. Operand 216543 states and 954421 transitions. [2018-12-09 00:29:57,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-12-09 00:29:57,883 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:29:57,883 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 00:29:57,883 INFO L423 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:29:57,883 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:29:57,883 INFO L82 PathProgramCache]: Analyzing trace with hash -1117448070, now seen corresponding path program 1 times [2018-12-09 00:29:57,883 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 00:29:57,885 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:29:57,885 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:29:57,885 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:29:57,885 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 00:29:57,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:29:57,946 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:29:57,946 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:29:57,946 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 00:29:57,946 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 00:29:57,946 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 00:29:57,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 00:29:57,946 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-09 00:29:57,946 INFO L87 Difference]: Start difference. First operand 216543 states and 954421 transitions. Second operand 6 states. [2018-12-09 00:30:01,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:30:01,469 INFO L93 Difference]: Finished difference Result 292218 states and 1274191 transitions. [2018-12-09 00:30:01,470 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 00:30:01,470 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 59 [2018-12-09 00:30:01,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:30:02,259 INFO L225 Difference]: With dead ends: 292218 [2018-12-09 00:30:02,260 INFO L226 Difference]: Without dead ends: 286523 [2018-12-09 00:30:02,260 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-09 00:30:03,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286523 states. [2018-12-09 00:30:07,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286523 to 261028. [2018-12-09 00:30:07,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 261028 states. [2018-12-09 00:30:07,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261028 states to 261028 states and 1142704 transitions. [2018-12-09 00:30:07,911 INFO L78 Accepts]: Start accepts. Automaton has 261028 states and 1142704 transitions. Word has length 59 [2018-12-09 00:30:07,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:30:07,911 INFO L480 AbstractCegarLoop]: Abstraction has 261028 states and 1142704 transitions. [2018-12-09 00:30:07,912 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 00:30:07,912 INFO L276 IsEmpty]: Start isEmpty. Operand 261028 states and 1142704 transitions. [2018-12-09 00:30:07,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-12-09 00:30:07,949 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:30:07,949 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 00:30:07,949 INFO L423 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:30:07,949 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:30:07,950 INFO L82 PathProgramCache]: Analyzing trace with hash 1380567867, now seen corresponding path program 1 times [2018-12-09 00:30:07,950 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 00:30:07,951 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:30:07,951 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:30:07,952 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:30:07,952 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 00:30:07,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:30:08,015 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:30:08,015 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:30:08,015 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 00:30:08,015 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 00:30:08,016 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 00:30:08,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 00:30:08,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-09 00:30:08,016 INFO L87 Difference]: Start difference. First operand 261028 states and 1142704 transitions. Second operand 7 states. [2018-12-09 00:30:10,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:30:10,485 INFO L93 Difference]: Finished difference Result 379443 states and 1607921 transitions. [2018-12-09 00:30:10,485 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-09 00:30:10,485 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 59 [2018-12-09 00:30:10,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:30:11,516 INFO L225 Difference]: With dead ends: 379443 [2018-12-09 00:30:11,516 INFO L226 Difference]: Without dead ends: 379443 [2018-12-09 00:30:11,516 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2018-12-09 00:30:16,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379443 states. [2018-12-09 00:30:20,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379443 to 308618. [2018-12-09 00:30:20,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 308618 states. [2018-12-09 00:30:21,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308618 states to 308618 states and 1326661 transitions. [2018-12-09 00:30:21,129 INFO L78 Accepts]: Start accepts. Automaton has 308618 states and 1326661 transitions. Word has length 59 [2018-12-09 00:30:21,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:30:21,129 INFO L480 AbstractCegarLoop]: Abstraction has 308618 states and 1326661 transitions. [2018-12-09 00:30:21,129 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 00:30:21,129 INFO L276 IsEmpty]: Start isEmpty. Operand 308618 states and 1326661 transitions. [2018-12-09 00:30:21,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-12-09 00:30:21,169 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:30:21,169 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 00:30:21,169 INFO L423 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:30:21,170 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:30:21,170 INFO L82 PathProgramCache]: Analyzing trace with hash -2026895748, now seen corresponding path program 1 times [2018-12-09 00:30:21,170 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 00:30:21,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:30:21,171 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:30:21,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:30:21,171 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 00:30:21,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:30:21,202 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:30:21,203 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:30:21,203 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 00:30:21,203 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 00:30:21,203 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 00:30:21,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 00:30:21,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 00:30:21,203 INFO L87 Difference]: Start difference. First operand 308618 states and 1326661 transitions. Second operand 4 states. [2018-12-09 00:30:22,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:30:22,956 INFO L93 Difference]: Finished difference Result 267151 states and 1127019 transitions. [2018-12-09 00:30:22,957 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 00:30:22,957 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 59 [2018-12-09 00:30:22,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:30:23,630 INFO L225 Difference]: With dead ends: 267151 [2018-12-09 00:30:23,630 INFO L226 Difference]: Without dead ends: 259066 [2018-12-09 00:30:23,630 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-09 00:30:24,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259066 states. [2018-12-09 00:30:28,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259066 to 259066. [2018-12-09 00:30:28,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 259066 states. [2018-12-09 00:30:29,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259066 states to 259066 states and 1099297 transitions. [2018-12-09 00:30:29,492 INFO L78 Accepts]: Start accepts. Automaton has 259066 states and 1099297 transitions. Word has length 59 [2018-12-09 00:30:29,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:30:29,493 INFO L480 AbstractCegarLoop]: Abstraction has 259066 states and 1099297 transitions. [2018-12-09 00:30:29,493 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 00:30:29,493 INFO L276 IsEmpty]: Start isEmpty. Operand 259066 states and 1099297 transitions. [2018-12-09 00:30:29,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-12-09 00:30:29,528 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:30:29,528 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 00:30:29,528 INFO L423 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:30:29,528 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:30:29,529 INFO L82 PathProgramCache]: Analyzing trace with hash -1169735306, now seen corresponding path program 1 times [2018-12-09 00:30:29,529 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 00:30:29,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:30:29,530 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:30:29,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:30:29,530 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 00:30:29,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:30:29,564 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:30:29,564 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:30:29,564 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 00:30:29,564 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 00:30:29,565 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 00:30:29,565 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 00:30:29,565 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-09 00:30:29,565 INFO L87 Difference]: Start difference. First operand 259066 states and 1099297 transitions. Second operand 5 states. [2018-12-09 00:30:29,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:30:29,783 INFO L93 Difference]: Finished difference Result 57898 states and 224521 transitions. [2018-12-09 00:30:29,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 00:30:29,784 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 60 [2018-12-09 00:30:29,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:30:29,887 INFO L225 Difference]: With dead ends: 57898 [2018-12-09 00:30:29,887 INFO L226 Difference]: Without dead ends: 50982 [2018-12-09 00:30:29,887 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-12-09 00:30:29,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50982 states. [2018-12-09 00:30:30,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50982 to 50742. [2018-12-09 00:30:30,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50742 states. [2018-12-09 00:30:30,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50742 states to 50742 states and 196308 transitions. [2018-12-09 00:30:30,613 INFO L78 Accepts]: Start accepts. Automaton has 50742 states and 196308 transitions. Word has length 60 [2018-12-09 00:30:30,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:30:30,613 INFO L480 AbstractCegarLoop]: Abstraction has 50742 states and 196308 transitions. [2018-12-09 00:30:30,613 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 00:30:30,613 INFO L276 IsEmpty]: Start isEmpty. Operand 50742 states and 196308 transitions. [2018-12-09 00:30:30,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-12-09 00:30:30,629 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:30:30,629 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 00:30:30,629 INFO L423 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:30:30,629 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:30:30,630 INFO L82 PathProgramCache]: Analyzing trace with hash -41019099, now seen corresponding path program 1 times [2018-12-09 00:30:30,630 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 00:30:30,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:30:30,631 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:30:30,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:30:30,631 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 00:30:30,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:30:30,662 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:30:30,662 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:30:30,662 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 00:30:30,662 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 00:30:30,663 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 00:30:30,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 00:30:30,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 00:30:30,663 INFO L87 Difference]: Start difference. First operand 50742 states and 196308 transitions. Second operand 4 states. [2018-12-09 00:30:30,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:30:30,922 INFO L93 Difference]: Finished difference Result 59861 states and 230927 transitions. [2018-12-09 00:30:30,922 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 00:30:30,922 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 70 [2018-12-09 00:30:30,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:30:31,036 INFO L225 Difference]: With dead ends: 59861 [2018-12-09 00:30:31,036 INFO L226 Difference]: Without dead ends: 59861 [2018-12-09 00:30:31,037 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-09 00:30:31,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59861 states. [2018-12-09 00:30:32,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59861 to 53957. [2018-12-09 00:30:32,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53957 states. [2018-12-09 00:30:32,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53957 states to 53957 states and 208375 transitions. [2018-12-09 00:30:32,916 INFO L78 Accepts]: Start accepts. Automaton has 53957 states and 208375 transitions. Word has length 70 [2018-12-09 00:30:32,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:30:32,917 INFO L480 AbstractCegarLoop]: Abstraction has 53957 states and 208375 transitions. [2018-12-09 00:30:32,917 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 00:30:32,917 INFO L276 IsEmpty]: Start isEmpty. Operand 53957 states and 208375 transitions. [2018-12-09 00:30:32,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-12-09 00:30:32,934 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:30:32,934 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 00:30:32,934 INFO L423 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:30:32,934 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:30:32,935 INFO L82 PathProgramCache]: Analyzing trace with hash 1701791236, now seen corresponding path program 1 times [2018-12-09 00:30:32,935 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 00:30:32,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:30:32,936 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:30:32,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:30:32,936 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 00:30:32,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:30:32,978 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:30:32,978 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:30:32,978 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 00:30:32,978 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 00:30:32,979 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 00:30:32,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 00:30:32,979 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-09 00:30:32,979 INFO L87 Difference]: Start difference. First operand 53957 states and 208375 transitions. Second operand 6 states. [2018-12-09 00:30:33,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:30:33,044 INFO L93 Difference]: Finished difference Result 14405 states and 48007 transitions. [2018-12-09 00:30:33,044 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 00:30:33,045 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 70 [2018-12-09 00:30:33,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:30:33,059 INFO L225 Difference]: With dead ends: 14405 [2018-12-09 00:30:33,059 INFO L226 Difference]: Without dead ends: 12149 [2018-12-09 00:30:33,059 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2018-12-09 00:30:33,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12149 states. [2018-12-09 00:30:33,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12149 to 11559. [2018-12-09 00:30:33,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11559 states. [2018-12-09 00:30:33,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11559 states to 11559 states and 37959 transitions. [2018-12-09 00:30:33,180 INFO L78 Accepts]: Start accepts. Automaton has 11559 states and 37959 transitions. Word has length 70 [2018-12-09 00:30:33,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:30:33,180 INFO L480 AbstractCegarLoop]: Abstraction has 11559 states and 37959 transitions. [2018-12-09 00:30:33,180 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 00:30:33,180 INFO L276 IsEmpty]: Start isEmpty. Operand 11559 states and 37959 transitions. [2018-12-09 00:30:33,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-12-09 00:30:33,190 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:30:33,190 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 00:30:33,190 INFO L423 AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:30:33,190 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:30:33,190 INFO L82 PathProgramCache]: Analyzing trace with hash -936811932, now seen corresponding path program 1 times [2018-12-09 00:30:33,191 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 00:30:33,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:30:33,192 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:30:33,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:30:33,192 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 00:30:33,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:30:33,247 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:30:33,247 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:30:33,247 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 00:30:33,247 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 00:30:33,248 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 00:30:33,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 00:30:33,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 00:30:33,248 INFO L87 Difference]: Start difference. First operand 11559 states and 37959 transitions. Second operand 5 states. [2018-12-09 00:30:33,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:30:33,433 INFO L93 Difference]: Finished difference Result 17768 states and 56955 transitions. [2018-12-09 00:30:33,433 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 00:30:33,433 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 89 [2018-12-09 00:30:33,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:30:33,452 INFO L225 Difference]: With dead ends: 17768 [2018-12-09 00:30:33,453 INFO L226 Difference]: Without dead ends: 17768 [2018-12-09 00:30:33,453 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-09 00:30:33,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17768 states. [2018-12-09 00:30:33,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17768 to 14546. [2018-12-09 00:30:33,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14546 states. [2018-12-09 00:30:33,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14546 states to 14546 states and 46978 transitions. [2018-12-09 00:30:33,620 INFO L78 Accepts]: Start accepts. Automaton has 14546 states and 46978 transitions. Word has length 89 [2018-12-09 00:30:33,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:30:33,620 INFO L480 AbstractCegarLoop]: Abstraction has 14546 states and 46978 transitions. [2018-12-09 00:30:33,620 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 00:30:33,620 INFO L276 IsEmpty]: Start isEmpty. Operand 14546 states and 46978 transitions. [2018-12-09 00:30:33,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-12-09 00:30:33,635 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:30:33,635 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 00:30:33,635 INFO L423 AbstractCegarLoop]: === Iteration 14 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:30:33,635 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:30:33,635 INFO L82 PathProgramCache]: Analyzing trace with hash 769113658, now seen corresponding path program 2 times [2018-12-09 00:30:33,635 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 00:30:33,636 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:30:33,636 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:30:33,636 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:30:33,636 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 00:30:33,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:30:33,661 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:30:33,661 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:30:33,661 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 00:30:33,661 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 00:30:33,661 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 00:30:33,661 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 00:30:33,661 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 00:30:33,661 INFO L87 Difference]: Start difference. First operand 14546 states and 46978 transitions. Second operand 3 states. [2018-12-09 00:30:33,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:30:33,780 INFO L93 Difference]: Finished difference Result 15656 states and 50431 transitions. [2018-12-09 00:30:33,780 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 00:30:33,781 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 89 [2018-12-09 00:30:33,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:30:33,797 INFO L225 Difference]: With dead ends: 15656 [2018-12-09 00:30:33,798 INFO L226 Difference]: Without dead ends: 15656 [2018-12-09 00:30:33,798 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 00:30:33,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15656 states. [2018-12-09 00:30:33,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15656 to 15156. [2018-12-09 00:30:33,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15156 states. [2018-12-09 00:30:33,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15156 states to 15156 states and 48886 transitions. [2018-12-09 00:30:33,956 INFO L78 Accepts]: Start accepts. Automaton has 15156 states and 48886 transitions. Word has length 89 [2018-12-09 00:30:33,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:30:33,956 INFO L480 AbstractCegarLoop]: Abstraction has 15156 states and 48886 transitions. [2018-12-09 00:30:33,956 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 00:30:33,957 INFO L276 IsEmpty]: Start isEmpty. Operand 15156 states and 48886 transitions. [2018-12-09 00:30:33,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-12-09 00:30:33,970 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:30:33,970 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 00:30:33,971 INFO L423 AbstractCegarLoop]: === Iteration 15 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:30:33,971 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:30:33,971 INFO L82 PathProgramCache]: Analyzing trace with hash 1692086630, now seen corresponding path program 3 times [2018-12-09 00:30:33,971 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 00:30:33,972 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:30:33,972 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 00:30:33,972 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:30:33,972 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 00:30:33,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:30:34,027 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:30:34,027 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:30:34,027 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 00:30:34,027 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 00:30:34,027 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 00:30:34,028 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 00:30:34,028 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-09 00:30:34,028 INFO L87 Difference]: Start difference. First operand 15156 states and 48886 transitions. Second operand 6 states. [2018-12-09 00:30:34,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:30:34,320 INFO L93 Difference]: Finished difference Result 22001 states and 70567 transitions. [2018-12-09 00:30:34,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 00:30:34,320 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 89 [2018-12-09 00:30:34,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:30:34,342 INFO L225 Difference]: With dead ends: 22001 [2018-12-09 00:30:34,342 INFO L226 Difference]: Without dead ends: 21873 [2018-12-09 00:30:34,343 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-12-09 00:30:34,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21873 states. [2018-12-09 00:30:34,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21873 to 18726. [2018-12-09 00:30:34,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18726 states. [2018-12-09 00:30:34,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18726 states to 18726 states and 60333 transitions. [2018-12-09 00:30:34,542 INFO L78 Accepts]: Start accepts. Automaton has 18726 states and 60333 transitions. Word has length 89 [2018-12-09 00:30:34,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:30:34,543 INFO L480 AbstractCegarLoop]: Abstraction has 18726 states and 60333 transitions. [2018-12-09 00:30:34,543 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 00:30:34,543 INFO L276 IsEmpty]: Start isEmpty. Operand 18726 states and 60333 transitions. [2018-12-09 00:30:34,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-12-09 00:30:34,558 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:30:34,558 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 00:30:34,559 INFO L423 AbstractCegarLoop]: === Iteration 16 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:30:34,559 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:30:34,559 INFO L82 PathProgramCache]: Analyzing trace with hash -104864729, now seen corresponding path program 1 times [2018-12-09 00:30:34,559 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 00:30:34,560 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:30:34,560 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 00:30:34,560 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:30:34,560 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 00:30:34,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:30:34,625 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:30:34,625 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:30:34,625 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 00:30:34,625 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 00:30:34,626 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 00:30:34,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 00:30:34,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-12-09 00:30:34,626 INFO L87 Difference]: Start difference. First operand 18726 states and 60333 transitions. Second operand 7 states. [2018-12-09 00:30:34,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:30:34,980 INFO L93 Difference]: Finished difference Result 34495 states and 111647 transitions. [2018-12-09 00:30:34,980 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-09 00:30:34,980 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 89 [2018-12-09 00:30:34,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:30:35,022 INFO L225 Difference]: With dead ends: 34495 [2018-12-09 00:30:35,022 INFO L226 Difference]: Without dead ends: 34495 [2018-12-09 00:30:35,022 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2018-12-09 00:30:35,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34495 states. [2018-12-09 00:30:35,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34495 to 22644. [2018-12-09 00:30:35,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22644 states. [2018-12-09 00:30:35,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22644 states to 22644 states and 73466 transitions. [2018-12-09 00:30:35,338 INFO L78 Accepts]: Start accepts. Automaton has 22644 states and 73466 transitions. Word has length 89 [2018-12-09 00:30:35,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:30:35,338 INFO L480 AbstractCegarLoop]: Abstraction has 22644 states and 73466 transitions. [2018-12-09 00:30:35,338 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 00:30:35,338 INFO L276 IsEmpty]: Start isEmpty. Operand 22644 states and 73466 transitions. [2018-12-09 00:30:35,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-12-09 00:30:35,360 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:30:35,360 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 00:30:35,360 INFO L423 AbstractCegarLoop]: === Iteration 17 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:30:35,361 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:30:35,361 INFO L82 PathProgramCache]: Analyzing trace with hash 782638952, now seen corresponding path program 1 times [2018-12-09 00:30:35,361 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 00:30:35,362 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:30:35,362 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:30:35,362 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:30:35,362 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 00:30:35,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:30:35,426 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:30:35,426 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:30:35,426 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 00:30:35,426 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 00:30:35,426 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 00:30:35,427 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 00:30:35,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-09 00:30:35,427 INFO L87 Difference]: Start difference. First operand 22644 states and 73466 transitions. Second operand 6 states. [2018-12-09 00:30:35,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:30:35,675 INFO L93 Difference]: Finished difference Result 23712 states and 76203 transitions. [2018-12-09 00:30:35,676 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 00:30:35,676 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 89 [2018-12-09 00:30:35,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:30:35,702 INFO L225 Difference]: With dead ends: 23712 [2018-12-09 00:30:35,703 INFO L226 Difference]: Without dead ends: 23712 [2018-12-09 00:30:35,703 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2018-12-09 00:30:35,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23712 states. [2018-12-09 00:30:35,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23712 to 19210. [2018-12-09 00:30:35,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19210 states. [2018-12-09 00:30:35,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19210 states to 19210 states and 61517 transitions. [2018-12-09 00:30:35,932 INFO L78 Accepts]: Start accepts. Automaton has 19210 states and 61517 transitions. Word has length 89 [2018-12-09 00:30:35,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:30:35,932 INFO L480 AbstractCegarLoop]: Abstraction has 19210 states and 61517 transitions. [2018-12-09 00:30:35,932 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 00:30:35,932 INFO L276 IsEmpty]: Start isEmpty. Operand 19210 states and 61517 transitions. [2018-12-09 00:30:35,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-12-09 00:30:35,950 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:30:35,950 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 00:30:35,950 INFO L423 AbstractCegarLoop]: === Iteration 18 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:30:35,950 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:30:35,950 INFO L82 PathProgramCache]: Analyzing trace with hash -412334768, now seen corresponding path program 1 times [2018-12-09 00:30:35,950 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 00:30:35,951 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:30:35,951 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:30:35,951 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:30:35,951 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 00:30:35,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:30:36,017 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:30:36,017 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:30:36,017 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 00:30:36,017 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 00:30:36,018 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 00:30:36,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 00:30:36,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-09 00:30:36,018 INFO L87 Difference]: Start difference. First operand 19210 states and 61517 transitions. Second operand 6 states. [2018-12-09 00:30:36,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:30:36,341 INFO L93 Difference]: Finished difference Result 22660 states and 71687 transitions. [2018-12-09 00:30:36,341 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 00:30:36,341 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 89 [2018-12-09 00:30:36,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:30:36,365 INFO L225 Difference]: With dead ends: 22660 [2018-12-09 00:30:36,365 INFO L226 Difference]: Without dead ends: 22140 [2018-12-09 00:30:36,365 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-12-09 00:30:36,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22140 states. [2018-12-09 00:30:36,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22140 to 20895. [2018-12-09 00:30:36,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20895 states. [2018-12-09 00:30:36,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20895 states to 20895 states and 66670 transitions. [2018-12-09 00:30:36,689 INFO L78 Accepts]: Start accepts. Automaton has 20895 states and 66670 transitions. Word has length 89 [2018-12-09 00:30:36,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:30:36,690 INFO L480 AbstractCegarLoop]: Abstraction has 20895 states and 66670 transitions. [2018-12-09 00:30:36,690 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 00:30:36,690 INFO L276 IsEmpty]: Start isEmpty. Operand 20895 states and 66670 transitions. [2018-12-09 00:30:36,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-12-09 00:30:36,707 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:30:36,707 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 00:30:36,707 INFO L423 AbstractCegarLoop]: === Iteration 19 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:30:36,707 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:30:36,707 INFO L82 PathProgramCache]: Analyzing trace with hash 1928533223, now seen corresponding path program 1 times [2018-12-09 00:30:36,707 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 00:30:36,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:30:36,709 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:30:36,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:30:36,709 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 00:30:36,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:30:36,781 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:30:36,781 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:30:36,781 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 00:30:36,781 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 00:30:36,782 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 00:30:36,782 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 00:30:36,782 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-12-09 00:30:36,782 INFO L87 Difference]: Start difference. First operand 20895 states and 66670 transitions. Second operand 7 states. [2018-12-09 00:30:37,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:30:37,098 INFO L93 Difference]: Finished difference Result 23643 states and 75369 transitions. [2018-12-09 00:30:37,099 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 00:30:37,099 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 89 [2018-12-09 00:30:37,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:30:37,125 INFO L225 Difference]: With dead ends: 23643 [2018-12-09 00:30:37,125 INFO L226 Difference]: Without dead ends: 23643 [2018-12-09 00:30:37,125 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-12-09 00:30:37,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23643 states. [2018-12-09 00:30:37,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23643 to 21045. [2018-12-09 00:30:37,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21045 states. [2018-12-09 00:30:37,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21045 states to 21045 states and 67310 transitions. [2018-12-09 00:30:37,359 INFO L78 Accepts]: Start accepts. Automaton has 21045 states and 67310 transitions. Word has length 89 [2018-12-09 00:30:37,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:30:37,359 INFO L480 AbstractCegarLoop]: Abstraction has 21045 states and 67310 transitions. [2018-12-09 00:30:37,359 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 00:30:37,359 INFO L276 IsEmpty]: Start isEmpty. Operand 21045 states and 67310 transitions. [2018-12-09 00:30:37,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-12-09 00:30:37,378 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:30:37,379 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 00:30:37,379 INFO L423 AbstractCegarLoop]: === Iteration 20 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:30:37,379 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:30:37,379 INFO L82 PathProgramCache]: Analyzing trace with hash 1872528687, now seen corresponding path program 1 times [2018-12-09 00:30:37,379 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 00:30:37,380 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:30:37,380 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:30:37,380 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:30:37,380 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 00:30:37,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:30:37,432 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:30:37,433 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:30:37,433 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 00:30:37,433 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 00:30:37,433 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 00:30:37,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 00:30:37,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-09 00:30:37,433 INFO L87 Difference]: Start difference. First operand 21045 states and 67310 transitions. Second operand 6 states. [2018-12-09 00:30:37,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:30:37,617 INFO L93 Difference]: Finished difference Result 23210 states and 72642 transitions. [2018-12-09 00:30:37,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-09 00:30:37,617 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 89 [2018-12-09 00:30:37,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:30:37,642 INFO L225 Difference]: With dead ends: 23210 [2018-12-09 00:30:37,642 INFO L226 Difference]: Without dead ends: 23210 [2018-12-09 00:30:37,642 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2018-12-09 00:30:37,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23210 states. [2018-12-09 00:30:37,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23210 to 21470. [2018-12-09 00:30:37,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21470 states. [2018-12-09 00:30:37,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21470 states to 21470 states and 67540 transitions. [2018-12-09 00:30:37,869 INFO L78 Accepts]: Start accepts. Automaton has 21470 states and 67540 transitions. Word has length 89 [2018-12-09 00:30:37,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:30:37,870 INFO L480 AbstractCegarLoop]: Abstraction has 21470 states and 67540 transitions. [2018-12-09 00:30:37,870 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 00:30:37,870 INFO L276 IsEmpty]: Start isEmpty. Operand 21470 states and 67540 transitions. [2018-12-09 00:30:37,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-12-09 00:30:37,889 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:30:37,889 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 00:30:37,889 INFO L423 AbstractCegarLoop]: === Iteration 21 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:30:37,889 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:30:37,889 INFO L82 PathProgramCache]: Analyzing trace with hash 1617792142, now seen corresponding path program 1 times [2018-12-09 00:30:37,889 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 00:30:37,890 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:30:37,890 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:30:37,890 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:30:37,890 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 00:30:37,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:30:37,942 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:30:37,942 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:30:37,942 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 00:30:37,942 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 00:30:37,942 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 00:30:37,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 00:30:37,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-09 00:30:37,943 INFO L87 Difference]: Start difference. First operand 21470 states and 67540 transitions. Second operand 6 states. [2018-12-09 00:30:38,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:30:38,044 INFO L93 Difference]: Finished difference Result 19998 states and 61732 transitions. [2018-12-09 00:30:38,044 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 00:30:38,044 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 89 [2018-12-09 00:30:38,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:30:38,065 INFO L225 Difference]: With dead ends: 19998 [2018-12-09 00:30:38,065 INFO L226 Difference]: Without dead ends: 19998 [2018-12-09 00:30:38,065 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2018-12-09 00:30:38,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19998 states. [2018-12-09 00:30:38,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19998 to 12659. [2018-12-09 00:30:38,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12659 states. [2018-12-09 00:30:38,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12659 states to 12659 states and 39042 transitions. [2018-12-09 00:30:38,231 INFO L78 Accepts]: Start accepts. Automaton has 12659 states and 39042 transitions. Word has length 89 [2018-12-09 00:30:38,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:30:38,231 INFO L480 AbstractCegarLoop]: Abstraction has 12659 states and 39042 transitions. [2018-12-09 00:30:38,231 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 00:30:38,231 INFO L276 IsEmpty]: Start isEmpty. Operand 12659 states and 39042 transitions. [2018-12-09 00:30:38,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-12-09 00:30:38,242 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:30:38,242 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 00:30:38,243 INFO L423 AbstractCegarLoop]: === Iteration 22 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:30:38,243 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:30:38,243 INFO L82 PathProgramCache]: Analyzing trace with hash 368979928, now seen corresponding path program 1 times [2018-12-09 00:30:38,243 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 00:30:38,244 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:30:38,244 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:30:38,244 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:30:38,244 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 00:30:38,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:30:38,317 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:30:38,317 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:30:38,317 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 00:30:38,318 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 00:30:38,318 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 00:30:38,318 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 00:30:38,318 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-09 00:30:38,318 INFO L87 Difference]: Start difference. First operand 12659 states and 39042 transitions. Second operand 6 states. [2018-12-09 00:30:38,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:30:38,447 INFO L93 Difference]: Finished difference Result 14589 states and 44651 transitions. [2018-12-09 00:30:38,447 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 00:30:38,447 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 91 [2018-12-09 00:30:38,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:30:38,461 INFO L225 Difference]: With dead ends: 14589 [2018-12-09 00:30:38,461 INFO L226 Difference]: Without dead ends: 14299 [2018-12-09 00:30:38,461 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2018-12-09 00:30:38,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14299 states. [2018-12-09 00:30:38,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14299 to 11174. [2018-12-09 00:30:38,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11174 states. [2018-12-09 00:30:38,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11174 states to 11174 states and 34174 transitions. [2018-12-09 00:30:38,576 INFO L78 Accepts]: Start accepts. Automaton has 11174 states and 34174 transitions. Word has length 91 [2018-12-09 00:30:38,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:30:38,576 INFO L480 AbstractCegarLoop]: Abstraction has 11174 states and 34174 transitions. [2018-12-09 00:30:38,576 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 00:30:38,576 INFO L276 IsEmpty]: Start isEmpty. Operand 11174 states and 34174 transitions. [2018-12-09 00:30:38,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-12-09 00:30:38,585 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:30:38,585 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 00:30:38,585 INFO L423 AbstractCegarLoop]: === Iteration 23 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:30:38,585 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:30:38,585 INFO L82 PathProgramCache]: Analyzing trace with hash -1708229415, now seen corresponding path program 1 times [2018-12-09 00:30:38,585 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 00:30:38,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:30:38,586 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:30:38,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:30:38,586 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 00:30:38,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:30:38,691 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:30:38,691 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:30:38,691 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-09 00:30:38,691 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 00:30:38,691 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-09 00:30:38,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-09 00:30:38,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-12-09 00:30:38,692 INFO L87 Difference]: Start difference. First operand 11174 states and 34174 transitions. Second operand 9 states. [2018-12-09 00:30:38,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:30:38,892 INFO L93 Difference]: Finished difference Result 13111 states and 40031 transitions. [2018-12-09 00:30:38,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-09 00:30:38,893 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 91 [2018-12-09 00:30:38,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:30:38,905 INFO L225 Difference]: With dead ends: 13111 [2018-12-09 00:30:38,905 INFO L226 Difference]: Without dead ends: 13111 [2018-12-09 00:30:38,906 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=177, Unknown=0, NotChecked=0, Total=240 [2018-12-09 00:30:38,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13111 states. [2018-12-09 00:30:39,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13111 to 12772. [2018-12-09 00:30:39,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12772 states. [2018-12-09 00:30:39,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12772 states to 12772 states and 39053 transitions. [2018-12-09 00:30:39,038 INFO L78 Accepts]: Start accepts. Automaton has 12772 states and 39053 transitions. Word has length 91 [2018-12-09 00:30:39,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:30:39,038 INFO L480 AbstractCegarLoop]: Abstraction has 12772 states and 39053 transitions. [2018-12-09 00:30:39,038 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-09 00:30:39,039 INFO L276 IsEmpty]: Start isEmpty. Operand 12772 states and 39053 transitions. [2018-12-09 00:30:39,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-12-09 00:30:39,049 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:30:39,049 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 00:30:39,049 INFO L423 AbstractCegarLoop]: === Iteration 24 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:30:39,049 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:30:39,049 INFO L82 PathProgramCache]: Analyzing trace with hash -820725734, now seen corresponding path program 1 times [2018-12-09 00:30:39,049 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 00:30:39,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:30:39,050 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:30:39,051 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:30:39,051 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 00:30:39,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:30:39,116 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:30:39,116 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:30:39,116 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-09 00:30:39,117 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 00:30:39,117 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-09 00:30:39,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-09 00:30:39,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-12-09 00:30:39,117 INFO L87 Difference]: Start difference. First operand 12772 states and 39053 transitions. Second operand 8 states. [2018-12-09 00:30:39,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:30:39,446 INFO L93 Difference]: Finished difference Result 22526 states and 68777 transitions. [2018-12-09 00:30:39,447 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-09 00:30:39,447 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 91 [2018-12-09 00:30:39,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:30:39,459 INFO L225 Difference]: With dead ends: 22526 [2018-12-09 00:30:39,459 INFO L226 Difference]: Without dead ends: 11514 [2018-12-09 00:30:39,459 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2018-12-09 00:30:39,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11514 states. [2018-12-09 00:30:39,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11514 to 10920. [2018-12-09 00:30:39,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10920 states. [2018-12-09 00:30:39,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10920 states to 10920 states and 33137 transitions. [2018-12-09 00:30:39,562 INFO L78 Accepts]: Start accepts. Automaton has 10920 states and 33137 transitions. Word has length 91 [2018-12-09 00:30:39,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:30:39,562 INFO L480 AbstractCegarLoop]: Abstraction has 10920 states and 33137 transitions. [2018-12-09 00:30:39,562 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-09 00:30:39,562 INFO L276 IsEmpty]: Start isEmpty. Operand 10920 states and 33137 transitions. [2018-12-09 00:30:39,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-12-09 00:30:39,569 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:30:39,569 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 00:30:39,569 INFO L423 AbstractCegarLoop]: === Iteration 25 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:30:39,570 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:30:39,570 INFO L82 PathProgramCache]: Analyzing trace with hash -148260104, now seen corresponding path program 2 times [2018-12-09 00:30:39,570 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 00:30:39,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:30:39,571 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:30:39,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:30:39,571 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 00:30:39,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:30:39,663 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:30:39,663 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:30:39,663 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-12-09 00:30:39,663 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 00:30:39,663 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-09 00:30:39,664 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-09 00:30:39,664 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-12-09 00:30:39,664 INFO L87 Difference]: Start difference. First operand 10920 states and 33137 transitions. Second operand 10 states. [2018-12-09 00:30:40,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:30:40,078 INFO L93 Difference]: Finished difference Result 18376 states and 56010 transitions. [2018-12-09 00:30:40,078 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-09 00:30:40,079 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 91 [2018-12-09 00:30:40,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:30:40,085 INFO L225 Difference]: With dead ends: 18376 [2018-12-09 00:30:40,085 INFO L226 Difference]: Without dead ends: 6510 [2018-12-09 00:30:40,085 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=84, Invalid=222, Unknown=0, NotChecked=0, Total=306 [2018-12-09 00:30:40,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6510 states. [2018-12-09 00:30:40,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6510 to 6510. [2018-12-09 00:30:40,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6510 states. [2018-12-09 00:30:40,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6510 states to 6510 states and 19834 transitions. [2018-12-09 00:30:40,143 INFO L78 Accepts]: Start accepts. Automaton has 6510 states and 19834 transitions. Word has length 91 [2018-12-09 00:30:40,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:30:40,143 INFO L480 AbstractCegarLoop]: Abstraction has 6510 states and 19834 transitions. [2018-12-09 00:30:40,143 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-09 00:30:40,143 INFO L276 IsEmpty]: Start isEmpty. Operand 6510 states and 19834 transitions. [2018-12-09 00:30:40,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-12-09 00:30:40,148 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:30:40,148 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 00:30:40,148 INFO L423 AbstractCegarLoop]: === Iteration 26 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:30:40,149 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:30:40,149 INFO L82 PathProgramCache]: Analyzing trace with hash -1433608860, now seen corresponding path program 1 times [2018-12-09 00:30:40,149 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 00:30:40,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:30:40,150 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 00:30:40,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:30:40,150 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 00:30:40,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:30:40,228 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:30:40,228 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:30:40,228 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 00:30:40,228 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 00:30:40,228 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 00:30:40,228 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 00:30:40,228 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-12-09 00:30:40,229 INFO L87 Difference]: Start difference. First operand 6510 states and 19834 transitions. Second operand 7 states. [2018-12-09 00:30:40,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:30:40,358 INFO L93 Difference]: Finished difference Result 7878 states and 24020 transitions. [2018-12-09 00:30:40,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-09 00:30:40,359 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 91 [2018-12-09 00:30:40,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:30:40,366 INFO L225 Difference]: With dead ends: 7878 [2018-12-09 00:30:40,366 INFO L226 Difference]: Without dead ends: 7878 [2018-12-09 00:30:40,366 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2018-12-09 00:30:40,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7878 states. [2018-12-09 00:30:40,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7878 to 7814. [2018-12-09 00:30:40,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7814 states. [2018-12-09 00:30:40,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7814 states to 7814 states and 23812 transitions. [2018-12-09 00:30:40,436 INFO L78 Accepts]: Start accepts. Automaton has 7814 states and 23812 transitions. Word has length 91 [2018-12-09 00:30:40,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:30:40,437 INFO L480 AbstractCegarLoop]: Abstraction has 7814 states and 23812 transitions. [2018-12-09 00:30:40,437 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 00:30:40,437 INFO L276 IsEmpty]: Start isEmpty. Operand 7814 states and 23812 transitions. [2018-12-09 00:30:40,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-12-09 00:30:40,442 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:30:40,442 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 00:30:40,443 INFO L423 AbstractCegarLoop]: === Iteration 27 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:30:40,443 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:30:40,443 INFO L82 PathProgramCache]: Analyzing trace with hash -546105179, now seen corresponding path program 1 times [2018-12-09 00:30:40,443 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 00:30:40,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:30:40,444 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:30:40,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:30:40,444 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 00:30:40,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 00:30:40,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 00:30:40,480 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-09 00:30:40,549 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-12-09 00:30:40,550 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.12 12:30:40 BasicIcfg [2018-12-09 00:30:40,550 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-09 00:30:40,551 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-09 00:30:40,551 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-09 00:30:40,551 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-09 00:30:40,551 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 12:28:48" (3/4) ... [2018-12-09 00:30:40,553 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-09 00:30:40,621 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_cc670290-5caf-4636-a293-a681749cb43f/bin-2019/utaipan/witness.graphml [2018-12-09 00:30:40,621 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-09 00:30:40,622 INFO L168 Benchmark]: Toolchain (without parser) took 112358.34 ms. Allocated memory was 1.0 GB in the beginning and 7.6 GB in the end (delta: 6.5 GB). Free memory was 952.4 MB in the beginning and 5.7 GB in the end (delta: -4.7 GB). Peak memory consumption was 1.8 GB. Max. memory is 11.5 GB. [2018-12-09 00:30:40,623 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 00:30:40,623 INFO L168 Benchmark]: CACSL2BoogieTranslator took 312.79 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.4 MB). Free memory was 952.4 MB in the beginning and 1.1 GB in the end (delta: -162.3 MB). Peak memory consumption was 31.5 MB. Max. memory is 11.5 GB. [2018-12-09 00:30:40,623 INFO L168 Benchmark]: Boogie Procedure Inliner took 31.14 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 11.5 GB. [2018-12-09 00:30:40,623 INFO L168 Benchmark]: Boogie Preprocessor took 20.03 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 00:30:40,623 INFO L168 Benchmark]: RCFGBuilder took 356.22 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 47.7 MB). Peak memory consumption was 47.7 MB. Max. memory is 11.5 GB. [2018-12-09 00:30:40,624 INFO L168 Benchmark]: TraceAbstraction took 111564.43 ms. Allocated memory was 1.2 GB in the beginning and 7.6 GB in the end (delta: 6.4 GB). Free memory was 1.1 GB in the beginning and 5.7 GB in the end (delta: -4.7 GB). Peak memory consumption was 1.7 GB. Max. memory is 11.5 GB. [2018-12-09 00:30:40,624 INFO L168 Benchmark]: Witness Printer took 70.84 ms. Allocated memory is still 7.6 GB. Free memory was 5.7 GB in the beginning and 5.7 GB in the end (delta: 57.1 MB). Peak memory consumption was 57.1 MB. Max. memory is 11.5 GB. [2018-12-09 00:30:40,625 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 312.79 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.4 MB). Free memory was 952.4 MB in the beginning and 1.1 GB in the end (delta: -162.3 MB). Peak memory consumption was 31.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 31.14 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 20.03 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 356.22 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 47.7 MB). Peak memory consumption was 47.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 111564.43 ms. Allocated memory was 1.2 GB in the beginning and 7.6 GB in the end (delta: 6.4 GB). Free memory was 1.1 GB in the beginning and 5.7 GB in the end (delta: -4.7 GB). Peak memory consumption was 1.7 GB. Max. memory is 11.5 GB. * Witness Printer took 70.84 ms. Allocated memory is still 7.6 GB. Free memory was 5.7 GB in the beginning and 5.7 GB in the end (delta: 57.1 MB). Peak memory consumption was 57.1 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L672] -1 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L674] -1 int __unbuffered_p0_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0] [L676] -1 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0] [L677] -1 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0] [L678] -1 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L680] -1 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L682] -1 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L683] -1 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L684] -1 int y$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L685] -1 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0] [L686] -1 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0] [L687] -1 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0] [L688] -1 _Bool y$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0] [L689] -1 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0] [L690] -1 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0] [L691] -1 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0] [L692] -1 _Bool y$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0] [L693] -1 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0] [L694] -1 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}] [L695] -1 int y$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0] [L696] -1 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0] [L697] -1 int y$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0] [L698] -1 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L700] -1 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L701] -1 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L702] -1 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L790] -1 pthread_t t2582; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L791] FCALL, FORK -1 pthread_create(&t2582, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L792] -1 pthread_t t2583; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L793] FCALL, FORK -1 pthread_create(&t2583, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L794] -1 pthread_t t2584; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L795] FCALL, FORK -1 pthread_create(&t2584, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L753] 0 y$w_buff1 = y$w_buff0 [L754] 0 y$w_buff0 = 1 [L755] 0 y$w_buff1_used = y$w_buff0_used [L756] 0 y$w_buff0_used = (_Bool)1 [L4] COND FALSE 0 !(!expression) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L758] 0 y$r_buff1_thd0 = y$r_buff0_thd0 [L759] 0 y$r_buff1_thd1 = y$r_buff0_thd1 [L760] 0 y$r_buff1_thd2 = y$r_buff0_thd2 [L761] 0 y$r_buff1_thd3 = y$r_buff0_thd3 [L762] 0 y$r_buff0_thd3 = (_Bool)1 [L765] 0 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L706] 1 z = 2 [L711] 1 __unbuffered_p0_EAX = x [L716] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L723] 2 x = 1 [L728] 2 weak$$choice0 = __VERIFIER_nondet_pointer() [L729] 2 weak$$choice2 = __VERIFIER_nondet_pointer() [L730] 2 y$flush_delayed = weak$$choice2 [L731] 2 y$mem_tmp = y VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L732] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L732] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L733] EXPR 2 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0))=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L733] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L734] EXPR 2 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L734] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L735] EXPR 2 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used))=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L768] EXPR 0 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used))=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L735] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L736] EXPR 2 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L736] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L737] EXPR 2 weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L737] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L738] EXPR 2 weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L738] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L739] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L740] EXPR 2 y$flush_delayed ? y$mem_tmp : y VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$flush_delayed ? y$mem_tmp : y=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L740] 2 y = y$flush_delayed ? y$mem_tmp : y [L741] 2 y$flush_delayed = (_Bool)0 [L746] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L768] 0 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L769] EXPR 0 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L769] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L770] EXPR 0 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L770] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L771] EXPR 0 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L771] 0 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L772] EXPR 0 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L772] 0 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L775] 0 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L797] -1 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L801] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L801] EXPR -1 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L801] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L801] -1 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L802] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L802] -1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L803] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L803] -1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L804] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L804] -1 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L805] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L805] -1 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L808] -1 main$tmp_guard1 = !(z == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 0) VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L4] COND TRUE -1 !expression VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L4] -1 __VERIFIER_error() VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 7 procedures, 217 locations, 3 error locations. UNSAFE Result, 111.4s OverallTime, 27 OverallIterations, 1 TraceHistogramMax, 31.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 6821 SDtfs, 9065 SDslu, 15413 SDs, 0 SdLazy, 5887 SolverSat, 391 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 244 GetRequests, 65 SyntacticMatches, 13 SemanticMatches, 166 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=308618occurred in iteration=8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 57.8s AutomataMinimizationTime, 26 MinimizatonAttempts, 607340 StatesRemovedByMinimization, 24 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 2046 NumberOfCodeBlocks, 2046 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 1929 ConstructedInterpolants, 0 QuantifiedInterpolants, 413943 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 26 InterpolantComputations, 26 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...