./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_369b9ab9-f557-4e5f-8183-d977194a4bb6/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_369b9ab9-f557-4e5f-8183-d977194a4bb6/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_369b9ab9-f557-4e5f-8183-d977194a4bb6/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_369b9ab9-f557-4e5f-8183-d977194a4bb6/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix028_tso.opt_false-unreach-call.i -s /tmp/vcloud-vcloud-master/worker/working_dir_369b9ab9-f557-4e5f-8183-d977194a4bb6/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_369b9ab9-f557-4e5f-8183-d977194a4bb6/bin-2019/uautomizer --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 Automizer --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 03:04:17,726 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-02 03:04:17,727 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-02 03:04:17,733 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-02 03:04:17,733 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-02 03:04:17,734 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-02 03:04:17,735 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-02 03:04:17,735 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-02 03:04:17,736 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-02 03:04:17,737 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-02 03:04:17,737 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-02 03:04:17,737 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-02 03:04:17,738 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-02 03:04:17,738 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-02 03:04:17,739 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-02 03:04:17,739 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-02 03:04:17,739 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-02 03:04:17,740 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-02 03:04:17,741 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-02 03:04:17,742 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-02 03:04:17,742 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-02 03:04:17,743 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-02 03:04:17,744 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-02 03:04:17,744 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-02 03:04:17,744 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-02 03:04:17,745 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-02 03:04:17,745 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-02 03:04:17,746 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-02 03:04:17,746 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-02 03:04:17,747 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-02 03:04:17,747 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-02 03:04:17,747 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-02 03:04:17,747 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-02 03:04:17,747 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-02 03:04:17,748 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-02 03:04:17,748 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-02 03:04:17,748 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_369b9ab9-f557-4e5f-8183-d977194a4bb6/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-12-02 03:04:17,755 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-02 03:04:17,755 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-02 03:04:17,756 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-02 03:04:17,756 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-02 03:04:17,756 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-02 03:04:17,756 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-02 03:04:17,756 INFO L133 SettingsManager]: * Use SBE=true [2018-12-02 03:04:17,757 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-02 03:04:17,757 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-02 03:04:17,757 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-02 03:04:17,757 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-02 03:04:17,757 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-02 03:04:17,757 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-02 03:04:17,757 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-02 03:04:17,757 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-02 03:04:17,757 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-02 03:04:17,757 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-02 03:04:17,758 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-02 03:04:17,758 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-02 03:04:17,758 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-02 03:04:17,758 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-02 03:04:17,758 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-02 03:04:17,758 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-02 03:04:17,758 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-02 03:04:17,758 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-02 03:04:17,758 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-02 03:04:17,758 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-02 03:04:17,758 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-02 03:04:17,759 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-02 03:04:17,759 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-02 03:04:17,759 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true 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_369b9ab9-f557-4e5f-8183-d977194a4bb6/bin-2019/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> bdc38a1b791b964a5d3ebef146a28040d23c9f7b [2018-12-02 03:04:17,776 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-02 03:04:17,783 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-02 03:04:17,785 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-02 03:04:17,786 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-02 03:04:17,786 INFO L276 PluginConnector]: CDTParser initialized [2018-12-02 03:04:17,786 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_369b9ab9-f557-4e5f-8183-d977194a4bb6/bin-2019/uautomizer/../../sv-benchmarks/c/pthread-wmm/mix028_tso.opt_false-unreach-call.i [2018-12-02 03:04:17,820 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_369b9ab9-f557-4e5f-8183-d977194a4bb6/bin-2019/uautomizer/data/f028e805d/caf993952bce47c0afaa3ffc9f28f578/FLAG1bea919b6 [2018-12-02 03:04:18,279 INFO L307 CDTParser]: Found 1 translation units. [2018-12-02 03:04:18,279 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_369b9ab9-f557-4e5f-8183-d977194a4bb6/sv-benchmarks/c/pthread-wmm/mix028_tso.opt_false-unreach-call.i [2018-12-02 03:04:18,286 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_369b9ab9-f557-4e5f-8183-d977194a4bb6/bin-2019/uautomizer/data/f028e805d/caf993952bce47c0afaa3ffc9f28f578/FLAG1bea919b6 [2018-12-02 03:04:18,295 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_369b9ab9-f557-4e5f-8183-d977194a4bb6/bin-2019/uautomizer/data/f028e805d/caf993952bce47c0afaa3ffc9f28f578 [2018-12-02 03:04:18,297 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-02 03:04:18,297 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-02 03:04:18,298 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-02 03:04:18,298 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-02 03:04:18,300 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-02 03:04:18,300 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 03:04:18" (1/1) ... [2018-12-02 03:04:18,302 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 03:04:18, skipping insertion in model container [2018-12-02 03:04:18,302 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 03:04:18" (1/1) ... [2018-12-02 03:04:18,306 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-02 03:04:18,333 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-02 03:04:18,533 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 03:04:18,540 INFO L191 MainTranslator]: Completed pre-run [2018-12-02 03:04:18,618 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 03:04:18,649 INFO L195 MainTranslator]: Completed translation [2018-12-02 03:04:18,649 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:04:18 WrapperNode [2018-12-02 03:04:18,649 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-02 03:04:18,650 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-02 03:04:18,650 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-02 03:04:18,650 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-02 03:04:18,655 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:04:18" (1/1) ... [2018-12-02 03:04:18,667 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:04:18" (1/1) ... [2018-12-02 03:04:18,686 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-02 03:04:18,686 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-02 03:04:18,686 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-02 03:04:18,686 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-02 03:04:18,692 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:04:18" (1/1) ... [2018-12-02 03:04:18,692 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:04:18" (1/1) ... [2018-12-02 03:04:18,694 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:04:18" (1/1) ... [2018-12-02 03:04:18,695 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:04:18" (1/1) ... [2018-12-02 03:04:18,701 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:04:18" (1/1) ... [2018-12-02 03:04:18,703 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:04:18" (1/1) ... [2018-12-02 03:04:18,705 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:04:18" (1/1) ... [2018-12-02 03:04:18,708 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-02 03:04:18,708 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-02 03:04:18,708 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-02 03:04:18,708 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-02 03:04:18,709 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:04:18" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_369b9ab9-f557-4e5f-8183-d977194a4bb6/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-02 03:04:18,742 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-02 03:04:18,742 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-02 03:04:18,742 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2018-12-02 03:04:18,743 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-02 03:04:18,743 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2018-12-02 03:04:18,743 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2018-12-02 03:04:18,743 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2018-12-02 03:04:18,743 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2018-12-02 03:04:18,743 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2018-12-02 03:04:18,743 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2018-12-02 03:04:18,743 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2018-12-02 03:04:18,743 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-02 03:04:18,743 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-02 03:04:18,744 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 03:04:19,154 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-02 03:04:19,154 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-12-02 03:04:19,155 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 03:04:19 BoogieIcfgContainer [2018-12-02 03:04:19,155 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-02 03:04:19,155 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-02 03:04:19,155 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-02 03:04:19,157 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-02 03:04:19,157 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 03:04:18" (1/3) ... [2018-12-02 03:04:19,158 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 03:04:19, skipping insertion in model container [2018-12-02 03:04:19,158 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:04:18" (2/3) ... [2018-12-02 03:04:19,158 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 03:04:19, skipping insertion in model container [2018-12-02 03:04:19,158 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 03:04:19" (3/3) ... [2018-12-02 03:04:19,159 INFO L112 eAbstractionObserver]: Analyzing ICFG mix028_tso.opt_false-unreach-call.i [2018-12-02 03:04:19,184 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:04:19,185 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:04:19,185 WARN L317 ript$VariableManager]: TermVariabe Thread2_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:04:19,185 WARN L317 ript$VariableManager]: TermVariabe Thread2_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:04:19,185 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P0_#t~nondet3.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:04:19,185 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P0_#t~nondet3.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:04:19,185 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:04:19,185 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:04:19,185 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P0_#t~nondet3.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:04:19,186 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P0_#t~nondet3.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:04:19,186 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:04:19,186 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:04:19,186 WARN L317 ript$VariableManager]: TermVariabe Thread0_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:04:19,186 WARN L317 ript$VariableManager]: TermVariabe Thread0_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:04:19,186 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:04:19,186 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:04:19,186 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:04:19,187 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:04:19,187 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:04:19,187 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:04:19,187 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:04:19,187 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:04:19,187 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:04:19,187 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:04:19,187 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:04:19,187 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:04:19,188 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:04:19,188 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:04:19,188 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:04:19,188 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:04:19,188 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:04:19,188 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:04:19,188 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:04:19,188 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:04:19,188 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:04:19,189 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:04:19,189 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:04:19,189 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:04:19,189 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet10.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:04:19,189 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet10.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:04:19,189 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:04:19,189 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:04:19,190 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet10.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:04:19,190 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet10.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:04:19,190 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:04:19,190 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:04:19,190 WARN L317 ript$VariableManager]: TermVariabe Thread1_P2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:04:19,190 WARN L317 ript$VariableManager]: TermVariabe Thread1_P2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:04:19,191 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:04:19,191 WARN L317 ript$VariableManager]: TermVariabe Thread1_P2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:04:19,191 WARN L317 ript$VariableManager]: TermVariabe Thread1_P2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:04:19,191 WARN L317 ript$VariableManager]: TermVariabe Thread1_P2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:04:19,191 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~nondet12.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:04:19,191 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~nondet11.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:04:19,191 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~nondet12.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:04:19,191 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~nondet11.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:04:19,191 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~nondet12.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:04:19,191 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~nondet12.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:04:19,192 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~nondet11.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:04:19,192 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~nondet11.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:04:19,192 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:04:19,192 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:04:19,192 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:04:19,192 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:04:19,192 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:04:19,192 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:04:19,192 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:04:19,192 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:04:19,192 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:04:19,193 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:04:19,193 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:04:19,193 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:04:19,193 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:04:19,193 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:04:19,193 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:04:19,193 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:04:19,193 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:04:19,193 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:04:19,193 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:04:19,193 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:04:19,193 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:04:19,194 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:04:19,194 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:04:19,194 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:04:19,194 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:04:19,194 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:04:19,194 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:04:19,194 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:04:19,194 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:04:19,194 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:04:19,194 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:04:19,194 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:04:19,195 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:04:19,195 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:04:19,195 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:04:19,195 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:04:19,195 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:04:19,195 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:04:19,195 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:04:19,195 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:04:19,195 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:04:19,195 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:04:19,195 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:04:19,195 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:04:19,196 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:04:19,196 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:04:19,196 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:04:19,196 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:04:19,196 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:04:19,196 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:04:19,196 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:04:19,196 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:04:19,196 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:04:19,196 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:04:19,196 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:04:19,196 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:04:19,197 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:04:19,197 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:04:19,197 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:04:19,197 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:04:19,197 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:04:19,197 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:04:19,197 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:04:19,197 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:04:19,197 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:04:19,197 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:04:19,197 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:04:19,198 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:04:19,198 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:04:19,198 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:04:19,198 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:04:19,198 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:04:19,198 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:04:19,198 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:04:19,198 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:04:19,198 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:04:19,199 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:04:19,199 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:04:19,199 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:04:19,199 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:04:19,199 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:04:19,199 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:04:19,199 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:04:19,199 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:04:19,199 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:04:19,199 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:04:19,199 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:04:19,199 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:04:19,200 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:04:19,200 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:04:19,200 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:04:19,200 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:04:19,200 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:04:19,200 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:04:19,200 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:04:19,200 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:04:19,200 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:04:19,200 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:04:19,200 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:04:19,200 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:04:19,201 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:04:19,201 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:04:19,201 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:04:19,201 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:04:19,201 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:04:19,201 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:04:19,201 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:04:19,201 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:04:19,201 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~nondet40.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:04:19,201 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~nondet40.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:04:19,201 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:04:19,201 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:04:19,202 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~nondet40.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:04:19,202 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~nondet40.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:04:19,210 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2018-12-02 03:04:19,210 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-02 03:04:19,215 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-12-02 03:04:19,224 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2018-12-02 03:04:19,239 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-02 03:04:19,240 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-02 03:04:19,240 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-02 03:04:19,240 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-02 03:04:19,240 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-02 03:04:19,240 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-02 03:04:19,240 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-02 03:04:19,240 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-02 03:04:19,240 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-02 03:04:19,247 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 198places, 256 transitions [2018-12-02 03:05:57,832 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 385953 states. [2018-12-02 03:05:57,833 INFO L276 IsEmpty]: Start isEmpty. Operand 385953 states. [2018-12-02 03:05:57,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-12-02 03:05:57,840 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 03:05:57,841 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 03:05:57,842 INFO L423 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 03:05:57,845 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:05:57,846 INFO L82 PathProgramCache]: Analyzing trace with hash 654477059, now seen corresponding path program 1 times [2018-12-02 03:05:57,847 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 03:05:57,847 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 03:05:57,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:05:57,882 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 03:05:57,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:05:57,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:05:57,992 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 03:05:57,994 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 03:05:57,994 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 03:05:57,996 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 03:05:58,004 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 03:05:58,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 03:05:58,006 INFO L87 Difference]: Start difference. First operand 385953 states. Second operand 4 states. [2018-12-02 03:06:04,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 03:06:04,730 INFO L93 Difference]: Finished difference Result 735793 states and 3585691 transitions. [2018-12-02 03:06:04,730 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 03:06:04,731 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 44 [2018-12-02 03:06:04,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 03:06:06,642 INFO L225 Difference]: With dead ends: 735793 [2018-12-02 03:06:06,642 INFO L226 Difference]: Without dead ends: 634643 [2018-12-02 03:06:06,643 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 03:06:21,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 634643 states. [2018-12-02 03:06:28,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 634643 to 340233. [2018-12-02 03:06:28,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 340233 states. [2018-12-02 03:06:35,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340233 states to 340233 states and 1669458 transitions. [2018-12-02 03:06:35,847 INFO L78 Accepts]: Start accepts. Automaton has 340233 states and 1669458 transitions. Word has length 44 [2018-12-02 03:06:35,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 03:06:35,848 INFO L480 AbstractCegarLoop]: Abstraction has 340233 states and 1669458 transitions. [2018-12-02 03:06:35,848 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 03:06:35,848 INFO L276 IsEmpty]: Start isEmpty. Operand 340233 states and 1669458 transitions. [2018-12-02 03:06:35,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-12-02 03:06:35,857 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 03:06:35,857 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 03:06:35,857 INFO L423 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 03:06:35,857 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:06:35,857 INFO L82 PathProgramCache]: Analyzing trace with hash -837598066, now seen corresponding path program 1 times [2018-12-02 03:06:35,858 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 03:06:35,858 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 03:06:35,862 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:06:35,862 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 03:06:35,862 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:06:35,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:06:35,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 03:06:35,921 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 03:06:35,921 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 03:06:35,922 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 03:06:35,922 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 03:06:35,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 03:06:35,923 INFO L87 Difference]: Start difference. First operand 340233 states and 1669458 transitions. Second operand 5 states. [2018-12-02 03:06:48,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 03:06:48,833 INFO L93 Difference]: Finished difference Result 1007353 states and 4689304 transitions. [2018-12-02 03:06:48,834 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 03:06:48,834 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 51 [2018-12-02 03:06:48,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 03:06:52,011 INFO L225 Difference]: With dead ends: 1007353 [2018-12-02 03:06:52,011 INFO L226 Difference]: Without dead ends: 1006353 [2018-12-02 03:06:52,012 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 03:07:03,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1006353 states. [2018-12-02 03:07:13,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1006353 to 549408. [2018-12-02 03:07:13,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 549408 states. [2018-12-02 03:07:15,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 549408 states to 549408 states and 2556398 transitions. [2018-12-02 03:07:15,833 INFO L78 Accepts]: Start accepts. Automaton has 549408 states and 2556398 transitions. Word has length 51 [2018-12-02 03:07:15,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 03:07:15,833 INFO L480 AbstractCegarLoop]: Abstraction has 549408 states and 2556398 transitions. [2018-12-02 03:07:15,833 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 03:07:15,833 INFO L276 IsEmpty]: Start isEmpty. Operand 549408 states and 2556398 transitions. [2018-12-02 03:07:15,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-12-02 03:07:15,840 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 03:07:15,840 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 03:07:15,840 INFO L423 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 03:07:15,840 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:07:15,840 INFO L82 PathProgramCache]: Analyzing trace with hash -988308488, now seen corresponding path program 1 times [2018-12-02 03:07:15,840 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 03:07:15,841 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 03:07:15,843 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:07:15,843 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 03:07:15,843 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:07:15,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:07:15,882 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 03:07:15,882 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 03:07:15,883 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 03:07:15,883 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 03:07:15,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 03:07:15,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 03:07:15,883 INFO L87 Difference]: Start difference. First operand 549408 states and 2556398 transitions. Second operand 3 states. [2018-12-02 03:07:23,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 03:07:23,496 INFO L93 Difference]: Finished difference Result 549408 states and 2556033 transitions. [2018-12-02 03:07:23,496 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 03:07:23,496 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2018-12-02 03:07:23,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 03:07:25,019 INFO L225 Difference]: With dead ends: 549408 [2018-12-02 03:07:25,019 INFO L226 Difference]: Without dead ends: 549408 [2018-12-02 03:07:25,019 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 03:07:34,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 549408 states. [2018-12-02 03:07:40,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 549408 to 549408. [2018-12-02 03:07:40,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 549408 states. [2018-12-02 03:07:53,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 549408 states to 549408 states and 2556033 transitions. [2018-12-02 03:07:53,759 INFO L78 Accepts]: Start accepts. Automaton has 549408 states and 2556033 transitions. Word has length 52 [2018-12-02 03:07:53,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 03:07:53,759 INFO L480 AbstractCegarLoop]: Abstraction has 549408 states and 2556033 transitions. [2018-12-02 03:07:53,759 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 03:07:53,759 INFO L276 IsEmpty]: Start isEmpty. Operand 549408 states and 2556033 transitions. [2018-12-02 03:07:53,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-12-02 03:07:53,764 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 03:07:53,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] [2018-12-02 03:07:53,765 INFO L423 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 03:07:53,765 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:07:53,765 INFO L82 PathProgramCache]: Analyzing trace with hash 754501847, now seen corresponding path program 1 times [2018-12-02 03:07:53,765 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 03:07:53,765 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 03:07:53,766 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:07:53,767 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 03:07:53,767 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:07:53,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:07:53,806 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 03:07:53,807 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 03:07:53,807 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 03:07:53,807 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 03:07:53,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 03:07:53,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 03:07:53,807 INFO L87 Difference]: Start difference. First operand 549408 states and 2556033 transitions. Second operand 4 states. [2018-12-02 03:08:01,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 03:08:01,072 INFO L93 Difference]: Finished difference Result 472455 states and 2161069 transitions. [2018-12-02 03:08:01,073 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 03:08:01,073 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 52 [2018-12-02 03:08:01,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 03:08:02,414 INFO L225 Difference]: With dead ends: 472455 [2018-12-02 03:08:02,414 INFO L226 Difference]: Without dead ends: 463970 [2018-12-02 03:08:02,414 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 03:08:09,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 463970 states. [2018-12-02 03:08:15,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 463970 to 463970. [2018-12-02 03:08:15,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 463970 states. [2018-12-02 03:08:17,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 463970 states to 463970 states and 2131578 transitions. [2018-12-02 03:08:17,100 INFO L78 Accepts]: Start accepts. Automaton has 463970 states and 2131578 transitions. Word has length 52 [2018-12-02 03:08:17,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 03:08:17,101 INFO L480 AbstractCegarLoop]: Abstraction has 463970 states and 2131578 transitions. [2018-12-02 03:08:17,101 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 03:08:17,101 INFO L276 IsEmpty]: Start isEmpty. Operand 463970 states and 2131578 transitions. [2018-12-02 03:08:17,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-12-02 03:08:17,106 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 03:08:17,106 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 03:08:17,106 INFO L423 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 03:08:17,106 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:08:17,106 INFO L82 PathProgramCache]: Analyzing trace with hash -1302071129, now seen corresponding path program 1 times [2018-12-02 03:08:17,106 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 03:08:17,106 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 03:08:17,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:08:17,108 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 03:08:17,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:08:17,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:08:17,144 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 03:08:17,144 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 03:08:17,145 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 03:08:17,145 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 03:08:17,145 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 03:08:17,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-02 03:08:17,145 INFO L87 Difference]: Start difference. First operand 463970 states and 2131578 transitions. Second operand 5 states. [2018-12-02 03:08:18,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 03:08:18,093 INFO L93 Difference]: Finished difference Result 107974 states and 450057 transitions. [2018-12-02 03:08:18,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 03:08:18,094 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 53 [2018-12-02 03:08:18,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 03:08:18,309 INFO L225 Difference]: With dead ends: 107974 [2018-12-02 03:08:18,309 INFO L226 Difference]: Without dead ends: 100622 [2018-12-02 03:08:18,309 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 03:08:18,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100622 states. [2018-12-02 03:08:23,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100622 to 100622. [2018-12-02 03:08:23,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100622 states. [2018-12-02 03:08:23,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100622 states to 100622 states and 420923 transitions. [2018-12-02 03:08:23,996 INFO L78 Accepts]: Start accepts. Automaton has 100622 states and 420923 transitions. Word has length 53 [2018-12-02 03:08:23,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 03:08:23,997 INFO L480 AbstractCegarLoop]: Abstraction has 100622 states and 420923 transitions. [2018-12-02 03:08:23,997 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 03:08:23,997 INFO L276 IsEmpty]: Start isEmpty. Operand 100622 states and 420923 transitions. [2018-12-02 03:08:24,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-12-02 03:08:24,007 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 03:08:24,008 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 03:08:24,008 INFO L423 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 03:08:24,008 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:08:24,008 INFO L82 PathProgramCache]: Analyzing trace with hash -2137995013, now seen corresponding path program 1 times [2018-12-02 03:08:24,008 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 03:08:24,008 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 03:08:24,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:08:24,009 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 03:08:24,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:08:24,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:08:24,066 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 03:08:24,067 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 03:08:24,067 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 03:08:24,067 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 03:08:24,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 03:08:24,067 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-02 03:08:24,067 INFO L87 Difference]: Start difference. First operand 100622 states and 420923 transitions. Second operand 6 states. [2018-12-02 03:08:24,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 03:08:24,140 INFO L93 Difference]: Finished difference Result 15454 states and 53779 transitions. [2018-12-02 03:08:24,141 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 03:08:24,141 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 66 [2018-12-02 03:08:24,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 03:08:24,157 INFO L225 Difference]: With dead ends: 15454 [2018-12-02 03:08:24,157 INFO L226 Difference]: Without dead ends: 13166 [2018-12-02 03:08:24,157 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 03:08:24,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13166 states. [2018-12-02 03:08:24,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13166 to 13026. [2018-12-02 03:08:24,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13026 states. [2018-12-02 03:08:24,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13026 states to 13026 states and 44819 transitions. [2018-12-02 03:08:24,302 INFO L78 Accepts]: Start accepts. Automaton has 13026 states and 44819 transitions. Word has length 66 [2018-12-02 03:08:24,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 03:08:24,302 INFO L480 AbstractCegarLoop]: Abstraction has 13026 states and 44819 transitions. [2018-12-02 03:08:24,302 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 03:08:24,303 INFO L276 IsEmpty]: Start isEmpty. Operand 13026 states and 44819 transitions. [2018-12-02 03:08:24,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-12-02 03:08:24,317 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 03:08:24,317 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 03:08:24,317 INFO L423 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 03:08:24,317 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:08:24,317 INFO L82 PathProgramCache]: Analyzing trace with hash -318649128, now seen corresponding path program 1 times [2018-12-02 03:08:24,318 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 03:08:24,318 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 03:08:24,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:08:24,319 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 03:08:24,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:08:24,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:08:24,383 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 03:08:24,383 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 03:08:24,383 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 03:08:24,383 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 03:08:24,383 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 03:08:24,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-02 03:08:24,383 INFO L87 Difference]: Start difference. First operand 13026 states and 44819 transitions. Second operand 6 states. [2018-12-02 03:08:24,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 03:08:24,905 INFO L93 Difference]: Finished difference Result 18286 states and 62027 transitions. [2018-12-02 03:08:24,905 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 03:08:24,905 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 115 [2018-12-02 03:08:24,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 03:08:24,926 INFO L225 Difference]: With dead ends: 18286 [2018-12-02 03:08:24,926 INFO L226 Difference]: Without dead ends: 18286 [2018-12-02 03:08:24,927 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 03:08:24,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18286 states. [2018-12-02 03:08:25,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18286 to 15541. [2018-12-02 03:08:25,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15541 states. [2018-12-02 03:08:25,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15541 states to 15541 states and 52911 transitions. [2018-12-02 03:08:25,110 INFO L78 Accepts]: Start accepts. Automaton has 15541 states and 52911 transitions. Word has length 115 [2018-12-02 03:08:25,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 03:08:25,110 INFO L480 AbstractCegarLoop]: Abstraction has 15541 states and 52911 transitions. [2018-12-02 03:08:25,110 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 03:08:25,110 INFO L276 IsEmpty]: Start isEmpty. Operand 15541 states and 52911 transitions. [2018-12-02 03:08:25,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-12-02 03:08:25,127 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 03:08:25,127 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 03:08:25,127 INFO L423 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 03:08:25,127 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:08:25,127 INFO L82 PathProgramCache]: Analyzing trace with hash -2024167080, now seen corresponding path program 2 times [2018-12-02 03:08:25,127 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 03:08:25,128 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 03:08:25,129 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:08:25,129 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 03:08:25,129 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:08:25,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:08:25,183 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 03:08:25,183 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 03:08:25,183 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 03:08:25,183 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 03:08:25,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 03:08:25,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 03:08:25,184 INFO L87 Difference]: Start difference. First operand 15541 states and 52911 transitions. Second operand 4 states. [2018-12-02 03:08:25,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 03:08:25,430 INFO L93 Difference]: Finished difference Result 22773 states and 75756 transitions. [2018-12-02 03:08:25,430 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 03:08:25,430 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 115 [2018-12-02 03:08:25,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 03:08:25,455 INFO L225 Difference]: With dead ends: 22773 [2018-12-02 03:08:25,455 INFO L226 Difference]: Without dead ends: 22773 [2018-12-02 03:08:25,456 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 03:08:25,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22773 states. [2018-12-02 03:08:25,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22773 to 17141. [2018-12-02 03:08:25,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17141 states. [2018-12-02 03:08:25,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17141 states to 17141 states and 58476 transitions. [2018-12-02 03:08:25,667 INFO L78 Accepts]: Start accepts. Automaton has 17141 states and 58476 transitions. Word has length 115 [2018-12-02 03:08:25,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 03:08:25,667 INFO L480 AbstractCegarLoop]: Abstraction has 17141 states and 58476 transitions. [2018-12-02 03:08:25,667 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 03:08:25,667 INFO L276 IsEmpty]: Start isEmpty. Operand 17141 states and 58476 transitions. [2018-12-02 03:08:25,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-12-02 03:08:25,685 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 03:08:25,685 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 03:08:25,686 INFO L423 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 03:08:25,686 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:08:25,686 INFO L82 PathProgramCache]: Analyzing trace with hash -1920346881, now seen corresponding path program 1 times [2018-12-02 03:08:25,686 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 03:08:25,686 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 03:08:25,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:08:25,687 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 03:08:25,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:08:25,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:08:25,874 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 03:08:25,875 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 03:08:25,875 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 03:08:25,875 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 03:08:25,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 03:08:25,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-02 03:08:25,876 INFO L87 Difference]: Start difference. First operand 17141 states and 58476 transitions. Second operand 4 states. [2018-12-02 03:08:26,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 03:08:26,002 INFO L93 Difference]: Finished difference Result 18996 states and 64220 transitions. [2018-12-02 03:08:26,002 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 03:08:26,003 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 115 [2018-12-02 03:08:26,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 03:08:26,025 INFO L225 Difference]: With dead ends: 18996 [2018-12-02 03:08:26,025 INFO L226 Difference]: Without dead ends: 18996 [2018-12-02 03:08:26,025 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-02 03:08:26,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18996 states. [2018-12-02 03:08:26,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18996 to 17116. [2018-12-02 03:08:26,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17116 states. [2018-12-02 03:08:26,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17116 states to 17116 states and 58281 transitions. [2018-12-02 03:08:26,226 INFO L78 Accepts]: Start accepts. Automaton has 17116 states and 58281 transitions. Word has length 115 [2018-12-02 03:08:26,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 03:08:26,226 INFO L480 AbstractCegarLoop]: Abstraction has 17116 states and 58281 transitions. [2018-12-02 03:08:26,226 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 03:08:26,226 INFO L276 IsEmpty]: Start isEmpty. Operand 17116 states and 58281 transitions. [2018-12-02 03:08:26,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-12-02 03:08:26,244 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 03:08:26,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:08:26,245 INFO L423 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 03:08:26,245 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:08:26,245 INFO L82 PathProgramCache]: Analyzing trace with hash 1198660703, now seen corresponding path program 1 times [2018-12-02 03:08:26,245 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 03:08:26,245 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 03:08:26,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:08:26,247 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 03:08:26,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:08:26,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:08:26,334 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 03:08:26,334 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 03:08:26,334 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-02 03:08:26,334 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 03:08:26,334 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 03:08:26,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2018-12-02 03:08:26,334 INFO L87 Difference]: Start difference. First operand 17116 states and 58281 transitions. Second operand 7 states. [2018-12-02 03:08:26,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 03:08:26,598 INFO L93 Difference]: Finished difference Result 20071 states and 67655 transitions. [2018-12-02 03:08:26,598 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 03:08:26,598 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 115 [2018-12-02 03:08:26,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 03:08:26,621 INFO L225 Difference]: With dead ends: 20071 [2018-12-02 03:08:26,621 INFO L226 Difference]: Without dead ends: 20071 [2018-12-02 03:08:26,621 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 03:08:26,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20071 states. [2018-12-02 03:08:26,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20071 to 17406. [2018-12-02 03:08:26,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17406 states. [2018-12-02 03:08:26,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17406 states to 17406 states and 59183 transitions. [2018-12-02 03:08:26,820 INFO L78 Accepts]: Start accepts. Automaton has 17406 states and 59183 transitions. Word has length 115 [2018-12-02 03:08:26,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 03:08:26,820 INFO L480 AbstractCegarLoop]: Abstraction has 17406 states and 59183 transitions. [2018-12-02 03:08:26,820 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 03:08:26,821 INFO L276 IsEmpty]: Start isEmpty. Operand 17406 states and 59183 transitions. [2018-12-02 03:08:26,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-12-02 03:08:26,838 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 03:08:26,838 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 03:08:26,838 INFO L423 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 03:08:26,839 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:08:26,839 INFO L82 PathProgramCache]: Analyzing trace with hash -926725991, now seen corresponding path program 1 times [2018-12-02 03:08:26,839 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 03:08:26,839 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 03:08:26,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:08:26,841 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 03:08:26,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:08:26,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:08:26,919 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 03:08:26,919 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 03:08:26,920 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 03:08:26,920 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 03:08:26,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 03:08:26,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-02 03:08:26,920 INFO L87 Difference]: Start difference. First operand 17406 states and 59183 transitions. Second operand 5 states. [2018-12-02 03:08:27,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 03:08:27,069 INFO L93 Difference]: Finished difference Result 13026 states and 43919 transitions. [2018-12-02 03:08:27,070 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 03:08:27,070 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 115 [2018-12-02 03:08:27,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 03:08:27,084 INFO L225 Difference]: With dead ends: 13026 [2018-12-02 03:08:27,084 INFO L226 Difference]: Without dead ends: 13026 [2018-12-02 03:08:27,085 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 03:08:27,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13026 states. [2018-12-02 03:08:27,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13026 to 12966. [2018-12-02 03:08:27,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12966 states. [2018-12-02 03:08:27,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12966 states to 12966 states and 43731 transitions. [2018-12-02 03:08:27,217 INFO L78 Accepts]: Start accepts. Automaton has 12966 states and 43731 transitions. Word has length 115 [2018-12-02 03:08:27,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 03:08:27,217 INFO L480 AbstractCegarLoop]: Abstraction has 12966 states and 43731 transitions. [2018-12-02 03:08:27,217 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 03:08:27,217 INFO L276 IsEmpty]: Start isEmpty. Operand 12966 states and 43731 transitions. [2018-12-02 03:08:27,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2018-12-02 03:08:27,229 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 03:08:27,229 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 03:08:27,229 INFO L423 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 03:08:27,229 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:08:27,229 INFO L82 PathProgramCache]: Analyzing trace with hash 1258133646, now seen corresponding path program 1 times [2018-12-02 03:08:27,229 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 03:08:27,229 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 03:08:27,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:08:27,230 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 03:08:27,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:08:27,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:08:27,278 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 03:08:27,278 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 03:08:27,278 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 03:08:27,278 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 03:08:27,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 03:08:27,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 03:08:27,279 INFO L87 Difference]: Start difference. First operand 12966 states and 43731 transitions. Second operand 4 states. [2018-12-02 03:08:27,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 03:08:27,401 INFO L93 Difference]: Finished difference Result 14404 states and 48287 transitions. [2018-12-02 03:08:27,401 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 03:08:27,401 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 117 [2018-12-02 03:08:27,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 03:08:27,417 INFO L225 Difference]: With dead ends: 14404 [2018-12-02 03:08:27,417 INFO L226 Difference]: Without dead ends: 14404 [2018-12-02 03:08:27,417 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 03:08:27,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14404 states. [2018-12-02 03:08:27,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14404 to 13176. [2018-12-02 03:08:27,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13176 states. [2018-12-02 03:08:27,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13176 states to 13176 states and 44384 transitions. [2018-12-02 03:08:27,565 INFO L78 Accepts]: Start accepts. Automaton has 13176 states and 44384 transitions. Word has length 117 [2018-12-02 03:08:27,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 03:08:27,565 INFO L480 AbstractCegarLoop]: Abstraction has 13176 states and 44384 transitions. [2018-12-02 03:08:27,565 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 03:08:27,566 INFO L276 IsEmpty]: Start isEmpty. Operand 13176 states and 44384 transitions. [2018-12-02 03:08:27,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2018-12-02 03:08:27,579 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 03:08:27,579 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 03:08:27,579 INFO L423 AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 03:08:27,579 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:08:27,579 INFO L82 PathProgramCache]: Analyzing trace with hash -677526641, now seen corresponding path program 1 times [2018-12-02 03:08:27,580 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 03:08:27,580 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 03:08:27,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:08:27,581 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 03:08:27,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:08:27,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:08:27,610 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 03:08:27,611 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 03:08:27,611 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 03:08:27,611 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 03:08:27,611 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 03:08:27,611 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 03:08:27,612 INFO L87 Difference]: Start difference. First operand 13176 states and 44384 transitions. Second operand 3 states. [2018-12-02 03:08:27,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 03:08:27,766 INFO L93 Difference]: Finished difference Result 16646 states and 54935 transitions. [2018-12-02 03:08:27,767 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 03:08:27,767 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 117 [2018-12-02 03:08:27,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 03:08:27,785 INFO L225 Difference]: With dead ends: 16646 [2018-12-02 03:08:27,785 INFO L226 Difference]: Without dead ends: 16646 [2018-12-02 03:08:27,785 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 03:08:27,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16646 states. [2018-12-02 03:08:28,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16646 to 15966. [2018-12-02 03:08:28,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15966 states. [2018-12-02 03:08:28,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15966 states to 15966 states and 52956 transitions. [2018-12-02 03:08:28,053 INFO L78 Accepts]: Start accepts. Automaton has 15966 states and 52956 transitions. Word has length 117 [2018-12-02 03:08:28,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 03:08:28,053 INFO L480 AbstractCegarLoop]: Abstraction has 15966 states and 52956 transitions. [2018-12-02 03:08:28,053 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 03:08:28,053 INFO L276 IsEmpty]: Start isEmpty. Operand 15966 states and 52956 transitions. [2018-12-02 03:08:28,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2018-12-02 03:08:28,066 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 03:08:28,066 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 03:08:28,067 INFO L423 AbstractCegarLoop]: === Iteration 14 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 03:08:28,067 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:08:28,067 INFO L82 PathProgramCache]: Analyzing trace with hash 328366779, now seen corresponding path program 2 times [2018-12-02 03:08:28,067 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 03:08:28,067 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 03:08:28,068 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:08:28,068 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 03:08:28,068 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:08:28,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:08:28,152 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 03:08:28,153 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 03:08:28,153 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 03:08:28,153 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 03:08:28,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 03:08:28,153 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-02 03:08:28,154 INFO L87 Difference]: Start difference. First operand 15966 states and 52956 transitions. Second operand 6 states. [2018-12-02 03:08:28,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 03:08:28,394 INFO L93 Difference]: Finished difference Result 19309 states and 62969 transitions. [2018-12-02 03:08:28,394 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 03:08:28,394 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 117 [2018-12-02 03:08:28,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 03:08:28,414 INFO L225 Difference]: With dead ends: 19309 [2018-12-02 03:08:28,414 INFO L226 Difference]: Without dead ends: 19309 [2018-12-02 03:08:28,415 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 03:08:28,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19309 states. [2018-12-02 03:08:28,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19309 to 14951. [2018-12-02 03:08:28,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14951 states. [2018-12-02 03:08:28,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14951 states to 14951 states and 49114 transitions. [2018-12-02 03:08:28,593 INFO L78 Accepts]: Start accepts. Automaton has 14951 states and 49114 transitions. Word has length 117 [2018-12-02 03:08:28,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 03:08:28,593 INFO L480 AbstractCegarLoop]: Abstraction has 14951 states and 49114 transitions. [2018-12-02 03:08:28,593 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 03:08:28,593 INFO L276 IsEmpty]: Start isEmpty. Operand 14951 states and 49114 transitions. [2018-12-02 03:08:28,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-12-02 03:08:28,607 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 03:08:28,607 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 03:08:28,607 INFO L423 AbstractCegarLoop]: === Iteration 15 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 03:08:28,607 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:08:28,607 INFO L82 PathProgramCache]: Analyzing trace with hash -1803487292, now seen corresponding path program 1 times [2018-12-02 03:08:28,607 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 03:08:28,607 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 03:08:28,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:08:28,608 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 03:08:28,609 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:08:28,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:08:28,697 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 03:08:28,697 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 03:08:28,697 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-02 03:08:28,697 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 03:08:28,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 03:08:28,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-12-02 03:08:28,698 INFO L87 Difference]: Start difference. First operand 14951 states and 49114 transitions. Second operand 7 states. [2018-12-02 03:08:28,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 03:08:28,912 INFO L93 Difference]: Finished difference Result 21301 states and 68469 transitions. [2018-12-02 03:08:28,913 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 03:08:28,913 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 119 [2018-12-02 03:08:28,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 03:08:28,935 INFO L225 Difference]: With dead ends: 21301 [2018-12-02 03:08:28,935 INFO L226 Difference]: Without dead ends: 21201 [2018-12-02 03:08:28,935 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 03:08:28,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21201 states. [2018-12-02 03:08:29,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21201 to 16756. [2018-12-02 03:08:29,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16756 states. [2018-12-02 03:08:29,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16756 states to 16756 states and 54648 transitions. [2018-12-02 03:08:29,133 INFO L78 Accepts]: Start accepts. Automaton has 16756 states and 54648 transitions. Word has length 119 [2018-12-02 03:08:29,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 03:08:29,133 INFO L480 AbstractCegarLoop]: Abstraction has 16756 states and 54648 transitions. [2018-12-02 03:08:29,133 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 03:08:29,133 INFO L276 IsEmpty]: Start isEmpty. Operand 16756 states and 54648 transitions. [2018-12-02 03:08:29,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-12-02 03:08:29,147 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 03:08:29,147 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 03:08:29,148 INFO L423 AbstractCegarLoop]: === Iteration 16 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 03:08:29,148 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:08:29,148 INFO L82 PathProgramCache]: Analyzing trace with hash 976677793, now seen corresponding path program 1 times [2018-12-02 03:08:29,148 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 03:08:29,148 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 03:08:29,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:08:29,149 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 03:08:29,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:08:29,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:08:29,218 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 03:08:29,218 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 03:08:29,218 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 03:08:29,218 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 03:08:29,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 03:08:29,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-12-02 03:08:29,218 INFO L87 Difference]: Start difference. First operand 16756 states and 54648 transitions. Second operand 6 states. [2018-12-02 03:08:29,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 03:08:29,508 INFO L93 Difference]: Finished difference Result 30636 states and 98893 transitions. [2018-12-02 03:08:29,508 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 03:08:29,508 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 119 [2018-12-02 03:08:29,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 03:08:29,541 INFO L225 Difference]: With dead ends: 30636 [2018-12-02 03:08:29,541 INFO L226 Difference]: Without dead ends: 30636 [2018-12-02 03:08:29,541 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 03:08:29,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30636 states. [2018-12-02 03:08:29,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30636 to 21090. [2018-12-02 03:08:29,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21090 states. [2018-12-02 03:08:29,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21090 states to 21090 states and 67478 transitions. [2018-12-02 03:08:29,801 INFO L78 Accepts]: Start accepts. Automaton has 21090 states and 67478 transitions. Word has length 119 [2018-12-02 03:08:29,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 03:08:29,801 INFO L480 AbstractCegarLoop]: Abstraction has 21090 states and 67478 transitions. [2018-12-02 03:08:29,801 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 03:08:29,801 INFO L276 IsEmpty]: Start isEmpty. Operand 21090 states and 67478 transitions. [2018-12-02 03:08:29,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-12-02 03:08:29,817 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 03:08:29,818 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 03:08:29,818 INFO L423 AbstractCegarLoop]: === Iteration 17 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 03:08:29,818 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:08:29,818 INFO L82 PathProgramCache]: Analyzing trace with hash -747894305, now seen corresponding path program 1 times [2018-12-02 03:08:29,818 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 03:08:29,818 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 03:08:29,819 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:08:29,819 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 03:08:29,819 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:08:29,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:08:29,866 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 03:08:29,866 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 03:08:29,866 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 03:08:29,866 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 03:08:29,866 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 03:08:29,866 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 03:08:29,867 INFO L87 Difference]: Start difference. First operand 21090 states and 67478 transitions. Second operand 4 states. [2018-12-02 03:08:29,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 03:08:29,992 INFO L93 Difference]: Finished difference Result 22434 states and 72166 transitions. [2018-12-02 03:08:29,993 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 03:08:29,993 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 119 [2018-12-02 03:08:29,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 03:08:30,017 INFO L225 Difference]: With dead ends: 22434 [2018-12-02 03:08:30,017 INFO L226 Difference]: Without dead ends: 22434 [2018-12-02 03:08:30,018 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 03:08:30,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22434 states. [2018-12-02 03:08:30,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22434 to 22306. [2018-12-02 03:08:30,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22306 states. [2018-12-02 03:08:30,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22306 states to 22306 states and 71750 transitions. [2018-12-02 03:08:30,276 INFO L78 Accepts]: Start accepts. Automaton has 22306 states and 71750 transitions. Word has length 119 [2018-12-02 03:08:30,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 03:08:30,277 INFO L480 AbstractCegarLoop]: Abstraction has 22306 states and 71750 transitions. [2018-12-02 03:08:30,277 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 03:08:30,277 INFO L276 IsEmpty]: Start isEmpty. Operand 22306 states and 71750 transitions. [2018-12-02 03:08:30,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-12-02 03:08:30,296 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 03:08:30,296 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 03:08:30,296 INFO L423 AbstractCegarLoop]: === Iteration 18 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 03:08:30,296 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:08:30,296 INFO L82 PathProgramCache]: Analyzing trace with hash 1469863648, now seen corresponding path program 1 times [2018-12-02 03:08:30,297 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 03:08:30,297 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 03:08:30,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:08:30,297 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 03:08:30,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:08:30,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:08:30,376 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 03:08:30,376 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 03:08:30,376 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-02 03:08:30,376 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 03:08:30,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 03:08:30,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-12-02 03:08:30,377 INFO L87 Difference]: Start difference. First operand 22306 states and 71750 transitions. Second operand 7 states. [2018-12-02 03:08:30,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 03:08:30,771 INFO L93 Difference]: Finished difference Result 37134 states and 117549 transitions. [2018-12-02 03:08:30,771 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-02 03:08:30,771 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 119 [2018-12-02 03:08:30,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 03:08:30,810 INFO L225 Difference]: With dead ends: 37134 [2018-12-02 03:08:30,810 INFO L226 Difference]: Without dead ends: 37006 [2018-12-02 03:08:30,810 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 03:08:30,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37006 states. [2018-12-02 03:08:31,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37006 to 26072. [2018-12-02 03:08:31,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26072 states. [2018-12-02 03:08:31,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26072 states to 26072 states and 84537 transitions. [2018-12-02 03:08:31,158 INFO L78 Accepts]: Start accepts. Automaton has 26072 states and 84537 transitions. Word has length 119 [2018-12-02 03:08:31,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 03:08:31,159 INFO L480 AbstractCegarLoop]: Abstraction has 26072 states and 84537 transitions. [2018-12-02 03:08:31,159 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 03:08:31,159 INFO L276 IsEmpty]: Start isEmpty. Operand 26072 states and 84537 transitions. [2018-12-02 03:08:31,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-12-02 03:08:31,185 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 03:08:31,185 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 03:08:31,185 INFO L423 AbstractCegarLoop]: === Iteration 19 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 03:08:31,185 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:08:31,185 INFO L82 PathProgramCache]: Analyzing trace with hash -1863489631, now seen corresponding path program 1 times [2018-12-02 03:08:31,185 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 03:08:31,185 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 03:08:31,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:08:31,186 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 03:08:31,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:08:31,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:08:31,264 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 03:08:31,264 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 03:08:31,264 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-02 03:08:31,264 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 03:08:31,264 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 03:08:31,264 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-12-02 03:08:31,265 INFO L87 Difference]: Start difference. First operand 26072 states and 84537 transitions. Second operand 7 states. [2018-12-02 03:08:31,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 03:08:31,734 INFO L93 Difference]: Finished difference Result 39403 states and 125683 transitions. [2018-12-02 03:08:31,734 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-02 03:08:31,734 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 119 [2018-12-02 03:08:31,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 03:08:31,778 INFO L225 Difference]: With dead ends: 39403 [2018-12-02 03:08:31,778 INFO L226 Difference]: Without dead ends: 39403 [2018-12-02 03:08:31,778 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 03:08:31,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39403 states. [2018-12-02 03:08:32,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39403 to 28058. [2018-12-02 03:08:32,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28058 states. [2018-12-02 03:08:32,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28058 states to 28058 states and 91261 transitions. [2018-12-02 03:08:32,139 INFO L78 Accepts]: Start accepts. Automaton has 28058 states and 91261 transitions. Word has length 119 [2018-12-02 03:08:32,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 03:08:32,140 INFO L480 AbstractCegarLoop]: Abstraction has 28058 states and 91261 transitions. [2018-12-02 03:08:32,140 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 03:08:32,140 INFO L276 IsEmpty]: Start isEmpty. Operand 28058 states and 91261 transitions. [2018-12-02 03:08:32,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-12-02 03:08:32,166 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 03:08:32,166 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 03:08:32,167 INFO L423 AbstractCegarLoop]: === Iteration 20 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 03:08:32,167 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:08:32,167 INFO L82 PathProgramCache]: Analyzing trace with hash -618725150, now seen corresponding path program 1 times [2018-12-02 03:08:32,167 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 03:08:32,167 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 03:08:32,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:08:32,168 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 03:08:32,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:08:32,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:08:32,251 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 03:08:32,252 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 03:08:32,252 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-02 03:08:32,252 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 03:08:32,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 03:08:32,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-12-02 03:08:32,252 INFO L87 Difference]: Start difference. First operand 28058 states and 91261 transitions. Second operand 7 states. [2018-12-02 03:08:32,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 03:08:32,478 INFO L93 Difference]: Finished difference Result 42113 states and 138593 transitions. [2018-12-02 03:08:32,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 03:08:32,479 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 119 [2018-12-02 03:08:32,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 03:08:32,522 INFO L225 Difference]: With dead ends: 42113 [2018-12-02 03:08:32,522 INFO L226 Difference]: Without dead ends: 42113 [2018-12-02 03:08:32,522 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 03:08:32,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42113 states. [2018-12-02 03:08:32,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42113 to 29453. [2018-12-02 03:08:32,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29453 states. [2018-12-02 03:08:32,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29453 states to 29453 states and 95402 transitions. [2018-12-02 03:08:32,909 INFO L78 Accepts]: Start accepts. Automaton has 29453 states and 95402 transitions. Word has length 119 [2018-12-02 03:08:32,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 03:08:32,909 INFO L480 AbstractCegarLoop]: Abstraction has 29453 states and 95402 transitions. [2018-12-02 03:08:32,909 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 03:08:32,909 INFO L276 IsEmpty]: Start isEmpty. Operand 29453 states and 95402 transitions. [2018-12-02 03:08:32,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-12-02 03:08:32,937 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 03:08:32,937 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 03:08:32,938 INFO L423 AbstractCegarLoop]: === Iteration 21 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 03:08:32,938 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:08:32,938 INFO L82 PathProgramCache]: Analyzing trace with hash 1740581859, now seen corresponding path program 1 times [2018-12-02 03:08:32,938 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 03:08:32,938 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 03:08:32,939 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:08:32,939 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 03:08:32,939 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:08:32,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:08:32,998 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 03:08:32,999 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 03:08:32,999 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-02 03:08:32,999 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 03:08:32,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 03:08:32,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-02 03:08:32,999 INFO L87 Difference]: Start difference. First operand 29453 states and 95402 transitions. Second operand 7 states. [2018-12-02 03:08:33,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 03:08:33,235 INFO L93 Difference]: Finished difference Result 31183 states and 100606 transitions. [2018-12-02 03:08:33,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-02 03:08:33,235 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 119 [2018-12-02 03:08:33,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 03:08:33,270 INFO L225 Difference]: With dead ends: 31183 [2018-12-02 03:08:33,270 INFO L226 Difference]: Without dead ends: 31183 [2018-12-02 03:08:33,270 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 03:08:33,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31183 states. [2018-12-02 03:08:33,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31183 to 29738. [2018-12-02 03:08:33,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29738 states. [2018-12-02 03:08:33,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29738 states to 29738 states and 96220 transitions. [2018-12-02 03:08:33,615 INFO L78 Accepts]: Start accepts. Automaton has 29738 states and 96220 transitions. Word has length 119 [2018-12-02 03:08:33,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 03:08:33,615 INFO L480 AbstractCegarLoop]: Abstraction has 29738 states and 96220 transitions. [2018-12-02 03:08:33,615 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 03:08:33,615 INFO L276 IsEmpty]: Start isEmpty. Operand 29738 states and 96220 transitions. [2018-12-02 03:08:33,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-12-02 03:08:33,642 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 03:08:33,642 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 03:08:33,642 INFO L423 AbstractCegarLoop]: === Iteration 22 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 03:08:33,643 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:08:33,643 INFO L82 PathProgramCache]: Analyzing trace with hash -1748850235, now seen corresponding path program 1 times [2018-12-02 03:08:33,643 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 03:08:33,643 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 03:08:33,644 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:08:33,644 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 03:08:33,644 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:08:33,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:08:33,720 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 03:08:33,720 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 03:08:33,720 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 03:08:33,720 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 03:08:33,720 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 03:08:33,721 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-02 03:08:33,721 INFO L87 Difference]: Start difference. First operand 29738 states and 96220 transitions. Second operand 5 states. [2018-12-02 03:08:33,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 03:08:33,908 INFO L93 Difference]: Finished difference Result 28158 states and 90106 transitions. [2018-12-02 03:08:33,908 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 03:08:33,908 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 119 [2018-12-02 03:08:33,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 03:08:33,940 INFO L225 Difference]: With dead ends: 28158 [2018-12-02 03:08:33,940 INFO L226 Difference]: Without dead ends: 28158 [2018-12-02 03:08:33,940 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 03:08:33,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28158 states. [2018-12-02 03:08:34,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28158 to 28158. [2018-12-02 03:08:34,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28158 states. [2018-12-02 03:08:34,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28158 states to 28158 states and 90106 transitions. [2018-12-02 03:08:34,237 INFO L78 Accepts]: Start accepts. Automaton has 28158 states and 90106 transitions. Word has length 119 [2018-12-02 03:08:34,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 03:08:34,238 INFO L480 AbstractCegarLoop]: Abstraction has 28158 states and 90106 transitions. [2018-12-02 03:08:34,238 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 03:08:34,238 INFO L276 IsEmpty]: Start isEmpty. Operand 28158 states and 90106 transitions. [2018-12-02 03:08:34,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-12-02 03:08:34,263 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 03:08:34,263 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 03:08:34,263 INFO L423 AbstractCegarLoop]: === Iteration 23 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 03:08:34,263 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:08:34,263 INFO L82 PathProgramCache]: Analyzing trace with hash 1801318562, now seen corresponding path program 1 times [2018-12-02 03:08:34,263 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 03:08:34,263 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 03:08:34,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:08:34,264 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 03:08:34,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:08:34,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:08:34,411 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 03:08:34,411 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 03:08:34,412 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 03:08:34,412 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 03:08:34,412 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 03:08:34,412 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-02 03:08:34,412 INFO L87 Difference]: Start difference. First operand 28158 states and 90106 transitions. Second operand 6 states. [2018-12-02 03:08:34,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 03:08:34,575 INFO L93 Difference]: Finished difference Result 25726 states and 80922 transitions. [2018-12-02 03:08:34,575 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 03:08:34,575 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 119 [2018-12-02 03:08:34,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 03:08:34,604 INFO L225 Difference]: With dead ends: 25726 [2018-12-02 03:08:34,604 INFO L226 Difference]: Without dead ends: 25726 [2018-12-02 03:08:34,604 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 03:08:34,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25726 states. [2018-12-02 03:08:34,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25726 to 19059. [2018-12-02 03:08:34,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19059 states. [2018-12-02 03:08:34,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19059 states to 19059 states and 60514 transitions. [2018-12-02 03:08:34,840 INFO L78 Accepts]: Start accepts. Automaton has 19059 states and 60514 transitions. Word has length 119 [2018-12-02 03:08:34,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 03:08:34,840 INFO L480 AbstractCegarLoop]: Abstraction has 19059 states and 60514 transitions. [2018-12-02 03:08:34,840 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 03:08:34,840 INFO L276 IsEmpty]: Start isEmpty. Operand 19059 states and 60514 transitions. [2018-12-02 03:08:34,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-12-02 03:08:34,856 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 03:08:34,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] [2018-12-02 03:08:34,856 INFO L423 AbstractCegarLoop]: === Iteration 24 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 03:08:34,856 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:08:34,856 INFO L82 PathProgramCache]: Analyzing trace with hash 1056511820, now seen corresponding path program 1 times [2018-12-02 03:08:34,856 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 03:08:34,856 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 03:08:34,857 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:08:34,857 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 03:08:34,857 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:08:34,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:08:34,897 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 03:08:34,897 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 03:08:34,897 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 03:08:34,897 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 03:08:34,897 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 03:08:34,897 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 03:08:34,897 INFO L87 Difference]: Start difference. First operand 19059 states and 60514 transitions. Second operand 5 states. [2018-12-02 03:08:35,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 03:08:35,115 INFO L93 Difference]: Finished difference Result 21912 states and 69118 transitions. [2018-12-02 03:08:35,115 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 03:08:35,115 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 119 [2018-12-02 03:08:35,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 03:08:35,142 INFO L225 Difference]: With dead ends: 21912 [2018-12-02 03:08:35,142 INFO L226 Difference]: Without dead ends: 21912 [2018-12-02 03:08:35,142 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 03:08:35,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21912 states. [2018-12-02 03:08:35,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21912 to 19109. [2018-12-02 03:08:35,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19109 states. [2018-12-02 03:08:35,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19109 states to 19109 states and 60654 transitions. [2018-12-02 03:08:35,348 INFO L78 Accepts]: Start accepts. Automaton has 19109 states and 60654 transitions. Word has length 119 [2018-12-02 03:08:35,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 03:08:35,349 INFO L480 AbstractCegarLoop]: Abstraction has 19109 states and 60654 transitions. [2018-12-02 03:08:35,349 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 03:08:35,349 INFO L276 IsEmpty]: Start isEmpty. Operand 19109 states and 60654 transitions. [2018-12-02 03:08:35,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-12-02 03:08:35,363 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 03:08:35,363 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 03:08:35,363 INFO L423 AbstractCegarLoop]: === Iteration 25 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 03:08:35,363 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:08:35,363 INFO L82 PathProgramCache]: Analyzing trace with hash 1436245957, now seen corresponding path program 1 times [2018-12-02 03:08:35,363 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 03:08:35,363 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 03:08:35,364 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:08:35,364 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 03:08:35,364 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:08:35,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:08:35,426 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 03:08:35,426 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 03:08:35,426 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 03:08:35,426 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 03:08:35,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 03:08:35,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 03:08:35,427 INFO L87 Difference]: Start difference. First operand 19109 states and 60654 transitions. Second operand 5 states. [2018-12-02 03:08:35,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 03:08:35,595 INFO L93 Difference]: Finished difference Result 20389 states and 64814 transitions. [2018-12-02 03:08:35,595 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 03:08:35,595 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 121 [2018-12-02 03:08:35,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 03:08:35,616 INFO L225 Difference]: With dead ends: 20389 [2018-12-02 03:08:35,616 INFO L226 Difference]: Without dead ends: 20389 [2018-12-02 03:08:35,616 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 03:08:35,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20389 states. [2018-12-02 03:08:35,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20389 to 19301. [2018-12-02 03:08:35,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19301 states. [2018-12-02 03:08:35,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19301 states to 19301 states and 61278 transitions. [2018-12-02 03:08:35,805 INFO L78 Accepts]: Start accepts. Automaton has 19301 states and 61278 transitions. Word has length 121 [2018-12-02 03:08:35,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 03:08:35,805 INFO L480 AbstractCegarLoop]: Abstraction has 19301 states and 61278 transitions. [2018-12-02 03:08:35,805 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 03:08:35,805 INFO L276 IsEmpty]: Start isEmpty. Operand 19301 states and 61278 transitions. [2018-12-02 03:08:35,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-12-02 03:08:35,819 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 03:08:35,819 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 03:08:35,820 INFO L423 AbstractCegarLoop]: === Iteration 26 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 03:08:35,820 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:08:35,820 INFO L82 PathProgramCache]: Analyzing trace with hash -1613956858, now seen corresponding path program 1 times [2018-12-02 03:08:35,820 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 03:08:35,820 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 03:08:35,820 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:08:35,821 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 03:08:35,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:08:35,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:08:35,879 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 03:08:35,879 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 03:08:35,879 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 03:08:35,879 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 03:08:35,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 03:08:35,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-02 03:08:35,880 INFO L87 Difference]: Start difference. First operand 19301 states and 61278 transitions. Second operand 4 states. [2018-12-02 03:08:35,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 03:08:35,989 INFO L93 Difference]: Finished difference Result 28852 states and 91979 transitions. [2018-12-02 03:08:35,989 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 03:08:35,989 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 121 [2018-12-02 03:08:35,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 03:08:36,021 INFO L225 Difference]: With dead ends: 28852 [2018-12-02 03:08:36,021 INFO L226 Difference]: Without dead ends: 28852 [2018-12-02 03:08:36,021 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 03:08:36,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28852 states. [2018-12-02 03:08:36,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28852 to 28503. [2018-12-02 03:08:36,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28503 states. [2018-12-02 03:08:36,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28503 states to 28503 states and 90973 transitions. [2018-12-02 03:08:36,411 INFO L78 Accepts]: Start accepts. Automaton has 28503 states and 90973 transitions. Word has length 121 [2018-12-02 03:08:36,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 03:08:36,411 INFO L480 AbstractCegarLoop]: Abstraction has 28503 states and 90973 transitions. [2018-12-02 03:08:36,411 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 03:08:36,411 INFO L276 IsEmpty]: Start isEmpty. Operand 28503 states and 90973 transitions. [2018-12-02 03:08:36,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-12-02 03:08:36,435 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 03:08:36,435 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 03:08:36,435 INFO L423 AbstractCegarLoop]: === Iteration 27 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 03:08:36,435 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:08:36,435 INFO L82 PathProgramCache]: Analyzing trace with hash 1793506757, now seen corresponding path program 1 times [2018-12-02 03:08:36,435 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 03:08:36,435 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 03:08:36,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:08:36,436 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 03:08:36,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:08:36,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:08:36,468 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 03:08:36,468 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 03:08:36,468 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 03:08:36,468 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 03:08:36,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 03:08:36,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-02 03:08:36,469 INFO L87 Difference]: Start difference. First operand 28503 states and 90973 transitions. Second operand 5 states. [2018-12-02 03:08:36,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 03:08:36,581 INFO L93 Difference]: Finished difference Result 40763 states and 130535 transitions. [2018-12-02 03:08:36,581 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 03:08:36,581 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 121 [2018-12-02 03:08:36,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 03:08:36,630 INFO L225 Difference]: With dead ends: 40763 [2018-12-02 03:08:36,630 INFO L226 Difference]: Without dead ends: 40763 [2018-12-02 03:08:36,630 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 03:08:36,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40763 states. [2018-12-02 03:08:36,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40763 to 28503. [2018-12-02 03:08:36,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28503 states. [2018-12-02 03:08:36,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28503 states to 28503 states and 89608 transitions. [2018-12-02 03:08:36,996 INFO L78 Accepts]: Start accepts. Automaton has 28503 states and 89608 transitions. Word has length 121 [2018-12-02 03:08:36,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 03:08:36,997 INFO L480 AbstractCegarLoop]: Abstraction has 28503 states and 89608 transitions. [2018-12-02 03:08:36,997 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 03:08:36,997 INFO L276 IsEmpty]: Start isEmpty. Operand 28503 states and 89608 transitions. [2018-12-02 03:08:37,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-12-02 03:08:37,022 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 03:08:37,022 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 03:08:37,023 INFO L423 AbstractCegarLoop]: === Iteration 28 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 03:08:37,023 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:08:37,023 INFO L82 PathProgramCache]: Analyzing trace with hash -1197066810, now seen corresponding path program 1 times [2018-12-02 03:08:37,023 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 03:08:37,023 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 03:08:37,024 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:08:37,024 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 03:08:37,024 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:08:37,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:08:37,093 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 03:08:37,093 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 03:08:37,093 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-02 03:08:37,093 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-02 03:08:37,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-02 03:08:37,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-12-02 03:08:37,094 INFO L87 Difference]: Start difference. First operand 28503 states and 89608 transitions. Second operand 9 states. [2018-12-02 03:08:37,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 03:08:37,317 INFO L93 Difference]: Finished difference Result 40823 states and 131148 transitions. [2018-12-02 03:08:37,317 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-02 03:08:37,317 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 121 [2018-12-02 03:08:37,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 03:08:37,336 INFO L225 Difference]: With dead ends: 40823 [2018-12-02 03:08:37,336 INFO L226 Difference]: Without dead ends: 16447 [2018-12-02 03:08:37,336 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 03:08:37,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16447 states. [2018-12-02 03:08:37,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16447 to 16447. [2018-12-02 03:08:37,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16447 states. [2018-12-02 03:08:37,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16447 states to 16447 states and 51504 transitions. [2018-12-02 03:08:37,498 INFO L78 Accepts]: Start accepts. Automaton has 16447 states and 51504 transitions. Word has length 121 [2018-12-02 03:08:37,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 03:08:37,498 INFO L480 AbstractCegarLoop]: Abstraction has 16447 states and 51504 transitions. [2018-12-02 03:08:37,498 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-02 03:08:37,498 INFO L276 IsEmpty]: Start isEmpty. Operand 16447 states and 51504 transitions. [2018-12-02 03:08:37,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-12-02 03:08:37,511 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 03:08:37,511 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 03:08:37,511 INFO L423 AbstractCegarLoop]: === Iteration 29 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 03:08:37,511 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:08:37,511 INFO L82 PathProgramCache]: Analyzing trace with hash -1130206968, now seen corresponding path program 2 times [2018-12-02 03:08:37,512 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 03:08:37,512 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 03:08:37,512 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:08:37,512 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 03:08:37,512 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:08:37,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:08:37,575 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 03:08:37,575 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 03:08:37,575 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-02 03:08:37,575 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-02 03:08:37,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-02 03:08:37,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-12-02 03:08:37,575 INFO L87 Difference]: Start difference. First operand 16447 states and 51504 transitions. Second operand 8 states. [2018-12-02 03:08:37,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 03:08:37,798 INFO L93 Difference]: Finished difference Result 31921 states and 102945 transitions. [2018-12-02 03:08:37,798 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-02 03:08:37,798 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 121 [2018-12-02 03:08:37,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 03:08:37,812 INFO L225 Difference]: With dead ends: 31921 [2018-12-02 03:08:37,812 INFO L226 Difference]: Without dead ends: 11692 [2018-12-02 03:08:37,812 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 03:08:37,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11692 states. [2018-12-02 03:08:37,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11692 to 11692. [2018-12-02 03:08:37,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11692 states. [2018-12-02 03:08:37,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11692 states to 11692 states and 39565 transitions. [2018-12-02 03:08:37,929 INFO L78 Accepts]: Start accepts. Automaton has 11692 states and 39565 transitions. Word has length 121 [2018-12-02 03:08:37,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 03:08:37,929 INFO L480 AbstractCegarLoop]: Abstraction has 11692 states and 39565 transitions. [2018-12-02 03:08:37,929 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-02 03:08:37,929 INFO L276 IsEmpty]: Start isEmpty. Operand 11692 states and 39565 transitions. [2018-12-02 03:08:37,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-12-02 03:08:37,938 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 03:08:37,938 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 03:08:37,939 INFO L423 AbstractCegarLoop]: === Iteration 30 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 03:08:37,939 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:08:37,939 INFO L82 PathProgramCache]: Analyzing trace with hash -608268126, now seen corresponding path program 3 times [2018-12-02 03:08:37,939 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 03:08:37,939 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 03:08:37,940 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:08:37,940 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 03:08:37,940 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:08:37,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 03:08:37,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 03:08:37,982 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-02 03:08:38,059 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-12-02 03:08:38,060 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.12 03:08:38 BasicIcfg [2018-12-02 03:08:38,060 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-02 03:08:38,061 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-02 03:08:38,061 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-02 03:08:38,061 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-02 03:08:38,061 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 03:04:19" (3/4) ... [2018-12-02 03:08:38,063 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-02 03:08:38,143 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_369b9ab9-f557-4e5f-8183-d977194a4bb6/bin-2019/uautomizer/witness.graphml [2018-12-02 03:08:38,144 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-02 03:08:38,144 INFO L168 Benchmark]: Toolchain (without parser) took 259847.29 ms. Allocated memory was 1.0 GB in the beginning and 10.2 GB in the end (delta: 9.2 GB). Free memory was 956.0 MB in the beginning and 4.8 GB in the end (delta: -3.9 GB). Peak memory consumption was 5.4 GB. Max. memory is 11.5 GB. [2018-12-02 03:08:38,145 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 1.0 GB. Free memory is still 982.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 03:08:38,145 INFO L168 Benchmark]: CACSL2BoogieTranslator took 351.72 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 149.9 MB). Free memory was 956.0 MB in the beginning and 1.1 GB in the end (delta: -170.4 MB). Peak memory consumption was 37.3 MB. Max. memory is 11.5 GB. [2018-12-02 03:08:38,145 INFO L168 Benchmark]: Boogie Procedure Inliner took 35.78 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.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. [2018-12-02 03:08:38,145 INFO L168 Benchmark]: Boogie Preprocessor took 21.90 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 03:08:38,145 INFO L168 Benchmark]: RCFGBuilder took 446.87 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: 66.4 MB). Peak memory consumption was 66.4 MB. Max. memory is 11.5 GB. [2018-12-02 03:08:38,146 INFO L168 Benchmark]: TraceAbstraction took 258905.29 ms. Allocated memory was 1.2 GB in the beginning and 10.2 GB in the end (delta: 9.1 GB). Free memory was 1.1 GB in the beginning and 4.9 GB in the end (delta: -3.9 GB). Peak memory consumption was 5.2 GB. Max. memory is 11.5 GB. [2018-12-02 03:08:38,146 INFO L168 Benchmark]: Witness Printer took 82.87 ms. Allocated memory is still 10.2 GB. Free memory was 4.9 GB in the beginning and 4.8 GB in the end (delta: 89.0 MB). Peak memory consumption was 89.0 MB. Max. memory is 11.5 GB. [2018-12-02 03:08:38,147 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.10 ms. Allocated memory is still 1.0 GB. Free memory is still 982.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 351.72 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 149.9 MB). Free memory was 956.0 MB in the beginning and 1.1 GB in the end (delta: -170.4 MB). Peak memory consumption was 37.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 35.78 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.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 21.90 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 446.87 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: 66.4 MB). Peak memory consumption was 66.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 258905.29 ms. Allocated memory was 1.2 GB in the beginning and 10.2 GB in the end (delta: 9.1 GB). Free memory was 1.1 GB in the beginning and 4.9 GB in the end (delta: -3.9 GB). Peak memory consumption was 5.2 GB. Max. memory is 11.5 GB. * Witness Printer took 82.87 ms. Allocated memory is still 10.2 GB. Free memory was 4.9 GB in the beginning and 4.8 GB in the end (delta: 89.0 MB). Peak memory consumption was 89.0 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, 258.8s OverallTime, 30 OverallIterations, 1 TraceHistogramMax, 49.5s 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.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 247 GetRequests, 69 SyntacticMatches, 27 SemanticMatches, 151 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 1.4s 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: 107.9s AutomataMinimizationTime, 29 MinimizatonAttempts, 844413 StatesRemovedByMinimization, 23 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.5s 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...