./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix028_tso.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_c272161b-a0ab-4a78-b61b-199b106198ef/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_c272161b-a0ab-4a78-b61b-199b106198ef/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_c272161b-a0ab-4a78-b61b-199b106198ef/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_c272161b-a0ab-4a78-b61b-199b106198ef/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix028_tso.opt_false-unreach-call.i -s /tmp/vcloud-vcloud-master/worker/working_dir_c272161b-a0ab-4a78-b61b-199b106198ef/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_c272161b-a0ab-4a78-b61b-199b106198ef/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 bdc38a1b791b964a5d3ebef146a28040d23c9f7b ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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-02 12:14:37,761 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-02 12:14:37,762 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-02 12:14:37,768 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-02 12:14:37,768 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-02 12:14:37,769 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-02 12:14:37,769 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-02 12:14:37,770 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-02 12:14:37,771 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-02 12:14:37,772 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-02 12:14:37,773 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-02 12:14:37,773 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-02 12:14:37,773 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-02 12:14:37,774 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-02 12:14:37,774 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-02 12:14:37,775 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-02 12:14:37,775 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-02 12:14:37,777 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-02 12:14:37,778 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-02 12:14:37,779 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-02 12:14:37,779 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-02 12:14:37,780 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-02 12:14:37,781 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-02 12:14:37,781 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-02 12:14:37,781 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-02 12:14:37,782 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-02 12:14:37,782 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-02 12:14:37,783 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-02 12:14:37,783 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-02 12:14:37,784 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-02 12:14:37,784 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-02 12:14:37,785 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-02 12:14:37,785 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-02 12:14:37,785 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-02 12:14:37,785 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-02 12:14:37,786 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-02 12:14:37,786 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_c272161b-a0ab-4a78-b61b-199b106198ef/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-12-02 12:14:37,793 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-02 12:14:37,794 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-02 12:14:37,794 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-02 12:14:37,794 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-02 12:14:37,794 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-02 12:14:37,795 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-02 12:14:37,795 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-02 12:14:37,795 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-02 12:14:37,795 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-02 12:14:37,795 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-02 12:14:37,795 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-02 12:14:37,795 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-02 12:14:37,795 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-02 12:14:37,796 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-02 12:14:37,796 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-02 12:14:37,796 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-02 12:14:37,796 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-02 12:14:37,796 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-02 12:14:37,796 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-02 12:14:37,797 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-02 12:14:37,797 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-02 12:14:37,797 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-02 12:14:37,797 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-02 12:14:37,797 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-02 12:14:37,797 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-02 12:14:37,797 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-02 12:14:37,797 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-02 12:14:37,797 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-02 12:14:37,798 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-02 12:14:37,798 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-02 12:14:37,798 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-02 12:14:37,798 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-02 12:14:37,798 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-02 12:14:37,798 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-02 12:14:37,798 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-02 12:14:37,798 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-02 12:14:37,798 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_c272161b-a0ab-4a78-b61b-199b106198ef/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 -> bdc38a1b791b964a5d3ebef146a28040d23c9f7b [2018-12-02 12:14:37,816 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-02 12:14:37,826 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-02 12:14:37,828 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-02 12:14:37,829 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-02 12:14:37,830 INFO L276 PluginConnector]: CDTParser initialized [2018-12-02 12:14:37,830 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_c272161b-a0ab-4a78-b61b-199b106198ef/bin-2019/utaipan/../../sv-benchmarks/c/pthread-wmm/mix028_tso.opt_false-unreach-call.i [2018-12-02 12:14:37,867 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_c272161b-a0ab-4a78-b61b-199b106198ef/bin-2019/utaipan/data/f6d17860b/1669474f90a44cac87bbb57fa3a55ed5/FLAGd54ecbdae [2018-12-02 12:14:38,324 INFO L307 CDTParser]: Found 1 translation units. [2018-12-02 12:14:38,324 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_c272161b-a0ab-4a78-b61b-199b106198ef/sv-benchmarks/c/pthread-wmm/mix028_tso.opt_false-unreach-call.i [2018-12-02 12:14:38,332 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_c272161b-a0ab-4a78-b61b-199b106198ef/bin-2019/utaipan/data/f6d17860b/1669474f90a44cac87bbb57fa3a55ed5/FLAGd54ecbdae [2018-12-02 12:14:38,340 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_c272161b-a0ab-4a78-b61b-199b106198ef/bin-2019/utaipan/data/f6d17860b/1669474f90a44cac87bbb57fa3a55ed5 [2018-12-02 12:14:38,342 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-02 12:14:38,342 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-02 12:14:38,343 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-02 12:14:38,343 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-02 12:14:38,345 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-02 12:14:38,346 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 12:14:38" (1/1) ... [2018-12-02 12:14:38,347 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 02.12 12:14:38, skipping insertion in model container [2018-12-02 12:14:38,347 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 12:14:38" (1/1) ... [2018-12-02 12:14:38,351 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-02 12:14:38,373 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-02 12:14:38,559 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 12:14:38,567 INFO L191 MainTranslator]: Completed pre-run [2018-12-02 12:14:38,660 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 12:14:38,699 INFO L195 MainTranslator]: Completed translation [2018-12-02 12:14:38,699 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:14:38 WrapperNode [2018-12-02 12:14:38,699 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-02 12:14:38,700 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-02 12:14:38,700 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-02 12:14:38,700 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-02 12:14:38,705 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:14:38" (1/1) ... [2018-12-02 12:14:38,717 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:14:38" (1/1) ... [2018-12-02 12:14:38,738 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-02 12:14:38,738 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-02 12:14:38,738 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-02 12:14:38,738 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-02 12:14:38,744 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:14:38" (1/1) ... [2018-12-02 12:14:38,744 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:14:38" (1/1) ... [2018-12-02 12:14:38,747 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:14:38" (1/1) ... [2018-12-02 12:14:38,747 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:14:38" (1/1) ... [2018-12-02 12:14:38,754 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:14:38" (1/1) ... [2018-12-02 12:14:38,758 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:14:38" (1/1) ... [2018-12-02 12:14:38,761 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:14:38" (1/1) ... [2018-12-02 12:14:38,764 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-02 12:14:38,765 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-02 12:14:38,765 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-02 12:14:38,765 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-02 12:14:38,766 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:14:38" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c272161b-a0ab-4a78-b61b-199b106198ef/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-02 12:14:38,803 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-02 12:14:38,804 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-02 12:14:38,804 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2018-12-02 12:14:38,804 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-02 12:14:38,804 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2018-12-02 12:14:38,804 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2018-12-02 12:14:38,804 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2018-12-02 12:14:38,804 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2018-12-02 12:14:38,805 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2018-12-02 12:14:38,805 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2018-12-02 12:14:38,805 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2018-12-02 12:14:38,805 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-02 12:14:38,805 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-02 12:14:38,806 WARN L198 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2018-12-02 12:14:39,215 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-02 12:14:39,215 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-12-02 12:14:39,215 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 12:14:39 BoogieIcfgContainer [2018-12-02 12:14:39,215 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-02 12:14:39,216 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-02 12:14:39,216 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-02 12:14:39,218 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-02 12:14:39,218 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 12:14:38" (1/3) ... [2018-12-02 12:14:39,218 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@117c26a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 12:14:39, skipping insertion in model container [2018-12-02 12:14:39,218 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:14:38" (2/3) ... [2018-12-02 12:14:39,219 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@117c26a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 12:14:39, skipping insertion in model container [2018-12-02 12:14:39,219 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 12:14:39" (3/3) ... [2018-12-02 12:14:39,220 INFO L112 eAbstractionObserver]: Analyzing ICFG mix028_tso.opt_false-unreach-call.i [2018-12-02 12:14:39,245 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:14:39,245 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:14:39,246 WARN L317 ript$VariableManager]: TermVariabe Thread2_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:14:39,246 WARN L317 ript$VariableManager]: TermVariabe Thread2_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:14:39,246 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P0_#t~nondet3.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:14:39,246 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P0_#t~nondet3.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:14:39,246 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:14:39,246 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:14:39,247 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P0_#t~nondet3.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:14:39,247 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P0_#t~nondet3.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:14:39,247 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:14:39,247 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:14:39,247 WARN L317 ript$VariableManager]: TermVariabe Thread0_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:14:39,247 WARN L317 ript$VariableManager]: TermVariabe Thread0_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:14:39,248 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:14:39,248 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:14:39,248 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:14:39,248 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:14:39,248 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:14:39,248 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:14:39,249 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:14:39,249 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:14:39,249 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:14:39,249 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:14:39,249 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:14:39,249 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:14:39,249 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:14:39,250 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:14:39,250 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:14:39,250 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:14:39,250 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:14:39,250 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:14:39,250 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:14:39,251 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:14:39,251 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:14:39,251 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:14:39,251 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:14:39,251 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:14:39,252 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet10.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:14:39,252 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet10.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:14:39,252 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:14:39,252 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:14:39,252 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet10.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:14:39,252 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet10.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:14:39,253 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:14:39,253 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:14:39,253 WARN L317 ript$VariableManager]: TermVariabe Thread1_P2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:14:39,253 WARN L317 ript$VariableManager]: TermVariabe Thread1_P2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:14:39,253 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:14:39,254 WARN L317 ript$VariableManager]: TermVariabe Thread1_P2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:14:39,254 WARN L317 ript$VariableManager]: TermVariabe Thread1_P2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:14:39,254 WARN L317 ript$VariableManager]: TermVariabe Thread1_P2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:14:39,254 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~nondet12.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:14:39,254 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~nondet11.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:14:39,254 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~nondet12.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:14:39,254 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~nondet11.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:14:39,255 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~nondet12.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:14:39,255 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~nondet12.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:14:39,255 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~nondet11.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:14:39,255 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~nondet11.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:14:39,255 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:14:39,255 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:14:39,256 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:14:39,256 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:14:39,256 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:14:39,256 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:14:39,256 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:14:39,256 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:14:39,256 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:14:39,257 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:14:39,257 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:14:39,257 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:14:39,257 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:14:39,257 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:14:39,257 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:14:39,258 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:14:39,258 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:14:39,258 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:14:39,258 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:14:39,258 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:14:39,258 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:14:39,258 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:14:39,259 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:14:39,259 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:14:39,259 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:14:39,259 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:14:39,259 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:14:39,259 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:14:39,260 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:14:39,260 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:14:39,260 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:14:39,260 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:14:39,260 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:14:39,260 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:14:39,260 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:14:39,261 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:14:39,261 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:14:39,261 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:14:39,261 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:14:39,261 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:14:39,261 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:14:39,261 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:14:39,262 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:14:39,262 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:14:39,262 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:14:39,262 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:14:39,262 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:14:39,262 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:14:39,262 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:14:39,262 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:14:39,263 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:14:39,263 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:14:39,263 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:14:39,263 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:14:39,263 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:14:39,263 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:14:39,263 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:14:39,263 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:14:39,264 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:14:39,264 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:14:39,264 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:14:39,264 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:14:39,264 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:14:39,264 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:14:39,264 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:14:39,264 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:14:39,265 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:14:39,265 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:14:39,265 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:14:39,265 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:14:39,265 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:14:39,265 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:14:39,265 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:14:39,265 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:14:39,265 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:14:39,266 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:14:39,266 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:14:39,266 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:14:39,266 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:14:39,266 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:14:39,266 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:14:39,266 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:14:39,266 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:14:39,267 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:14:39,267 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:14:39,267 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:14:39,267 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:14:39,267 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:14:39,267 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:14:39,267 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:14:39,267 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:14:39,268 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:14:39,268 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:14:39,268 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:14:39,268 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:14:39,268 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:14:39,268 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:14:39,268 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:14:39,268 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:14:39,268 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:14:39,269 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:14:39,269 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:14:39,269 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:14:39,269 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:14:39,269 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:14:39,269 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:14:39,269 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:14:39,269 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:14:39,270 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~nondet40.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:14:39,270 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~nondet40.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:14:39,270 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:14:39,270 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:14:39,270 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~nondet40.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:14:39,270 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~nondet40.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:14:39,275 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2018-12-02 12:14:39,275 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-02 12:14:39,280 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-12-02 12:14:39,289 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2018-12-02 12:14:39,304 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-02 12:14:39,304 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-02 12:14:39,304 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-02 12:14:39,304 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-02 12:14:39,304 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-02 12:14:39,304 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-02 12:14:39,304 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-02 12:14:39,304 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-02 12:14:39,312 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 198places, 256 transitions [2018-12-02 12:16:21,234 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 385953 states. [2018-12-02 12:16:21,236 INFO L276 IsEmpty]: Start isEmpty. Operand 385953 states. [2018-12-02 12:16:21,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-12-02 12:16:21,244 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 12:16:21,245 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-02 12:16:21,247 INFO L423 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 12:16:21,250 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:16:21,251 INFO L82 PathProgramCache]: Analyzing trace with hash 654477059, now seen corresponding path program 1 times [2018-12-02 12:16:21,252 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 12:16:21,287 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:16:21,288 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:16:21,288 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:16:21,288 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 12:16:21,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:16:21,406 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-02 12:16:21,407 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 12:16:21,408 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 12:16:21,408 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 12:16:21,411 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 12:16:21,418 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 12:16:21,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 12:16:21,420 INFO L87 Difference]: Start difference. First operand 385953 states. Second operand 4 states. [2018-12-02 12:16:27,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:16:27,769 INFO L93 Difference]: Finished difference Result 735793 states and 3585691 transitions. [2018-12-02 12:16:27,770 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 12:16:27,771 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 44 [2018-12-02 12:16:27,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 12:16:29,750 INFO L225 Difference]: With dead ends: 735793 [2018-12-02 12:16:29,750 INFO L226 Difference]: Without dead ends: 634643 [2018-12-02 12:16:29,751 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-02 12:16:44,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 634643 states. [2018-12-02 12:16:51,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 634643 to 340233. [2018-12-02 12:16:51,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 340233 states. [2018-12-02 12:17:00,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340233 states to 340233 states and 1669458 transitions. [2018-12-02 12:17:00,298 INFO L78 Accepts]: Start accepts. Automaton has 340233 states and 1669458 transitions. Word has length 44 [2018-12-02 12:17:00,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 12:17:00,299 INFO L480 AbstractCegarLoop]: Abstraction has 340233 states and 1669458 transitions. [2018-12-02 12:17:00,299 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 12:17:00,300 INFO L276 IsEmpty]: Start isEmpty. Operand 340233 states and 1669458 transitions. [2018-12-02 12:17:00,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-12-02 12:17:00,306 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 12:17:00,306 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] [2018-12-02 12:17:00,307 INFO L423 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 12:17:00,307 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:17:00,307 INFO L82 PathProgramCache]: Analyzing trace with hash -837598066, now seen corresponding path program 1 times [2018-12-02 12:17:00,307 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 12:17:00,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:17:00,310 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:17:00,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:17:00,311 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 12:17:00,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:17:00,363 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-02 12:17:00,363 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 12:17:00,364 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 12:17:00,364 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 12:17:00,365 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 12:17:00,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 12:17:00,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 12:17:00,365 INFO L87 Difference]: Start difference. First operand 340233 states and 1669458 transitions. Second operand 5 states. [2018-12-02 12:17:13,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:17:13,472 INFO L93 Difference]: Finished difference Result 1007353 states and 4689304 transitions. [2018-12-02 12:17:13,473 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 12:17:13,473 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 51 [2018-12-02 12:17:13,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 12:17:16,661 INFO L225 Difference]: With dead ends: 1007353 [2018-12-02 12:17:16,661 INFO L226 Difference]: Without dead ends: 1006353 [2018-12-02 12:17:16,662 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-02 12:17:28,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1006353 states. [2018-12-02 12:17:38,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1006353 to 549408. [2018-12-02 12:17:38,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 549408 states. [2018-12-02 12:17:40,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 549408 states to 549408 states and 2556398 transitions. [2018-12-02 12:17:40,906 INFO L78 Accepts]: Start accepts. Automaton has 549408 states and 2556398 transitions. Word has length 51 [2018-12-02 12:17:40,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 12:17:40,907 INFO L480 AbstractCegarLoop]: Abstraction has 549408 states and 2556398 transitions. [2018-12-02 12:17:40,907 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 12:17:40,907 INFO L276 IsEmpty]: Start isEmpty. Operand 549408 states and 2556398 transitions. [2018-12-02 12:17:40,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-12-02 12:17:40,913 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 12:17:40,914 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-02 12:17:40,914 INFO L423 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 12:17:40,914 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:17:40,914 INFO L82 PathProgramCache]: Analyzing trace with hash -988308488, now seen corresponding path program 1 times [2018-12-02 12:17:40,914 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 12:17:40,916 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:17:40,916 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:17:40,916 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:17:40,916 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 12:17:40,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:17:40,949 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-02 12:17:40,949 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 12:17:40,949 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 12:17:40,949 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 12:17:40,949 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 12:17:40,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 12:17:40,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 12:17:40,950 INFO L87 Difference]: Start difference. First operand 549408 states and 2556398 transitions. Second operand 3 states. [2018-12-02 12:17:48,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:17:48,318 INFO L93 Difference]: Finished difference Result 549408 states and 2556033 transitions. [2018-12-02 12:17:48,319 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 12:17:48,319 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2018-12-02 12:17:48,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 12:17:49,835 INFO L225 Difference]: With dead ends: 549408 [2018-12-02 12:17:49,835 INFO L226 Difference]: Without dead ends: 549408 [2018-12-02 12:17:49,835 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-02 12:17:58,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 549408 states. [2018-12-02 12:18:05,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 549408 to 549408. [2018-12-02 12:18:05,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 549408 states. [2018-12-02 12:18:17,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 549408 states to 549408 states and 2556033 transitions. [2018-12-02 12:18:17,357 INFO L78 Accepts]: Start accepts. Automaton has 549408 states and 2556033 transitions. Word has length 52 [2018-12-02 12:18:17,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 12:18:17,358 INFO L480 AbstractCegarLoop]: Abstraction has 549408 states and 2556033 transitions. [2018-12-02 12:18:17,358 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 12:18:17,358 INFO L276 IsEmpty]: Start isEmpty. Operand 549408 states and 2556033 transitions. [2018-12-02 12:18:17,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-12-02 12:18:17,364 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 12:18:17,364 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-02 12:18:17,364 INFO L423 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 12:18:17,364 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:18:17,364 INFO L82 PathProgramCache]: Analyzing trace with hash 754501847, now seen corresponding path program 1 times [2018-12-02 12:18:17,364 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 12:18:17,366 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:18:17,366 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:18:17,366 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:18:17,366 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 12:18:17,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:18:17,412 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-02 12:18:17,412 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 12:18:17,412 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 12:18:17,412 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 12:18:17,412 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 12:18:17,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 12:18:17,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 12:18:17,413 INFO L87 Difference]: Start difference. First operand 549408 states and 2556033 transitions. Second operand 4 states. [2018-12-02 12:18:20,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:18:20,261 INFO L93 Difference]: Finished difference Result 472455 states and 2161069 transitions. [2018-12-02 12:18:20,262 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 12:18:20,262 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 52 [2018-12-02 12:18:20,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 12:18:25,813 INFO L225 Difference]: With dead ends: 472455 [2018-12-02 12:18:25,813 INFO L226 Difference]: Without dead ends: 463970 [2018-12-02 12:18:25,813 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-02 12:18:33,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 463970 states. [2018-12-02 12:18:38,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 463970 to 463970. [2018-12-02 12:18:38,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 463970 states. [2018-12-02 12:18:40,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 463970 states to 463970 states and 2131578 transitions. [2018-12-02 12:18:40,653 INFO L78 Accepts]: Start accepts. Automaton has 463970 states and 2131578 transitions. Word has length 52 [2018-12-02 12:18:40,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 12:18:40,653 INFO L480 AbstractCegarLoop]: Abstraction has 463970 states and 2131578 transitions. [2018-12-02 12:18:40,653 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 12:18:40,653 INFO L276 IsEmpty]: Start isEmpty. Operand 463970 states and 2131578 transitions. [2018-12-02 12:18:40,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-12-02 12:18:40,658 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 12:18:40,658 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-02 12:18:40,659 INFO L423 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 12:18:40,659 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:18:40,659 INFO L82 PathProgramCache]: Analyzing trace with hash -1302071129, now seen corresponding path program 1 times [2018-12-02 12:18:40,659 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 12:18:40,660 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:18:40,660 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:18:40,661 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:18:40,661 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 12:18:40,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:18:40,701 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-02 12:18:40,701 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 12:18:40,702 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 12:18:40,702 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 12:18:40,702 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 12:18:40,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 12:18:40,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-02 12:18:40,702 INFO L87 Difference]: Start difference. First operand 463970 states and 2131578 transitions. Second operand 5 states. [2018-12-02 12:18:41,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:18:41,664 INFO L93 Difference]: Finished difference Result 107974 states and 450057 transitions. [2018-12-02 12:18:41,664 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 12:18:41,665 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 53 [2018-12-02 12:18:41,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 12:18:41,887 INFO L225 Difference]: With dead ends: 107974 [2018-12-02 12:18:41,887 INFO L226 Difference]: Without dead ends: 100622 [2018-12-02 12:18:41,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-02 12:18:42,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100622 states. [2018-12-02 12:18:47,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100622 to 100622. [2018-12-02 12:18:47,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100622 states. [2018-12-02 12:18:47,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100622 states to 100622 states and 420923 transitions. [2018-12-02 12:18:47,650 INFO L78 Accepts]: Start accepts. Automaton has 100622 states and 420923 transitions. Word has length 53 [2018-12-02 12:18:47,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 12:18:47,650 INFO L480 AbstractCegarLoop]: Abstraction has 100622 states and 420923 transitions. [2018-12-02 12:18:47,650 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 12:18:47,650 INFO L276 IsEmpty]: Start isEmpty. Operand 100622 states and 420923 transitions. [2018-12-02 12:18:47,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-12-02 12:18:47,660 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 12:18:47,661 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] [2018-12-02 12:18:47,661 INFO L423 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 12:18:47,661 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:18:47,661 INFO L82 PathProgramCache]: Analyzing trace with hash -2137995013, now seen corresponding path program 1 times [2018-12-02 12:18:47,661 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 12:18:47,663 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:18:47,663 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:18:47,663 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:18:47,663 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 12:18:47,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:18:47,718 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-02 12:18:47,718 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 12:18:47,718 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 12:18:47,718 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 12:18:47,719 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 12:18:47,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 12:18:47,719 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-02 12:18:47,719 INFO L87 Difference]: Start difference. First operand 100622 states and 420923 transitions. Second operand 6 states. [2018-12-02 12:18:47,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:18:47,784 INFO L93 Difference]: Finished difference Result 15454 states and 53779 transitions. [2018-12-02 12:18:47,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 12:18:47,784 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 66 [2018-12-02 12:18:47,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 12:18:47,801 INFO L225 Difference]: With dead ends: 15454 [2018-12-02 12:18:47,801 INFO L226 Difference]: Without dead ends: 13166 [2018-12-02 12:18:47,802 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-02 12:18:47,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13166 states. [2018-12-02 12:18:47,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13166 to 13026. [2018-12-02 12:18:47,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13026 states. [2018-12-02 12:18:47,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13026 states to 13026 states and 44819 transitions. [2018-12-02 12:18:47,952 INFO L78 Accepts]: Start accepts. Automaton has 13026 states and 44819 transitions. Word has length 66 [2018-12-02 12:18:47,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 12:18:47,952 INFO L480 AbstractCegarLoop]: Abstraction has 13026 states and 44819 transitions. [2018-12-02 12:18:47,952 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 12:18:47,952 INFO L276 IsEmpty]: Start isEmpty. Operand 13026 states and 44819 transitions. [2018-12-02 12:18:47,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-12-02 12:18:47,968 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 12:18:47,968 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, 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-02 12:18:47,968 INFO L423 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 12:18:47,968 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:18:47,968 INFO L82 PathProgramCache]: Analyzing trace with hash -318649128, now seen corresponding path program 1 times [2018-12-02 12:18:47,968 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 12:18:47,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:18:47,970 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:18:47,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:18:47,970 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 12:18:47,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:18:48,032 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-02 12:18:48,032 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 12:18:48,032 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 12:18:48,032 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 12:18:48,033 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 12:18:48,033 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 12:18:48,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-02 12:18:48,033 INFO L87 Difference]: Start difference. First operand 13026 states and 44819 transitions. Second operand 6 states. [2018-12-02 12:18:48,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:18:48,537 INFO L93 Difference]: Finished difference Result 18286 states and 62027 transitions. [2018-12-02 12:18:48,537 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 12:18:48,537 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 115 [2018-12-02 12:18:48,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 12:18:48,558 INFO L225 Difference]: With dead ends: 18286 [2018-12-02 12:18:48,559 INFO L226 Difference]: Without dead ends: 18286 [2018-12-02 12:18:48,559 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2018-12-02 12:18:48,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18286 states. [2018-12-02 12:18:48,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18286 to 15541. [2018-12-02 12:18:48,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15541 states. [2018-12-02 12:18:48,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15541 states to 15541 states and 52911 transitions. [2018-12-02 12:18:48,746 INFO L78 Accepts]: Start accepts. Automaton has 15541 states and 52911 transitions. Word has length 115 [2018-12-02 12:18:48,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 12:18:48,747 INFO L480 AbstractCegarLoop]: Abstraction has 15541 states and 52911 transitions. [2018-12-02 12:18:48,747 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 12:18:48,747 INFO L276 IsEmpty]: Start isEmpty. Operand 15541 states and 52911 transitions. [2018-12-02 12:18:48,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-12-02 12:18:48,764 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 12:18:48,764 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, 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-02 12:18:48,764 INFO L423 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 12:18:48,764 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:18:48,764 INFO L82 PathProgramCache]: Analyzing trace with hash -2024167080, now seen corresponding path program 2 times [2018-12-02 12:18:48,764 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 12:18:48,766 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:18:48,766 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:18:48,766 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:18:48,766 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 12:18:48,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:18:48,809 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-02 12:18:48,809 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 12:18:48,809 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 12:18:48,809 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 12:18:48,809 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 12:18:48,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 12:18:48,810 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 12:18:48,810 INFO L87 Difference]: Start difference. First operand 15541 states and 52911 transitions. Second operand 4 states. [2018-12-02 12:18:49,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:18:49,044 INFO L93 Difference]: Finished difference Result 22773 states and 75756 transitions. [2018-12-02 12:18:49,044 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 12:18:49,044 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 115 [2018-12-02 12:18:49,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 12:18:49,073 INFO L225 Difference]: With dead ends: 22773 [2018-12-02 12:18:49,073 INFO L226 Difference]: Without dead ends: 22773 [2018-12-02 12:18:49,073 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-02 12:18:49,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22773 states. [2018-12-02 12:18:49,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22773 to 17141. [2018-12-02 12:18:49,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17141 states. [2018-12-02 12:18:49,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17141 states to 17141 states and 58476 transitions. [2018-12-02 12:18:49,297 INFO L78 Accepts]: Start accepts. Automaton has 17141 states and 58476 transitions. Word has length 115 [2018-12-02 12:18:49,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 12:18:49,297 INFO L480 AbstractCegarLoop]: Abstraction has 17141 states and 58476 transitions. [2018-12-02 12:18:49,297 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 12:18:49,298 INFO L276 IsEmpty]: Start isEmpty. Operand 17141 states and 58476 transitions. [2018-12-02 12:18:49,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-12-02 12:18:49,316 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 12:18:49,316 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, 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-02 12:18:49,317 INFO L423 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 12:18:49,317 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:18:49,317 INFO L82 PathProgramCache]: Analyzing trace with hash -1920346881, now seen corresponding path program 1 times [2018-12-02 12:18:49,317 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 12:18:49,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:18:49,319 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 12:18:49,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:18:49,319 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 12:18:49,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:18:49,362 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-02 12:18:49,363 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 12:18:49,363 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 12:18:49,363 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 12:18:49,363 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 12:18:49,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 12:18:49,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-02 12:18:49,364 INFO L87 Difference]: Start difference. First operand 17141 states and 58476 transitions. Second operand 4 states. [2018-12-02 12:18:49,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:18:49,599 INFO L93 Difference]: Finished difference Result 18996 states and 64220 transitions. [2018-12-02 12:18:49,599 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 12:18:49,599 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 115 [2018-12-02 12:18:49,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 12:18:49,624 INFO L225 Difference]: With dead ends: 18996 [2018-12-02 12:18:49,625 INFO L226 Difference]: Without dead ends: 18996 [2018-12-02 12:18:49,625 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-02 12:18:49,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18996 states. [2018-12-02 12:18:49,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18996 to 17116. [2018-12-02 12:18:49,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17116 states. [2018-12-02 12:18:49,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17116 states to 17116 states and 58281 transitions. [2018-12-02 12:18:49,826 INFO L78 Accepts]: Start accepts. Automaton has 17116 states and 58281 transitions. Word has length 115 [2018-12-02 12:18:49,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 12:18:49,826 INFO L480 AbstractCegarLoop]: Abstraction has 17116 states and 58281 transitions. [2018-12-02 12:18:49,826 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 12:18:49,826 INFO L276 IsEmpty]: Start isEmpty. Operand 17116 states and 58281 transitions. [2018-12-02 12:18:49,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-12-02 12:18:49,843 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 12:18:49,844 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, 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-02 12:18:49,844 INFO L423 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 12:18:49,844 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:18:49,844 INFO L82 PathProgramCache]: Analyzing trace with hash 1198660703, now seen corresponding path program 1 times [2018-12-02 12:18:49,844 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 12:18:49,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:18:49,846 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:18:49,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:18:49,846 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 12:18:49,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:18:49,921 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-02 12:18:49,921 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 12:18:49,921 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-02 12:18:49,921 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 12:18:49,921 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 12:18:49,922 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 12:18:49,922 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2018-12-02 12:18:49,922 INFO L87 Difference]: Start difference. First operand 17116 states and 58281 transitions. Second operand 7 states. [2018-12-02 12:18:50,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:18:50,204 INFO L93 Difference]: Finished difference Result 20071 states and 67655 transitions. [2018-12-02 12:18:50,204 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 12:18:50,204 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 115 [2018-12-02 12:18:50,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 12:18:50,227 INFO L225 Difference]: With dead ends: 20071 [2018-12-02 12:18:50,227 INFO L226 Difference]: Without dead ends: 20071 [2018-12-02 12:18:50,227 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2018-12-02 12:18:50,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20071 states. [2018-12-02 12:18:50,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20071 to 17406. [2018-12-02 12:18:50,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17406 states. [2018-12-02 12:18:50,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17406 states to 17406 states and 59183 transitions. [2018-12-02 12:18:50,432 INFO L78 Accepts]: Start accepts. Automaton has 17406 states and 59183 transitions. Word has length 115 [2018-12-02 12:18:50,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 12:18:50,433 INFO L480 AbstractCegarLoop]: Abstraction has 17406 states and 59183 transitions. [2018-12-02 12:18:50,433 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 12:18:50,433 INFO L276 IsEmpty]: Start isEmpty. Operand 17406 states and 59183 transitions. [2018-12-02 12:18:50,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-12-02 12:18:50,450 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 12:18:50,450 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, 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-02 12:18:50,450 INFO L423 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 12:18:50,451 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:18:50,451 INFO L82 PathProgramCache]: Analyzing trace with hash -926725991, now seen corresponding path program 1 times [2018-12-02 12:18:50,451 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 12:18:50,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:18:50,452 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:18:50,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:18:50,452 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 12:18:50,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:18:50,510 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-02 12:18:50,511 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 12:18:50,511 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 12:18:50,511 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 12:18:50,511 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 12:18:50,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 12:18:50,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-02 12:18:50,512 INFO L87 Difference]: Start difference. First operand 17406 states and 59183 transitions. Second operand 5 states. [2018-12-02 12:18:50,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:18:50,663 INFO L93 Difference]: Finished difference Result 13026 states and 43919 transitions. [2018-12-02 12:18:50,663 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 12:18:50,663 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 115 [2018-12-02 12:18:50,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 12:18:50,678 INFO L225 Difference]: With dead ends: 13026 [2018-12-02 12:18:50,678 INFO L226 Difference]: Without dead ends: 13026 [2018-12-02 12:18:50,678 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-02 12:18:50,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13026 states. [2018-12-02 12:18:50,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13026 to 12966. [2018-12-02 12:18:50,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12966 states. [2018-12-02 12:18:50,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12966 states to 12966 states and 43731 transitions. [2018-12-02 12:18:50,823 INFO L78 Accepts]: Start accepts. Automaton has 12966 states and 43731 transitions. Word has length 115 [2018-12-02 12:18:50,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 12:18:50,823 INFO L480 AbstractCegarLoop]: Abstraction has 12966 states and 43731 transitions. [2018-12-02 12:18:50,823 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 12:18:50,823 INFO L276 IsEmpty]: Start isEmpty. Operand 12966 states and 43731 transitions. [2018-12-02 12:18:50,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2018-12-02 12:18:50,836 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 12:18:50,836 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, 1, 1, 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-02 12:18:50,837 INFO L423 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 12:18:50,837 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:18:50,837 INFO L82 PathProgramCache]: Analyzing trace with hash 1258133646, now seen corresponding path program 1 times [2018-12-02 12:18:50,837 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 12:18:50,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:18:50,838 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:18:50,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:18:50,838 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 12:18:50,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:18:50,885 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-02 12:18:50,885 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 12:18:50,885 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 12:18:50,885 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 12:18:50,886 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 12:18:50,886 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 12:18:50,886 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 12:18:50,886 INFO L87 Difference]: Start difference. First operand 12966 states and 43731 transitions. Second operand 4 states. [2018-12-02 12:18:51,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:18:51,013 INFO L93 Difference]: Finished difference Result 14404 states and 48287 transitions. [2018-12-02 12:18:51,013 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 12:18:51,013 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 117 [2018-12-02 12:18:51,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 12:18:51,030 INFO L225 Difference]: With dead ends: 14404 [2018-12-02 12:18:51,030 INFO L226 Difference]: Without dead ends: 14404 [2018-12-02 12:18:51,030 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 12:18:51,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14404 states. [2018-12-02 12:18:51,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14404 to 13176. [2018-12-02 12:18:51,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13176 states. [2018-12-02 12:18:51,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13176 states to 13176 states and 44384 transitions. [2018-12-02 12:18:51,183 INFO L78 Accepts]: Start accepts. Automaton has 13176 states and 44384 transitions. Word has length 117 [2018-12-02 12:18:51,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 12:18:51,183 INFO L480 AbstractCegarLoop]: Abstraction has 13176 states and 44384 transitions. [2018-12-02 12:18:51,184 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 12:18:51,184 INFO L276 IsEmpty]: Start isEmpty. Operand 13176 states and 44384 transitions. [2018-12-02 12:18:51,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2018-12-02 12:18:51,198 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 12:18:51,198 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, 1, 1, 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-02 12:18:51,198 INFO L423 AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 12:18:51,198 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:18:51,199 INFO L82 PathProgramCache]: Analyzing trace with hash -677526641, now seen corresponding path program 1 times [2018-12-02 12:18:51,199 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 12:18:51,200 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:18:51,200 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:18:51,200 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:18:51,200 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 12:18:51,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:18:51,227 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-02 12:18:51,227 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 12:18:51,227 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 12:18:51,227 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 12:18:51,227 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 12:18:51,228 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 12:18:51,228 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 12:18:51,228 INFO L87 Difference]: Start difference. First operand 13176 states and 44384 transitions. Second operand 3 states. [2018-12-02 12:18:51,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:18:51,383 INFO L93 Difference]: Finished difference Result 16646 states and 54935 transitions. [2018-12-02 12:18:51,383 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 12:18:51,383 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 117 [2018-12-02 12:18:51,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 12:18:51,402 INFO L225 Difference]: With dead ends: 16646 [2018-12-02 12:18:51,402 INFO L226 Difference]: Without dead ends: 16646 [2018-12-02 12:18:51,403 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-02 12:18:51,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16646 states. [2018-12-02 12:18:51,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16646 to 15966. [2018-12-02 12:18:51,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15966 states. [2018-12-02 12:18:51,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15966 states to 15966 states and 52956 transitions. [2018-12-02 12:18:51,581 INFO L78 Accepts]: Start accepts. Automaton has 15966 states and 52956 transitions. Word has length 117 [2018-12-02 12:18:51,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 12:18:51,581 INFO L480 AbstractCegarLoop]: Abstraction has 15966 states and 52956 transitions. [2018-12-02 12:18:51,581 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 12:18:51,581 INFO L276 IsEmpty]: Start isEmpty. Operand 15966 states and 52956 transitions. [2018-12-02 12:18:51,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2018-12-02 12:18:51,696 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 12:18:51,697 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, 1, 1, 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-02 12:18:51,697 INFO L423 AbstractCegarLoop]: === Iteration 14 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 12:18:51,697 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:18:51,697 INFO L82 PathProgramCache]: Analyzing trace with hash 328366779, now seen corresponding path program 2 times [2018-12-02 12:18:51,697 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 12:18:51,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:18:51,699 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:18:51,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:18:51,699 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 12:18:51,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:18:51,769 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-02 12:18:51,769 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 12:18:51,769 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 12:18:51,769 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 12:18:51,770 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 12:18:51,770 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 12:18:51,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-02 12:18:51,770 INFO L87 Difference]: Start difference. First operand 15966 states and 52956 transitions. Second operand 6 states. [2018-12-02 12:18:52,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:18:52,060 INFO L93 Difference]: Finished difference Result 19309 states and 62969 transitions. [2018-12-02 12:18:52,060 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 12:18:52,060 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 117 [2018-12-02 12:18:52,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 12:18:52,080 INFO L225 Difference]: With dead ends: 19309 [2018-12-02 12:18:52,081 INFO L226 Difference]: Without dead ends: 19309 [2018-12-02 12:18:52,081 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-12-02 12:18:52,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19309 states. [2018-12-02 12:18:52,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19309 to 14951. [2018-12-02 12:18:52,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14951 states. [2018-12-02 12:18:52,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14951 states to 14951 states and 49114 transitions. [2018-12-02 12:18:52,257 INFO L78 Accepts]: Start accepts. Automaton has 14951 states and 49114 transitions. Word has length 117 [2018-12-02 12:18:52,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 12:18:52,257 INFO L480 AbstractCegarLoop]: Abstraction has 14951 states and 49114 transitions. [2018-12-02 12:18:52,257 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 12:18:52,257 INFO L276 IsEmpty]: Start isEmpty. Operand 14951 states and 49114 transitions. [2018-12-02 12:18:52,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-12-02 12:18:52,270 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 12:18:52,270 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, 1, 1, 1, 1, 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-02 12:18:52,270 INFO L423 AbstractCegarLoop]: === Iteration 15 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 12:18:52,270 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:18:52,270 INFO L82 PathProgramCache]: Analyzing trace with hash -1803487292, now seen corresponding path program 1 times [2018-12-02 12:18:52,270 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 12:18:52,271 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:18:52,271 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 12:18:52,271 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:18:52,271 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 12:18:52,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:18:52,360 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-02 12:18:52,360 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 12:18:52,360 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-02 12:18:52,360 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 12:18:52,360 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 12:18:52,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 12:18:52,361 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-12-02 12:18:52,361 INFO L87 Difference]: Start difference. First operand 14951 states and 49114 transitions. Second operand 7 states. [2018-12-02 12:18:52,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:18:52,551 INFO L93 Difference]: Finished difference Result 21301 states and 68469 transitions. [2018-12-02 12:18:52,551 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 12:18:52,551 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 119 [2018-12-02 12:18:52,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 12:18:52,576 INFO L225 Difference]: With dead ends: 21301 [2018-12-02 12:18:52,576 INFO L226 Difference]: Without dead ends: 21201 [2018-12-02 12:18:52,576 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2018-12-02 12:18:52,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21201 states. [2018-12-02 12:18:52,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21201 to 16756. [2018-12-02 12:18:52,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16756 states. [2018-12-02 12:18:52,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16756 states to 16756 states and 54648 transitions. [2018-12-02 12:18:52,783 INFO L78 Accepts]: Start accepts. Automaton has 16756 states and 54648 transitions. Word has length 119 [2018-12-02 12:18:52,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 12:18:52,784 INFO L480 AbstractCegarLoop]: Abstraction has 16756 states and 54648 transitions. [2018-12-02 12:18:52,784 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 12:18:52,784 INFO L276 IsEmpty]: Start isEmpty. Operand 16756 states and 54648 transitions. [2018-12-02 12:18:52,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-12-02 12:18:52,798 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 12:18:52,798 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, 1, 1, 1, 1, 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-02 12:18:52,799 INFO L423 AbstractCegarLoop]: === Iteration 16 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 12:18:52,799 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:18:52,799 INFO L82 PathProgramCache]: Analyzing trace with hash 976677793, now seen corresponding path program 1 times [2018-12-02 12:18:52,799 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 12:18:52,800 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:18:52,800 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:18:52,800 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:18:52,800 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 12:18:52,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:18:52,884 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-02 12:18:52,884 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 12:18:52,884 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 12:18:52,884 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 12:18:52,884 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 12:18:52,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 12:18:52,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-12-02 12:18:52,885 INFO L87 Difference]: Start difference. First operand 16756 states and 54648 transitions. Second operand 6 states. [2018-12-02 12:18:53,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:18:53,142 INFO L93 Difference]: Finished difference Result 30636 states and 98893 transitions. [2018-12-02 12:18:53,142 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 12:18:53,143 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 119 [2018-12-02 12:18:53,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 12:18:53,178 INFO L225 Difference]: With dead ends: 30636 [2018-12-02 12:18:53,178 INFO L226 Difference]: Without dead ends: 30636 [2018-12-02 12:18:53,178 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-12-02 12:18:53,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30636 states. [2018-12-02 12:18:53,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30636 to 21090. [2018-12-02 12:18:53,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21090 states. [2018-12-02 12:18:53,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21090 states to 21090 states and 67478 transitions. [2018-12-02 12:18:53,481 INFO L78 Accepts]: Start accepts. Automaton has 21090 states and 67478 transitions. Word has length 119 [2018-12-02 12:18:53,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 12:18:53,481 INFO L480 AbstractCegarLoop]: Abstraction has 21090 states and 67478 transitions. [2018-12-02 12:18:53,481 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 12:18:53,481 INFO L276 IsEmpty]: Start isEmpty. Operand 21090 states and 67478 transitions. [2018-12-02 12:18:53,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-12-02 12:18:53,498 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 12:18:53,498 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, 1, 1, 1, 1, 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-02 12:18:53,498 INFO L423 AbstractCegarLoop]: === Iteration 17 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 12:18:53,498 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:18:53,499 INFO L82 PathProgramCache]: Analyzing trace with hash -747894305, now seen corresponding path program 1 times [2018-12-02 12:18:53,499 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 12:18:53,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:18:53,500 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:18:53,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:18:53,500 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 12:18:53,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:18:53,538 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-02 12:18:53,538 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 12:18:53,538 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 12:18:53,538 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 12:18:53,539 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 12:18:53,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 12:18:53,539 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 12:18:53,539 INFO L87 Difference]: Start difference. First operand 21090 states and 67478 transitions. Second operand 4 states. [2018-12-02 12:18:53,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:18:53,665 INFO L93 Difference]: Finished difference Result 22434 states and 72166 transitions. [2018-12-02 12:18:53,666 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 12:18:53,666 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 119 [2018-12-02 12:18:53,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 12:18:53,690 INFO L225 Difference]: With dead ends: 22434 [2018-12-02 12:18:53,690 INFO L226 Difference]: Without dead ends: 22434 [2018-12-02 12:18:53,690 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 12:18:53,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22434 states. [2018-12-02 12:18:53,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22434 to 22306. [2018-12-02 12:18:53,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22306 states. [2018-12-02 12:18:53,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22306 states to 22306 states and 71750 transitions. [2018-12-02 12:18:53,960 INFO L78 Accepts]: Start accepts. Automaton has 22306 states and 71750 transitions. Word has length 119 [2018-12-02 12:18:53,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 12:18:53,960 INFO L480 AbstractCegarLoop]: Abstraction has 22306 states and 71750 transitions. [2018-12-02 12:18:53,960 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 12:18:53,960 INFO L276 IsEmpty]: Start isEmpty. Operand 22306 states and 71750 transitions. [2018-12-02 12:18:53,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-12-02 12:18:53,978 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 12:18:53,978 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, 1, 1, 1, 1, 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-02 12:18:53,978 INFO L423 AbstractCegarLoop]: === Iteration 18 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 12:18:53,978 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:18:53,979 INFO L82 PathProgramCache]: Analyzing trace with hash 1469863648, now seen corresponding path program 1 times [2018-12-02 12:18:53,979 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 12:18:53,979 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:18:53,979 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:18:53,980 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:18:53,980 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 12:18:53,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:18:54,053 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-02 12:18:54,053 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 12:18:54,053 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-02 12:18:54,053 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 12:18:54,053 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 12:18:54,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 12:18:54,053 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-12-02 12:18:54,053 INFO L87 Difference]: Start difference. First operand 22306 states and 71750 transitions. Second operand 7 states. [2018-12-02 12:18:54,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:18:54,465 INFO L93 Difference]: Finished difference Result 37134 states and 117549 transitions. [2018-12-02 12:18:54,465 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-02 12:18:54,465 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 119 [2018-12-02 12:18:54,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 12:18:54,510 INFO L225 Difference]: With dead ends: 37134 [2018-12-02 12:18:54,510 INFO L226 Difference]: Without dead ends: 37006 [2018-12-02 12:18:54,511 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2018-12-02 12:18:54,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37006 states. [2018-12-02 12:18:54,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37006 to 26072. [2018-12-02 12:18:54,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26072 states. [2018-12-02 12:18:54,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26072 states to 26072 states and 84537 transitions. [2018-12-02 12:18:54,878 INFO L78 Accepts]: Start accepts. Automaton has 26072 states and 84537 transitions. Word has length 119 [2018-12-02 12:18:54,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 12:18:54,878 INFO L480 AbstractCegarLoop]: Abstraction has 26072 states and 84537 transitions. [2018-12-02 12:18:54,878 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 12:18:54,878 INFO L276 IsEmpty]: Start isEmpty. Operand 26072 states and 84537 transitions. [2018-12-02 12:18:54,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-12-02 12:18:54,906 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 12:18:54,906 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, 1, 1, 1, 1, 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-02 12:18:54,906 INFO L423 AbstractCegarLoop]: === Iteration 19 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 12:18:54,906 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:18:54,906 INFO L82 PathProgramCache]: Analyzing trace with hash -1863489631, now seen corresponding path program 1 times [2018-12-02 12:18:54,906 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 12:18:54,907 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:18:54,907 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:18:54,907 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:18:54,907 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 12:18:54,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:18:54,979 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-02 12:18:54,979 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 12:18:54,979 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-02 12:18:54,979 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 12:18:54,979 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 12:18:54,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 12:18:54,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-12-02 12:18:54,980 INFO L87 Difference]: Start difference. First operand 26072 states and 84537 transitions. Second operand 7 states. [2018-12-02 12:18:55,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:18:55,574 INFO L93 Difference]: Finished difference Result 39403 states and 125683 transitions. [2018-12-02 12:18:55,575 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-02 12:18:55,575 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 119 [2018-12-02 12:18:55,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 12:18:55,626 INFO L225 Difference]: With dead ends: 39403 [2018-12-02 12:18:55,626 INFO L226 Difference]: Without dead ends: 39403 [2018-12-02 12:18:55,626 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2018-12-02 12:18:55,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39403 states. [2018-12-02 12:18:55,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39403 to 28058. [2018-12-02 12:18:55,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28058 states. [2018-12-02 12:18:56,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28058 states to 28058 states and 91261 transitions. [2018-12-02 12:18:56,009 INFO L78 Accepts]: Start accepts. Automaton has 28058 states and 91261 transitions. Word has length 119 [2018-12-02 12:18:56,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 12:18:56,009 INFO L480 AbstractCegarLoop]: Abstraction has 28058 states and 91261 transitions. [2018-12-02 12:18:56,009 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 12:18:56,009 INFO L276 IsEmpty]: Start isEmpty. Operand 28058 states and 91261 transitions. [2018-12-02 12:18:56,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-12-02 12:18:56,037 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 12:18:56,037 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, 1, 1, 1, 1, 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-02 12:18:56,038 INFO L423 AbstractCegarLoop]: === Iteration 20 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 12:18:56,038 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:18:56,038 INFO L82 PathProgramCache]: Analyzing trace with hash -618725150, now seen corresponding path program 1 times [2018-12-02 12:18:56,038 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 12:18:56,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:18:56,039 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:18:56,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:18:56,039 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 12:18:56,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:18:56,139 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-02 12:18:56,139 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 12:18:56,139 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-02 12:18:56,139 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 12:18:56,139 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 12:18:56,140 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 12:18:56,140 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-12-02 12:18:56,140 INFO L87 Difference]: Start difference. First operand 28058 states and 91261 transitions. Second operand 7 states. [2018-12-02 12:18:56,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:18:56,315 INFO L93 Difference]: Finished difference Result 42113 states and 138593 transitions. [2018-12-02 12:18:56,315 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 12:18:56,315 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 119 [2018-12-02 12:18:56,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 12:18:56,367 INFO L225 Difference]: With dead ends: 42113 [2018-12-02 12:18:56,367 INFO L226 Difference]: Without dead ends: 42113 [2018-12-02 12:18:56,367 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-12-02 12:18:56,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42113 states. [2018-12-02 12:18:56,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42113 to 29453. [2018-12-02 12:18:56,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29453 states. [2018-12-02 12:18:56,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29453 states to 29453 states and 95402 transitions. [2018-12-02 12:18:56,806 INFO L78 Accepts]: Start accepts. Automaton has 29453 states and 95402 transitions. Word has length 119 [2018-12-02 12:18:56,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 12:18:56,807 INFO L480 AbstractCegarLoop]: Abstraction has 29453 states and 95402 transitions. [2018-12-02 12:18:56,807 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 12:18:56,807 INFO L276 IsEmpty]: Start isEmpty. Operand 29453 states and 95402 transitions. [2018-12-02 12:18:56,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-12-02 12:18:56,836 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 12:18:56,836 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, 1, 1, 1, 1, 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-02 12:18:56,836 INFO L423 AbstractCegarLoop]: === Iteration 21 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 12:18:56,836 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:18:56,836 INFO L82 PathProgramCache]: Analyzing trace with hash 1740581859, now seen corresponding path program 1 times [2018-12-02 12:18:56,836 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 12:18:56,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:18:56,837 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:18:56,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:18:56,837 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 12:18:56,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:18:56,906 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-02 12:18:56,906 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 12:18:56,906 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-02 12:18:56,907 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 12:18:56,907 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 12:18:56,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 12:18:56,907 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-02 12:18:56,907 INFO L87 Difference]: Start difference. First operand 29453 states and 95402 transitions. Second operand 7 states. [2018-12-02 12:18:57,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:18:57,126 INFO L93 Difference]: Finished difference Result 31183 states and 100606 transitions. [2018-12-02 12:18:57,126 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-02 12:18:57,127 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 119 [2018-12-02 12:18:57,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 12:18:57,162 INFO L225 Difference]: With dead ends: 31183 [2018-12-02 12:18:57,162 INFO L226 Difference]: Without dead ends: 31183 [2018-12-02 12:18:57,162 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2018-12-02 12:18:57,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31183 states. [2018-12-02 12:18:57,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31183 to 29738. [2018-12-02 12:18:57,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29738 states. [2018-12-02 12:18:57,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29738 states to 29738 states and 96220 transitions. [2018-12-02 12:18:57,511 INFO L78 Accepts]: Start accepts. Automaton has 29738 states and 96220 transitions. Word has length 119 [2018-12-02 12:18:57,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 12:18:57,511 INFO L480 AbstractCegarLoop]: Abstraction has 29738 states and 96220 transitions. [2018-12-02 12:18:57,511 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 12:18:57,511 INFO L276 IsEmpty]: Start isEmpty. Operand 29738 states and 96220 transitions. [2018-12-02 12:18:57,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-12-02 12:18:57,540 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 12:18:57,540 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, 1, 1, 1, 1, 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-02 12:18:57,540 INFO L423 AbstractCegarLoop]: === Iteration 22 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 12:18:57,540 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:18:57,541 INFO L82 PathProgramCache]: Analyzing trace with hash -1748850235, now seen corresponding path program 1 times [2018-12-02 12:18:57,541 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 12:18:57,541 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:18:57,541 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:18:57,542 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:18:57,542 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 12:18:57,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:18:57,604 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-02 12:18:57,604 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 12:18:57,604 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 12:18:57,605 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 12:18:57,605 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 12:18:57,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 12:18:57,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-02 12:18:57,605 INFO L87 Difference]: Start difference. First operand 29738 states and 96220 transitions. Second operand 5 states. [2018-12-02 12:18:57,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:18:57,765 INFO L93 Difference]: Finished difference Result 28158 states and 90106 transitions. [2018-12-02 12:18:57,765 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 12:18:57,765 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 119 [2018-12-02 12:18:57,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 12:18:57,798 INFO L225 Difference]: With dead ends: 28158 [2018-12-02 12:18:57,798 INFO L226 Difference]: Without dead ends: 28158 [2018-12-02 12:18:57,799 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-12-02 12:18:57,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28158 states. [2018-12-02 12:18:58,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28158 to 28158. [2018-12-02 12:18:58,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28158 states. [2018-12-02 12:18:58,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28158 states to 28158 states and 90106 transitions. [2018-12-02 12:18:58,104 INFO L78 Accepts]: Start accepts. Automaton has 28158 states and 90106 transitions. Word has length 119 [2018-12-02 12:18:58,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 12:18:58,105 INFO L480 AbstractCegarLoop]: Abstraction has 28158 states and 90106 transitions. [2018-12-02 12:18:58,105 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 12:18:58,105 INFO L276 IsEmpty]: Start isEmpty. Operand 28158 states and 90106 transitions. [2018-12-02 12:18:58,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-12-02 12:18:58,131 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 12:18:58,131 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, 1, 1, 1, 1, 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-02 12:18:58,131 INFO L423 AbstractCegarLoop]: === Iteration 23 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 12:18:58,131 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:18:58,131 INFO L82 PathProgramCache]: Analyzing trace with hash 1801318562, now seen corresponding path program 1 times [2018-12-02 12:18:58,131 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 12:18:58,132 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:18:58,132 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:18:58,132 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:18:58,132 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 12:18:58,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:18:58,199 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-02 12:18:58,199 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 12:18:58,199 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 12:18:58,199 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 12:18:58,199 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 12:18:58,199 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 12:18:58,199 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-02 12:18:58,199 INFO L87 Difference]: Start difference. First operand 28158 states and 90106 transitions. Second operand 6 states. [2018-12-02 12:18:58,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:18:58,413 INFO L93 Difference]: Finished difference Result 25726 states and 80922 transitions. [2018-12-02 12:18:58,413 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 12:18:58,414 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 119 [2018-12-02 12:18:58,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 12:18:58,442 INFO L225 Difference]: With dead ends: 25726 [2018-12-02 12:18:58,442 INFO L226 Difference]: Without dead ends: 25726 [2018-12-02 12:18:58,443 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-02 12:18:58,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25726 states. [2018-12-02 12:18:58,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25726 to 19059. [2018-12-02 12:18:58,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19059 states. [2018-12-02 12:18:58,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19059 states to 19059 states and 60514 transitions. [2018-12-02 12:18:58,683 INFO L78 Accepts]: Start accepts. Automaton has 19059 states and 60514 transitions. Word has length 119 [2018-12-02 12:18:58,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 12:18:58,683 INFO L480 AbstractCegarLoop]: Abstraction has 19059 states and 60514 transitions. [2018-12-02 12:18:58,683 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 12:18:58,683 INFO L276 IsEmpty]: Start isEmpty. Operand 19059 states and 60514 transitions. [2018-12-02 12:18:58,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-12-02 12:18:58,700 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 12:18:58,700 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, 1, 1, 1, 1, 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-02 12:18:58,701 INFO L423 AbstractCegarLoop]: === Iteration 24 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 12:18:58,701 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:18:58,701 INFO L82 PathProgramCache]: Analyzing trace with hash 1056511820, now seen corresponding path program 1 times [2018-12-02 12:18:58,701 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 12:18:58,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:18:58,702 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:18:58,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:18:58,702 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 12:18:58,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:18:58,744 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-02 12:18:58,744 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 12:18:58,745 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 12:18:58,745 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 12:18:58,745 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 12:18:58,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 12:18:58,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 12:18:58,745 INFO L87 Difference]: Start difference. First operand 19059 states and 60514 transitions. Second operand 5 states. [2018-12-02 12:18:58,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:18:58,950 INFO L93 Difference]: Finished difference Result 21912 states and 69118 transitions. [2018-12-02 12:18:58,950 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 12:18:58,950 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 119 [2018-12-02 12:18:58,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 12:18:58,972 INFO L225 Difference]: With dead ends: 21912 [2018-12-02 12:18:58,972 INFO L226 Difference]: Without dead ends: 21912 [2018-12-02 12:18:58,973 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-12-02 12:18:59,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21912 states. [2018-12-02 12:18:59,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21912 to 19109. [2018-12-02 12:18:59,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19109 states. [2018-12-02 12:18:59,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19109 states to 19109 states and 60654 transitions. [2018-12-02 12:18:59,176 INFO L78 Accepts]: Start accepts. Automaton has 19109 states and 60654 transitions. Word has length 119 [2018-12-02 12:18:59,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 12:18:59,177 INFO L480 AbstractCegarLoop]: Abstraction has 19109 states and 60654 transitions. [2018-12-02 12:18:59,177 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 12:18:59,177 INFO L276 IsEmpty]: Start isEmpty. Operand 19109 states and 60654 transitions. [2018-12-02 12:18:59,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-12-02 12:18:59,191 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 12:18:59,191 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, 1, 1, 1, 1, 1, 1, 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-02 12:18:59,191 INFO L423 AbstractCegarLoop]: === Iteration 25 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 12:18:59,191 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:18:59,191 INFO L82 PathProgramCache]: Analyzing trace with hash 1436245957, now seen corresponding path program 1 times [2018-12-02 12:18:59,192 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 12:18:59,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:18:59,192 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:18:59,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:18:59,192 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 12:18:59,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:18:59,242 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-02 12:18:59,242 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 12:18:59,242 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 12:18:59,242 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 12:18:59,243 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 12:18:59,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 12:18:59,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 12:18:59,243 INFO L87 Difference]: Start difference. First operand 19109 states and 60654 transitions. Second operand 5 states. [2018-12-02 12:18:59,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:18:59,422 INFO L93 Difference]: Finished difference Result 20389 states and 64814 transitions. [2018-12-02 12:18:59,423 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 12:18:59,423 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 121 [2018-12-02 12:18:59,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 12:18:59,445 INFO L225 Difference]: With dead ends: 20389 [2018-12-02 12:18:59,445 INFO L226 Difference]: Without dead ends: 20389 [2018-12-02 12:18:59,445 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-02 12:18:59,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20389 states. [2018-12-02 12:18:59,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20389 to 19301. [2018-12-02 12:18:59,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19301 states. [2018-12-02 12:18:59,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19301 states to 19301 states and 61278 transitions. [2018-12-02 12:18:59,643 INFO L78 Accepts]: Start accepts. Automaton has 19301 states and 61278 transitions. Word has length 121 [2018-12-02 12:18:59,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 12:18:59,643 INFO L480 AbstractCegarLoop]: Abstraction has 19301 states and 61278 transitions. [2018-12-02 12:18:59,643 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 12:18:59,643 INFO L276 IsEmpty]: Start isEmpty. Operand 19301 states and 61278 transitions. [2018-12-02 12:18:59,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-12-02 12:18:59,657 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 12:18:59,657 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, 1, 1, 1, 1, 1, 1, 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-02 12:18:59,657 INFO L423 AbstractCegarLoop]: === Iteration 26 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 12:18:59,657 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:18:59,657 INFO L82 PathProgramCache]: Analyzing trace with hash -1613956858, now seen corresponding path program 1 times [2018-12-02 12:18:59,657 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 12:18:59,658 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:18:59,658 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:18:59,658 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:18:59,658 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 12:18:59,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:18:59,711 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-02 12:18:59,711 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 12:18:59,711 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 12:18:59,711 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 12:18:59,711 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 12:18:59,712 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 12:18:59,712 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-02 12:18:59,712 INFO L87 Difference]: Start difference. First operand 19301 states and 61278 transitions. Second operand 4 states. [2018-12-02 12:18:59,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:18:59,810 INFO L93 Difference]: Finished difference Result 28852 states and 91979 transitions. [2018-12-02 12:18:59,810 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 12:18:59,810 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 121 [2018-12-02 12:18:59,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 12:18:59,842 INFO L225 Difference]: With dead ends: 28852 [2018-12-02 12:18:59,843 INFO L226 Difference]: Without dead ends: 28852 [2018-12-02 12:18:59,843 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-02 12:18:59,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28852 states. [2018-12-02 12:19:00,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28852 to 28503. [2018-12-02 12:19:00,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28503 states. [2018-12-02 12:19:00,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28503 states to 28503 states and 90973 transitions. [2018-12-02 12:19:00,173 INFO L78 Accepts]: Start accepts. Automaton has 28503 states and 90973 transitions. Word has length 121 [2018-12-02 12:19:00,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 12:19:00,173 INFO L480 AbstractCegarLoop]: Abstraction has 28503 states and 90973 transitions. [2018-12-02 12:19:00,173 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 12:19:00,173 INFO L276 IsEmpty]: Start isEmpty. Operand 28503 states and 90973 transitions. [2018-12-02 12:19:00,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-12-02 12:19:00,200 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 12:19:00,200 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, 1, 1, 1, 1, 1, 1, 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-02 12:19:00,200 INFO L423 AbstractCegarLoop]: === Iteration 27 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 12:19:00,200 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:19:00,200 INFO L82 PathProgramCache]: Analyzing trace with hash 1793506757, now seen corresponding path program 1 times [2018-12-02 12:19:00,200 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 12:19:00,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:19:00,201 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:19:00,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:19:00,201 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 12:19:00,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:19:00,287 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-02 12:19:00,287 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 12:19:00,287 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 12:19:00,287 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 12:19:00,287 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 12:19:00,287 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 12:19:00,287 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-02 12:19:00,287 INFO L87 Difference]: Start difference. First operand 28503 states and 90973 transitions. Second operand 5 states. [2018-12-02 12:19:00,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:19:00,390 INFO L93 Difference]: Finished difference Result 40763 states and 130535 transitions. [2018-12-02 12:19:00,390 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 12:19:00,390 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 121 [2018-12-02 12:19:00,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 12:19:00,441 INFO L225 Difference]: With dead ends: 40763 [2018-12-02 12:19:00,441 INFO L226 Difference]: Without dead ends: 40763 [2018-12-02 12:19:00,441 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-12-02 12:19:00,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40763 states. [2018-12-02 12:19:00,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40763 to 28503. [2018-12-02 12:19:00,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28503 states. [2018-12-02 12:19:00,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28503 states to 28503 states and 89608 transitions. [2018-12-02 12:19:00,829 INFO L78 Accepts]: Start accepts. Automaton has 28503 states and 89608 transitions. Word has length 121 [2018-12-02 12:19:00,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 12:19:00,829 INFO L480 AbstractCegarLoop]: Abstraction has 28503 states and 89608 transitions. [2018-12-02 12:19:00,829 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 12:19:00,829 INFO L276 IsEmpty]: Start isEmpty. Operand 28503 states and 89608 transitions. [2018-12-02 12:19:00,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-12-02 12:19:00,856 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 12:19:00,856 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, 1, 1, 1, 1, 1, 1, 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-02 12:19:00,856 INFO L423 AbstractCegarLoop]: === Iteration 28 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 12:19:00,856 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:19:00,856 INFO L82 PathProgramCache]: Analyzing trace with hash -1197066810, now seen corresponding path program 1 times [2018-12-02 12:19:00,856 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 12:19:00,857 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:19:00,857 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:19:00,857 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:19:00,857 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 12:19:00,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:19:00,929 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-02 12:19:00,929 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 12:19:00,929 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-02 12:19:00,929 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 12:19:00,930 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-02 12:19:00,930 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-02 12:19:00,930 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-12-02 12:19:00,930 INFO L87 Difference]: Start difference. First operand 28503 states and 89608 transitions. Second operand 9 states. [2018-12-02 12:19:01,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:19:01,176 INFO L93 Difference]: Finished difference Result 40823 states and 131148 transitions. [2018-12-02 12:19:01,176 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-02 12:19:01,177 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 121 [2018-12-02 12:19:01,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 12:19:01,196 INFO L225 Difference]: With dead ends: 40823 [2018-12-02 12:19:01,196 INFO L226 Difference]: Without dead ends: 16447 [2018-12-02 12:19:01,196 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=79, Invalid=161, Unknown=0, NotChecked=0, Total=240 [2018-12-02 12:19:01,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16447 states. [2018-12-02 12:19:01,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16447 to 16447. [2018-12-02 12:19:01,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16447 states. [2018-12-02 12:19:01,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16447 states to 16447 states and 51504 transitions. [2018-12-02 12:19:01,364 INFO L78 Accepts]: Start accepts. Automaton has 16447 states and 51504 transitions. Word has length 121 [2018-12-02 12:19:01,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 12:19:01,364 INFO L480 AbstractCegarLoop]: Abstraction has 16447 states and 51504 transitions. [2018-12-02 12:19:01,364 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-02 12:19:01,364 INFO L276 IsEmpty]: Start isEmpty. Operand 16447 states and 51504 transitions. [2018-12-02 12:19:01,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-12-02 12:19:01,377 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 12:19:01,377 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, 1, 1, 1, 1, 1, 1, 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-02 12:19:01,377 INFO L423 AbstractCegarLoop]: === Iteration 29 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 12:19:01,377 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:19:01,378 INFO L82 PathProgramCache]: Analyzing trace with hash -1130206968, now seen corresponding path program 2 times [2018-12-02 12:19:01,378 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 12:19:01,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:19:01,379 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:19:01,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:19:01,379 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 12:19:01,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:19:01,449 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-02 12:19:01,449 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 12:19:01,449 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-02 12:19:01,449 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 12:19:01,450 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-02 12:19:01,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-02 12:19:01,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-12-02 12:19:01,450 INFO L87 Difference]: Start difference. First operand 16447 states and 51504 transitions. Second operand 8 states. [2018-12-02 12:19:01,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:19:01,650 INFO L93 Difference]: Finished difference Result 31921 states and 102945 transitions. [2018-12-02 12:19:01,650 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-02 12:19:01,650 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 121 [2018-12-02 12:19:01,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 12:19:01,664 INFO L225 Difference]: With dead ends: 31921 [2018-12-02 12:19:01,664 INFO L226 Difference]: Without dead ends: 11692 [2018-12-02 12:19:01,665 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2018-12-02 12:19:01,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11692 states. [2018-12-02 12:19:01,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11692 to 11692. [2018-12-02 12:19:01,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11692 states. [2018-12-02 12:19:01,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11692 states to 11692 states and 39565 transitions. [2018-12-02 12:19:01,785 INFO L78 Accepts]: Start accepts. Automaton has 11692 states and 39565 transitions. Word has length 121 [2018-12-02 12:19:01,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 12:19:01,785 INFO L480 AbstractCegarLoop]: Abstraction has 11692 states and 39565 transitions. [2018-12-02 12:19:01,785 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-02 12:19:01,785 INFO L276 IsEmpty]: Start isEmpty. Operand 11692 states and 39565 transitions. [2018-12-02 12:19:01,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-12-02 12:19:01,795 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 12:19:01,795 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, 1, 1, 1, 1, 1, 1, 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-02 12:19:01,795 INFO L423 AbstractCegarLoop]: === Iteration 30 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 12:19:01,795 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:19:01,795 INFO L82 PathProgramCache]: Analyzing trace with hash -608268126, now seen corresponding path program 3 times [2018-12-02 12:19:01,795 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 12:19:01,796 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:19:01,796 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 12:19:01,796 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:19:01,796 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 12:19:01,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 12:19:01,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 12:19:01,841 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-02 12:19:01,921 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-12-02 12:19:01,921 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.12 12:19:01 BasicIcfg [2018-12-02 12:19:01,922 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-02 12:19:01,922 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-02 12:19:01,922 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-02 12:19:01,922 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-02 12:19:01,922 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 12:14:39" (3/4) ... [2018-12-02 12:19:01,924 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-02 12:19:02,008 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_c272161b-a0ab-4a78-b61b-199b106198ef/bin-2019/utaipan/witness.graphml [2018-12-02 12:19:02,008 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-02 12:19:02,009 INFO L168 Benchmark]: Toolchain (without parser) took 263666.68 ms. Allocated memory was 1.0 GB in the beginning and 10.2 GB in the end (delta: 9.2 GB). Free memory was 953.5 MB in the beginning and 4.9 GB in the end (delta: -3.9 GB). Peak memory consumption was 5.3 GB. Max. memory is 11.5 GB. [2018-12-02 12:19:02,010 INFO L168 Benchmark]: CDTParser took 0.16 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-02 12:19:02,010 INFO L168 Benchmark]: CACSL2BoogieTranslator took 356.33 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 144.7 MB). Free memory was 953.5 MB in the beginning and 1.1 GB in the end (delta: -167.9 MB). Peak memory consumption was 37.2 MB. Max. memory is 11.5 GB. [2018-12-02 12:19:02,010 INFO L168 Benchmark]: Boogie Procedure Inliner took 38.10 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: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2018-12-02 12:19:02,010 INFO L168 Benchmark]: Boogie Preprocessor took 26.59 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-02 12:19:02,010 INFO L168 Benchmark]: RCFGBuilder took 450.47 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: 63.8 MB). Peak memory consumption was 63.8 MB. Max. memory is 11.5 GB. [2018-12-02 12:19:02,011 INFO L168 Benchmark]: TraceAbstraction took 262705.87 ms. Allocated memory was 1.2 GB in the beginning and 10.2 GB in the end (delta: 9.0 GB). Free memory was 1.0 GB in the beginning and 4.9 GB in the end (delta: -3.9 GB). Peak memory consumption was 5.1 GB. Max. memory is 11.5 GB. [2018-12-02 12:19:02,011 INFO L168 Benchmark]: Witness Printer took 86.20 ms. Allocated memory is still 10.2 GB. Free memory was 4.9 GB in the beginning and 4.9 GB in the end (delta: 59.1 MB). Peak memory consumption was 59.1 MB. Max. memory is 11.5 GB. [2018-12-02 12:19:02,012 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.16 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 356.33 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 144.7 MB). Free memory was 953.5 MB in the beginning and 1.1 GB in the end (delta: -167.9 MB). Peak memory consumption was 37.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 38.10 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: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 26.59 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 450.47 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: 63.8 MB). Peak memory consumption was 63.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 262705.87 ms. Allocated memory was 1.2 GB in the beginning and 10.2 GB in the end (delta: 9.0 GB). Free memory was 1.0 GB in the beginning and 4.9 GB in the end (delta: -3.9 GB). Peak memory consumption was 5.1 GB. Max. memory is 11.5 GB. * Witness Printer took 86.20 ms. Allocated memory is still 10.2 GB. Free memory was 4.9 GB in the beginning and 4.9 GB in the end (delta: 59.1 MB). Peak memory consumption was 59.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_p2_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0] [L676] -1 int __unbuffered_p2_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0] [L677] -1 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0] [L678] -1 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L680] -1 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L682] -1 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L683] -1 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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_p2_EAX=0, __unbuffered_p2_EBX=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_p2_EAX=0, __unbuffered_p2_EBX=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_p2_EAX=0, __unbuffered_p2_EBX=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_p2_EAX=0, __unbuffered_p2_EBX=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_p2_EAX=0, __unbuffered_p2_EBX=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_p2_EAX=0, __unbuffered_p2_EBX=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_p2_EAX=0, __unbuffered_p2_EBX=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_p2_EAX=0, __unbuffered_p2_EBX=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_p2_EAX=0, __unbuffered_p2_EBX=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_p2_EAX=0, __unbuffered_p2_EBX=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_p2_EAX=0, __unbuffered_p2_EBX=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_p2_EAX=0, __unbuffered_p2_EBX=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_p2_EAX=0, __unbuffered_p2_EBX=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_p2_EAX=0, __unbuffered_p2_EBX=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_p2_EAX=0, __unbuffered_p2_EBX=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_p2_EAX=0, __unbuffered_p2_EBX=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_p2_EAX=0, __unbuffered_p2_EBX=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_p2_EAX=0, __unbuffered_p2_EBX=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 t768; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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(&t768, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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] [L796] -1 pthread_t t769; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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] [L797] FCALL, FORK -1 pthread_create(&t769, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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] [L798] -1 pthread_t t770; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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] [L799] FCALL, FORK -1 pthread_create(&t770, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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] [L741] 0 y$w_buff1 = y$w_buff0 [L742] 0 y$w_buff0 = 2 [L743] 0 y$w_buff1_used = y$w_buff0_used [L744] 0 y$w_buff0_used = (_Bool)1 [L4] COND FALSE 0 !(!expression) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L746] 0 y$r_buff1_thd0 = y$r_buff0_thd0 [L747] 0 y$r_buff1_thd1 = y$r_buff0_thd1 [L748] 0 y$r_buff1_thd2 = y$r_buff0_thd2 [L749] 0 y$r_buff1_thd3 = y$r_buff0_thd3 [L750] 0 y$r_buff0_thd3 = (_Bool)1 [L753] 0 weak$$choice0 = __VERIFIER_nondet_pointer() [L754] 0 weak$$choice2 = __VERIFIER_nondet_pointer() [L755] 0 y$flush_delayed = weak$$choice2 [L756] 0 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=0, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L757] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=0, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L757] EXPR 0 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=0, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L757] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=0, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L757] 0 y = !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L758] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=0, y=2, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L758] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) [L759] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=0, y=2, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L759] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) [L760] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=0, y=2, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L760] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) [L761] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=0, y=2, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L761] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L762] EXPR 0 weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=0, y=2, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L762] 0 y$r_buff0_thd3 = weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3)) [L763] EXPR 0 weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=0, y=2, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L763] 0 y$r_buff1_thd3 = weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L764] 0 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=0, y=2, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L765] EXPR 0 y$flush_delayed ? y$mem_tmp : y VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=0, y=2, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L765] 0 y = y$flush_delayed ? y$mem_tmp : y [L766] 0 y$flush_delayed = (_Bool)0 [L769] 0 __unbuffered_p2_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L772] 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=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L706] 1 z = 1 [L709] 1 x = 1 [L714] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L721] 2 x = 2 [L724] 2 y = 1 VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L727] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L727] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y=1, z=1] [L727] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, 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=2, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y)=1, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y=1, z=1] [L727] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L728] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, 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=2, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L728] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L729] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, 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=2, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L729] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L730] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, 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=2, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L730] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L731] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, 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=2, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L731] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L734] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L772] 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) [L773] EXPR 0 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=2, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=2, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L773] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L774] 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_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=2, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L774] 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 [L775] EXPR 0 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 VAL [__unbuffered_cnt=2, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=2, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L775] 0 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L776] 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_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=2, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L776] 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 [L779] 0 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=2, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L801] -1 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=2, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L805] 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_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=2, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L805] EXPR -1 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=2, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L805] 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_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=2, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L805] -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) [L806] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=2, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L806] -1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L807] 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_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=2, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L807] -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 [L808] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=2, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L808] -1 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L809] 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_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=2, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L809] -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 [L812] -1 weak$$choice0 = __VERIFIER_nondet_pointer() [L813] -1 weak$$choice2 = __VERIFIER_nondet_pointer() [L814] -1 y$flush_delayed = weak$$choice2 [L815] -1 y$mem_tmp = y VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L816] EXPR -1 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L816] -1 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L817] EXPR -1 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L817] -1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L818] EXPR -1 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L818] -1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L819] EXPR -1 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L819] -1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L820] EXPR -1 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L820] -1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L821] EXPR -1 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L821] -1 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L822] EXPR -1 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L822] -1 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L823] -1 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 2 && __unbuffered_p2_EBX == 0) VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L824] EXPR -1 y$flush_delayed ? y$mem_tmp : y VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L824] -1 y = y$flush_delayed ? y$mem_tmp : y [L825] -1 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L4] COND TRUE -1 !expression VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L4] -1 __VERIFIER_error() VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 7 procedures, 283 locations, 3 error locations. UNSAFE Result, 262.6s OverallTime, 30 OverallIterations, 1 TraceHistogramMax, 49.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 9089 SDtfs, 10102 SDslu, 19608 SDs, 0 SdLazy, 5488 SolverSat, 395 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 247 GetRequests, 69 SyntacticMatches, 27 SemanticMatches, 151 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=549408occurred in iteration=2, 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: 108.7s AutomataMinimizationTime, 29 MinimizatonAttempts, 844413 StatesRemovedByMinimization, 23 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 3160 NumberOfCodeBlocks, 3160 NumberOfCodeBlocksAsserted, 30 NumberOfCheckSat, 3010 ConstructedInterpolants, 0 QuantifiedInterpolants, 782436 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 29 InterpolantComputations, 29 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...