./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix045_rmo.opt_false-unreach-call.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0cd3be1d Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_34c20c6a-e99c-40e7-9151-be0723070517/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_34c20c6a-e99c-40e7-9151-be0723070517/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_34c20c6a-e99c-40e7-9151-be0723070517/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_34c20c6a-e99c-40e7-9151-be0723070517/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix045_rmo.opt_false-unreach-call.i -s /tmp/vcloud-vcloud-master/worker/working_dir_34c20c6a-e99c-40e7-9151-be0723070517/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_34c20c6a-e99c-40e7-9151-be0723070517/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 e42b6a2a35cef26e55b291e79df7165f23d753e1 ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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-0cd3be1 [2018-11-28 11:53:14,693 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-28 11:53:14,694 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-28 11:53:14,704 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-28 11:53:14,704 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-28 11:53:14,709 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-28 11:53:14,710 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-28 11:53:14,711 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-28 11:53:14,712 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-28 11:53:14,713 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-28 11:53:14,714 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-28 11:53:14,714 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-28 11:53:14,715 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-28 11:53:14,715 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-28 11:53:14,716 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-28 11:53:14,717 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-28 11:53:14,717 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-28 11:53:14,719 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-28 11:53:14,720 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-28 11:53:14,721 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-28 11:53:14,722 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-28 11:53:14,723 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-28 11:53:14,725 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-28 11:53:14,725 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-28 11:53:14,725 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-28 11:53:14,726 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-28 11:53:14,727 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-28 11:53:14,727 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-28 11:53:14,728 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-28 11:53:14,729 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-28 11:53:14,729 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-28 11:53:14,729 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-28 11:53:14,729 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-28 11:53:14,730 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-28 11:53:14,730 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-28 11:53:14,731 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-28 11:53:14,731 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_34c20c6a-e99c-40e7-9151-be0723070517/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-28 11:53:14,741 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-28 11:53:14,742 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-28 11:53:14,742 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-28 11:53:14,742 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-28 11:53:14,743 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-28 11:53:14,743 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-28 11:53:14,743 INFO L133 SettingsManager]: * Use SBE=true [2018-11-28 11:53:14,743 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-28 11:53:14,743 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-28 11:53:14,744 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-28 11:53:14,744 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-28 11:53:14,744 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-28 11:53:14,744 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-28 11:53:14,744 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-28 11:53:14,744 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-28 11:53:14,744 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-28 11:53:14,745 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-28 11:53:14,745 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-28 11:53:14,745 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-28 11:53:14,745 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-28 11:53:14,745 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-28 11:53:14,745 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-28 11:53:14,745 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-28 11:53:14,746 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-28 11:53:14,746 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-28 11:53:14,746 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-28 11:53:14,746 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-28 11:53:14,746 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-28 11:53:14,746 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-28 11:53:14,746 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-28 11:53:14,746 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_34c20c6a-e99c-40e7-9151-be0723070517/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 -> e42b6a2a35cef26e55b291e79df7165f23d753e1 [2018-11-28 11:53:14,772 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-28 11:53:14,782 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-28 11:53:14,785 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-28 11:53:14,786 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-28 11:53:14,786 INFO L276 PluginConnector]: CDTParser initialized [2018-11-28 11:53:14,787 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_34c20c6a-e99c-40e7-9151-be0723070517/bin-2019/uautomizer/../../sv-benchmarks/c/pthread-wmm/mix045_rmo.opt_false-unreach-call.i [2018-11-28 11:53:14,834 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_34c20c6a-e99c-40e7-9151-be0723070517/bin-2019/uautomizer/data/49524f19c/de4165dab4214b4e877bef536e19a3af/FLAG51d7a4f4d [2018-11-28 11:53:15,219 INFO L307 CDTParser]: Found 1 translation units. [2018-11-28 11:53:15,220 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_34c20c6a-e99c-40e7-9151-be0723070517/sv-benchmarks/c/pthread-wmm/mix045_rmo.opt_false-unreach-call.i [2018-11-28 11:53:15,229 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_34c20c6a-e99c-40e7-9151-be0723070517/bin-2019/uautomizer/data/49524f19c/de4165dab4214b4e877bef536e19a3af/FLAG51d7a4f4d [2018-11-28 11:53:15,601 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_34c20c6a-e99c-40e7-9151-be0723070517/bin-2019/uautomizer/data/49524f19c/de4165dab4214b4e877bef536e19a3af [2018-11-28 11:53:15,603 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-28 11:53:15,604 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-28 11:53:15,604 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-28 11:53:15,604 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-28 11:53:15,606 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-28 11:53:15,607 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 11:53:15" (1/1) ... [2018-11-28 11:53:15,608 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6084a266 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:53:15, skipping insertion in model container [2018-11-28 11:53:15,608 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 11:53:15" (1/1) ... [2018-11-28 11:53:15,613 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-28 11:53:15,641 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-28 11:53:15,877 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 11:53:15,888 INFO L191 MainTranslator]: Completed pre-run [2018-11-28 11:53:15,978 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 11:53:16,011 INFO L195 MainTranslator]: Completed translation [2018-11-28 11:53:16,012 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:53:16 WrapperNode [2018-11-28 11:53:16,012 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-28 11:53:16,012 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-28 11:53:16,012 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-28 11:53:16,012 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-28 11:53:16,018 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:53:16" (1/1) ... [2018-11-28 11:53:16,032 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:53:16" (1/1) ... [2018-11-28 11:53:16,055 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-28 11:53:16,056 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-28 11:53:16,056 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-28 11:53:16,056 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-28 11:53:16,063 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:53:16" (1/1) ... [2018-11-28 11:53:16,063 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:53:16" (1/1) ... [2018-11-28 11:53:16,065 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:53:16" (1/1) ... [2018-11-28 11:53:16,066 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:53:16" (1/1) ... [2018-11-28 11:53:16,072 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:53:16" (1/1) ... [2018-11-28 11:53:16,074 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:53:16" (1/1) ... [2018-11-28 11:53:16,076 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:53:16" (1/1) ... [2018-11-28 11:53:16,078 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-28 11:53:16,079 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-28 11:53:16,079 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-28 11:53:16,079 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-28 11:53:16,079 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:53:16" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_34c20c6a-e99c-40e7-9151-be0723070517/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-11-28 11:53:16,112 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-28 11:53:16,112 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-28 11:53:16,112 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2018-11-28 11:53:16,112 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-28 11:53:16,113 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2018-11-28 11:53:16,113 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2018-11-28 11:53:16,113 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2018-11-28 11:53:16,113 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2018-11-28 11:53:16,113 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2018-11-28 11:53:16,113 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2018-11-28 11:53:16,113 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2018-11-28 11:53:16,113 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-28 11:53:16,113 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-28 11:53:16,115 WARN L198 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2018-11-28 11:53:16,542 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-28 11:53:16,542 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-11-28 11:53:16,542 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:53:16 BoogieIcfgContainer [2018-11-28 11:53:16,542 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-28 11:53:16,543 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-28 11:53:16,543 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-28 11:53:16,546 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-28 11:53:16,546 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 11:53:15" (1/3) ... [2018-11-28 11:53:16,546 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b2f5977 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 11:53:16, skipping insertion in model container [2018-11-28 11:53:16,547 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:53:16" (2/3) ... [2018-11-28 11:53:16,547 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b2f5977 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 11:53:16, skipping insertion in model container [2018-11-28 11:53:16,547 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:53:16" (3/3) ... [2018-11-28 11:53:16,548 INFO L112 eAbstractionObserver]: Analyzing ICFG mix045_rmo.opt_false-unreach-call.i [2018-11-28 11:53:16,574 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:53:16,574 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:53:16,574 WARN L317 ript$VariableManager]: TermVariabe Thread2_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:53:16,575 WARN L317 ript$VariableManager]: TermVariabe Thread2_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:53:16,575 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P0_#t~nondet3.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:53:16,575 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P0_#t~nondet3.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:53:16,575 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:53:16,575 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:53:16,576 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P0_#t~nondet3.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:53:16,576 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P0_#t~nondet3.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:53:16,576 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:53:16,576 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:53:16,576 WARN L317 ript$VariableManager]: TermVariabe Thread0_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:53:16,576 WARN L317 ript$VariableManager]: TermVariabe Thread0_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:53:16,577 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:53:16,577 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:53:16,577 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:53:16,577 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:53:16,577 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:53:16,578 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:53:16,578 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:53:16,578 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:53:16,578 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:53:16,578 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:53:16,578 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:53:16,578 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:53:16,578 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:53:16,578 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:53:16,579 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:53:16,579 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:53:16,579 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:53:16,579 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:53:16,579 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:53:16,579 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:53:16,579 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:53:16,579 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:53:16,579 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:53:16,579 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:53:16,580 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet10.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:53:16,580 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet10.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:53:16,580 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:53:16,580 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:53:16,580 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet10.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:53:16,580 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet10.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:53:16,580 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:53:16,581 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:53:16,581 WARN L317 ript$VariableManager]: TermVariabe Thread1_P2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:53:16,581 WARN L317 ript$VariableManager]: TermVariabe Thread1_P2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:53:16,581 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:53:16,581 WARN L317 ript$VariableManager]: TermVariabe Thread1_P2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:53:16,581 WARN L317 ript$VariableManager]: TermVariabe Thread1_P2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:53:16,581 WARN L317 ript$VariableManager]: TermVariabe Thread1_P2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:53:16,581 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:53:16,582 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:53:16,582 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:53:16,582 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:53:16,582 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:53:16,582 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:53:16,582 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:53:16,582 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:53:16,582 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:53:16,582 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:53:16,583 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:53:16,583 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:53:16,583 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:53:16,583 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:53:16,583 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:53:16,583 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:53:16,583 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:53:16,583 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:53:16,583 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:53:16,583 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:53:16,583 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:53:16,584 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:53:16,584 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:53:16,584 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:53:16,584 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~nondet17.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:53:16,584 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~nondet17.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:53:16,584 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:53:16,584 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:53:16,584 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~nondet17.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:53:16,585 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~nondet17.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:53:16,593 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2018-11-28 11:53:16,593 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-28 11:53:16,601 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-11-28 11:53:16,611 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2018-11-28 11:53:16,629 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-28 11:53:16,630 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-28 11:53:16,630 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-28 11:53:16,630 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-28 11:53:16,630 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-28 11:53:16,630 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-28 11:53:16,630 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-28 11:53:16,630 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-28 11:53:16,630 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-28 11:53:16,640 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 157places, 194 transitions [2018-11-28 11:53:33,401 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 128914 states. [2018-11-28 11:53:33,402 INFO L276 IsEmpty]: Start isEmpty. Operand 128914 states. [2018-11-28 11:53:33,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-11-28 11:53:33,409 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:53:33,410 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] [2018-11-28 11:53:33,412 INFO L423 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:53:33,418 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:53:33,418 INFO L82 PathProgramCache]: Analyzing trace with hash 1531198028, now seen corresponding path program 1 times [2018-11-28 11:53:33,420 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:53:33,421 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:53:33,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:53:33,464 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:53:33,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:53:33,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:53:33,599 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:53:33,602 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:53:33,602 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 11:53:33,604 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 11:53:33,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 11:53:33,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 11:53:33,615 INFO L87 Difference]: Start difference. First operand 128914 states. Second operand 4 states. [2018-11-28 11:53:34,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:53:34,952 INFO L93 Difference]: Finished difference Result 233474 states and 1098326 transitions. [2018-11-28 11:53:34,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 11:53:34,954 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 45 [2018-11-28 11:53:34,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:53:35,859 INFO L225 Difference]: With dead ends: 233474 [2018-11-28 11:53:35,859 INFO L226 Difference]: Without dead ends: 203724 [2018-11-28 11:53:35,861 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-11-28 11:53:40,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203724 states. [2018-11-28 11:53:42,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203724 to 118894. [2018-11-28 11:53:42,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118894 states. [2018-11-28 11:53:43,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118894 states to 118894 states and 559777 transitions. [2018-11-28 11:53:43,060 INFO L78 Accepts]: Start accepts. Automaton has 118894 states and 559777 transitions. Word has length 45 [2018-11-28 11:53:43,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:53:43,061 INFO L480 AbstractCegarLoop]: Abstraction has 118894 states and 559777 transitions. [2018-11-28 11:53:43,061 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 11:53:43,062 INFO L276 IsEmpty]: Start isEmpty. Operand 118894 states and 559777 transitions. [2018-11-28 11:53:43,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-11-28 11:53:43,069 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:53:43,073 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-11-28 11:53:43,074 INFO L423 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:53:43,074 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:53:43,074 INFO L82 PathProgramCache]: Analyzing trace with hash -834891017, now seen corresponding path program 1 times [2018-11-28 11:53:43,074 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:53:43,074 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:53:43,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:53:43,078 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:53:43,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:53:43,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:53:43,135 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:53:43,136 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:53:43,136 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 11:53:43,137 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 11:53:43,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 11:53:43,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 11:53:43,138 INFO L87 Difference]: Start difference. First operand 118894 states and 559777 transitions. Second operand 3 states. [2018-11-28 11:53:43,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:53:43,799 INFO L93 Difference]: Finished difference Result 118894 states and 557817 transitions. [2018-11-28 11:53:43,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 11:53:43,799 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2018-11-28 11:53:43,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:53:44,155 INFO L225 Difference]: With dead ends: 118894 [2018-11-28 11:53:44,155 INFO L226 Difference]: Without dead ends: 118894 [2018-11-28 11:53:44,156 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-11-28 11:53:45,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118894 states. [2018-11-28 11:53:47,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118894 to 118894. [2018-11-28 11:53:47,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118894 states. [2018-11-28 11:53:47,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118894 states to 118894 states and 557817 transitions. [2018-11-28 11:53:47,521 INFO L78 Accepts]: Start accepts. Automaton has 118894 states and 557817 transitions. Word has length 52 [2018-11-28 11:53:47,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:53:47,521 INFO L480 AbstractCegarLoop]: Abstraction has 118894 states and 557817 transitions. [2018-11-28 11:53:47,521 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 11:53:47,521 INFO L276 IsEmpty]: Start isEmpty. Operand 118894 states and 557817 transitions. [2018-11-28 11:53:47,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-11-28 11:53:47,524 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:53:47,524 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-11-28 11:53:47,524 INFO L423 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:53:47,524 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:53:47,525 INFO L82 PathProgramCache]: Analyzing trace with hash 1663124920, now seen corresponding path program 1 times [2018-11-28 11:53:47,525 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:53:47,525 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:53:47,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:53:47,527 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:53:47,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:53:47,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:53:47,585 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:53:47,586 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:53:47,586 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 11:53:47,586 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 11:53:47,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 11:53:47,586 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 11:53:47,586 INFO L87 Difference]: Start difference. First operand 118894 states and 557817 transitions. Second operand 5 states. [2018-11-28 11:53:52,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:53:52,703 INFO L93 Difference]: Finished difference Result 325274 states and 1468251 transitions. [2018-11-28 11:53:52,703 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-28 11:53:52,703 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 52 [2018-11-28 11:53:52,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:53:53,635 INFO L225 Difference]: With dead ends: 325274 [2018-11-28 11:53:53,635 INFO L226 Difference]: Without dead ends: 324274 [2018-11-28 11:53:53,636 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-11-28 11:53:55,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324274 states. [2018-11-28 11:53:58,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324274 to 186424. [2018-11-28 11:53:58,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186424 states. [2018-11-28 11:53:59,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186424 states to 186424 states and 840916 transitions. [2018-11-28 11:53:59,793 INFO L78 Accepts]: Start accepts. Automaton has 186424 states and 840916 transitions. Word has length 52 [2018-11-28 11:53:59,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:53:59,794 INFO L480 AbstractCegarLoop]: Abstraction has 186424 states and 840916 transitions. [2018-11-28 11:53:59,794 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 11:53:59,794 INFO L276 IsEmpty]: Start isEmpty. Operand 186424 states and 840916 transitions. [2018-11-28 11:53:59,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-11-28 11:53:59,802 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:53:59,802 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-11-28 11:53:59,802 INFO L423 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:53:59,802 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:53:59,802 INFO L82 PathProgramCache]: Analyzing trace with hash 1719302045, now seen corresponding path program 1 times [2018-11-28 11:53:59,802 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:53:59,802 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:53:59,805 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:53:59,805 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:53:59,805 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:53:59,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:53:59,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-11-28 11:53:59,874 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:53:59,874 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 11:53:59,875 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 11:53:59,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 11:53:59,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 11:53:59,875 INFO L87 Difference]: Start difference. First operand 186424 states and 840916 transitions. Second operand 5 states. [2018-11-28 11:54:01,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:54:01,398 INFO L93 Difference]: Finished difference Result 334054 states and 1500995 transitions. [2018-11-28 11:54:01,398 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-28 11:54:01,398 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 53 [2018-11-28 11:54:01,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:54:02,287 INFO L225 Difference]: With dead ends: 334054 [2018-11-28 11:54:02,287 INFO L226 Difference]: Without dead ends: 333004 [2018-11-28 11:54:02,287 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-11-28 11:54:09,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333004 states. [2018-11-28 11:54:12,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333004 to 194884. [2018-11-28 11:54:12,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194884 states. [2018-11-28 11:54:12,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194884 states to 194884 states and 876474 transitions. [2018-11-28 11:54:12,953 INFO L78 Accepts]: Start accepts. Automaton has 194884 states and 876474 transitions. Word has length 53 [2018-11-28 11:54:12,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:54:12,953 INFO L480 AbstractCegarLoop]: Abstraction has 194884 states and 876474 transitions. [2018-11-28 11:54:12,953 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 11:54:12,953 INFO L276 IsEmpty]: Start isEmpty. Operand 194884 states and 876474 transitions. [2018-11-28 11:54:12,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-11-28 11:54:12,979 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:54:12,979 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:54:12,979 INFO L423 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:54:12,979 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:54:12,979 INFO L82 PathProgramCache]: Analyzing trace with hash -1090824439, now seen corresponding path program 1 times [2018-11-28 11:54:12,979 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:54:12,979 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:54:12,981 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:54:12,981 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:54:12,981 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:54:12,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:54:13,046 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:54:13,047 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:54:13,047 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 11:54:13,047 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 11:54:13,047 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 11:54:13,047 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 11:54:13,047 INFO L87 Difference]: Start difference. First operand 194884 states and 876474 transitions. Second operand 3 states. [2018-11-28 11:54:14,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:54:14,788 INFO L93 Difference]: Finished difference Result 194884 states and 876429 transitions. [2018-11-28 11:54:14,789 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 11:54:14,789 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 60 [2018-11-28 11:54:14,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:54:15,314 INFO L225 Difference]: With dead ends: 194884 [2018-11-28 11:54:15,314 INFO L226 Difference]: Without dead ends: 194884 [2018-11-28 11:54:15,315 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 11:54:16,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194884 states. [2018-11-28 11:54:23,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194884 to 194884. [2018-11-28 11:54:23,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194884 states. [2018-11-28 11:54:24,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194884 states to 194884 states and 876429 transitions. [2018-11-28 11:54:24,408 INFO L78 Accepts]: Start accepts. Automaton has 194884 states and 876429 transitions. Word has length 60 [2018-11-28 11:54:24,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:54:24,408 INFO L480 AbstractCegarLoop]: Abstraction has 194884 states and 876429 transitions. [2018-11-28 11:54:24,408 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 11:54:24,408 INFO L276 IsEmpty]: Start isEmpty. Operand 194884 states and 876429 transitions. [2018-11-28 11:54:24,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-11-28 11:54:24,430 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:54:24,431 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:54:24,431 INFO L423 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:54:24,431 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:54:24,431 INFO L82 PathProgramCache]: Analyzing trace with hash 651985896, now seen corresponding path program 1 times [2018-11-28 11:54:24,431 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:54:24,431 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:54:24,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:54:24,433 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:54:24,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:54:24,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:54:24,487 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:54:24,487 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:54:24,487 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 11:54:24,487 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 11:54:24,488 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 11:54:24,488 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 11:54:24,488 INFO L87 Difference]: Start difference. First operand 194884 states and 876429 transitions. Second operand 4 states. [2018-11-28 11:54:25,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:54:25,317 INFO L93 Difference]: Finished difference Result 172220 states and 761291 transitions. [2018-11-28 11:54:25,318 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 11:54:25,318 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 60 [2018-11-28 11:54:25,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:54:25,759 INFO L225 Difference]: With dead ends: 172220 [2018-11-28 11:54:25,759 INFO L226 Difference]: Without dead ends: 169615 [2018-11-28 11:54:25,760 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-11-28 11:54:26,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169615 states. [2018-11-28 11:54:29,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169615 to 169615. [2018-11-28 11:54:29,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169615 states. [2018-11-28 11:54:30,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169615 states to 169615 states and 752619 transitions. [2018-11-28 11:54:30,449 INFO L78 Accepts]: Start accepts. Automaton has 169615 states and 752619 transitions. Word has length 60 [2018-11-28 11:54:30,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:54:30,449 INFO L480 AbstractCegarLoop]: Abstraction has 169615 states and 752619 transitions. [2018-11-28 11:54:30,449 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 11:54:30,449 INFO L276 IsEmpty]: Start isEmpty. Operand 169615 states and 752619 transitions. [2018-11-28 11:54:30,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-11-28 11:54:30,470 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:54:30,470 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] [2018-11-28 11:54:30,470 INFO L423 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:54:30,470 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:54:30,470 INFO L82 PathProgramCache]: Analyzing trace with hash 391005726, now seen corresponding path program 1 times [2018-11-28 11:54:30,470 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:54:30,470 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:54:30,472 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:54:30,472 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:54:30,472 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:54:30,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:54:30,535 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:54:30,535 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:54:30,535 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 11:54:30,536 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 11:54:30,536 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 11:54:30,536 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-28 11:54:30,536 INFO L87 Difference]: Start difference. First operand 169615 states and 752619 transitions. Second operand 5 states. [2018-11-28 11:54:30,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:54:30,777 INFO L93 Difference]: Finished difference Result 59119 states and 239395 transitions. [2018-11-28 11:54:30,778 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 11:54:30,778 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 61 [2018-11-28 11:54:30,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:54:30,896 INFO L225 Difference]: With dead ends: 59119 [2018-11-28 11:54:30,897 INFO L226 Difference]: Without dead ends: 56807 [2018-11-28 11:54:30,897 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-11-28 11:54:31,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56807 states. [2018-11-28 11:54:31,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56807 to 56807. [2018-11-28 11:54:31,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56807 states. [2018-11-28 11:54:31,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56807 states to 56807 states and 230741 transitions. [2018-11-28 11:54:31,770 INFO L78 Accepts]: Start accepts. Automaton has 56807 states and 230741 transitions. Word has length 61 [2018-11-28 11:54:31,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:54:31,770 INFO L480 AbstractCegarLoop]: Abstraction has 56807 states and 230741 transitions. [2018-11-28 11:54:31,770 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 11:54:31,771 INFO L276 IsEmpty]: Start isEmpty. Operand 56807 states and 230741 transitions. [2018-11-28 11:54:31,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-11-28 11:54:31,779 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:54:31,779 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] [2018-11-28 11:54:31,779 INFO L423 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:54:31,779 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:54:31,779 INFO L82 PathProgramCache]: Analyzing trace with hash -393962470, now seen corresponding path program 1 times [2018-11-28 11:54:31,779 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:54:31,779 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:54:31,781 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:54:31,782 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:54:31,782 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:54:31,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:54:31,829 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:54:31,830 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:54:31,830 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 11:54:31,830 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 11:54:31,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 11:54:31,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 11:54:31,831 INFO L87 Difference]: Start difference. First operand 56807 states and 230741 transitions. Second operand 4 states. [2018-11-28 11:54:33,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:54:33,692 INFO L93 Difference]: Finished difference Result 78971 states and 316066 transitions. [2018-11-28 11:54:33,692 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 11:54:33,692 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 67 [2018-11-28 11:54:33,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:54:33,857 INFO L225 Difference]: With dead ends: 78971 [2018-11-28 11:54:33,857 INFO L226 Difference]: Without dead ends: 78971 [2018-11-28 11:54:33,858 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-28 11:54:34,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78971 states. [2018-11-28 11:54:34,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78971 to 61563. [2018-11-28 11:54:34,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61563 states. [2018-11-28 11:54:34,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61563 states to 61563 states and 248434 transitions. [2018-11-28 11:54:34,902 INFO L78 Accepts]: Start accepts. Automaton has 61563 states and 248434 transitions. Word has length 67 [2018-11-28 11:54:34,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:54:34,902 INFO L480 AbstractCegarLoop]: Abstraction has 61563 states and 248434 transitions. [2018-11-28 11:54:34,902 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 11:54:34,902 INFO L276 IsEmpty]: Start isEmpty. Operand 61563 states and 248434 transitions. [2018-11-28 11:54:34,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-11-28 11:54:34,915 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:54:34,915 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] [2018-11-28 11:54:34,915 INFO L423 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:54:34,915 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:54:34,916 INFO L82 PathProgramCache]: Analyzing trace with hash 1348847865, now seen corresponding path program 1 times [2018-11-28 11:54:34,916 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:54:34,916 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:54:34,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:54:34,917 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:54:34,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:54:34,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:54:34,966 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:54:34,966 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:54:34,967 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 11:54:34,967 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 11:54:34,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 11:54:34,967 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 11:54:34,967 INFO L87 Difference]: Start difference. First operand 61563 states and 248434 transitions. Second operand 4 states. [2018-11-28 11:54:35,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:54:35,986 INFO L93 Difference]: Finished difference Result 85638 states and 341484 transitions. [2018-11-28 11:54:35,986 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 11:54:35,986 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 67 [2018-11-28 11:54:35,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:54:36,161 INFO L225 Difference]: With dead ends: 85638 [2018-11-28 11:54:36,161 INFO L226 Difference]: Without dead ends: 85638 [2018-11-28 11:54:36,162 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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-11-28 11:54:36,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85638 states. [2018-11-28 11:54:37,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85638 to 77175. [2018-11-28 11:54:37,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77175 states. [2018-11-28 11:54:37,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77175 states to 77175 states and 309663 transitions. [2018-11-28 11:54:37,381 INFO L78 Accepts]: Start accepts. Automaton has 77175 states and 309663 transitions. Word has length 67 [2018-11-28 11:54:37,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:54:37,382 INFO L480 AbstractCegarLoop]: Abstraction has 77175 states and 309663 transitions. [2018-11-28 11:54:37,382 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 11:54:37,382 INFO L276 IsEmpty]: Start isEmpty. Operand 77175 states and 309663 transitions. [2018-11-28 11:54:37,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-11-28 11:54:37,396 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:54:37,396 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] [2018-11-28 11:54:37,397 INFO L423 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:54:37,397 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:54:37,397 INFO L82 PathProgramCache]: Analyzing trace with hash 1560198778, now seen corresponding path program 1 times [2018-11-28 11:54:37,397 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:54:37,397 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:54:37,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:54:37,398 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:54:37,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:54:37,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:54:37,561 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:54:37,561 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:54:37,561 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 11:54:37,562 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 11:54:37,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 11:54:37,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-28 11:54:37,563 INFO L87 Difference]: Start difference. First operand 77175 states and 309663 transitions. Second operand 6 states. [2018-11-28 11:54:38,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:54:38,369 INFO L93 Difference]: Finished difference Result 119285 states and 470917 transitions. [2018-11-28 11:54:38,369 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 11:54:38,369 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 67 [2018-11-28 11:54:38,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:54:39,026 INFO L225 Difference]: With dead ends: 119285 [2018-11-28 11:54:39,026 INFO L226 Difference]: Without dead ends: 119285 [2018-11-28 11:54:39,026 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-11-28 11:54:39,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119285 states. [2018-11-28 11:54:40,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119285 to 77129. [2018-11-28 11:54:40,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77129 states. [2018-11-28 11:54:40,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77129 states to 77129 states and 303415 transitions. [2018-11-28 11:54:40,472 INFO L78 Accepts]: Start accepts. Automaton has 77129 states and 303415 transitions. Word has length 67 [2018-11-28 11:54:40,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:54:40,472 INFO L480 AbstractCegarLoop]: Abstraction has 77129 states and 303415 transitions. [2018-11-28 11:54:40,472 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 11:54:40,472 INFO L276 IsEmpty]: Start isEmpty. Operand 77129 states and 303415 transitions. [2018-11-28 11:54:40,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-11-28 11:54:40,482 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:54:40,482 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] [2018-11-28 11:54:40,482 INFO L423 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:54:40,482 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:54:40,483 INFO L82 PathProgramCache]: Analyzing trace with hash 1054640153, now seen corresponding path program 1 times [2018-11-28 11:54:40,483 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:54:40,483 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:54:40,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:54:40,484 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:54:40,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:54:40,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:54:40,537 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:54:40,537 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:54:40,537 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 11:54:40,538 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 11:54:40,538 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 11:54:40,538 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-28 11:54:40,538 INFO L87 Difference]: Start difference. First operand 77129 states and 303415 transitions. Second operand 6 states. [2018-11-28 11:54:40,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:54:40,611 INFO L93 Difference]: Finished difference Result 13017 states and 43647 transitions. [2018-11-28 11:54:40,611 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 11:54:40,612 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 67 [2018-11-28 11:54:40,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:54:40,626 INFO L225 Difference]: With dead ends: 13017 [2018-11-28 11:54:40,626 INFO L226 Difference]: Without dead ends: 11037 [2018-11-28 11:54:40,626 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-11-28 11:54:40,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11037 states. [2018-11-28 11:54:40,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11037 to 10667. [2018-11-28 11:54:40,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10667 states. [2018-11-28 11:54:40,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10667 states to 10667 states and 35774 transitions. [2018-11-28 11:54:40,742 INFO L78 Accepts]: Start accepts. Automaton has 10667 states and 35774 transitions. Word has length 67 [2018-11-28 11:54:40,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:54:40,742 INFO L480 AbstractCegarLoop]: Abstraction has 10667 states and 35774 transitions. [2018-11-28 11:54:40,742 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 11:54:40,742 INFO L276 IsEmpty]: Start isEmpty. Operand 10667 states and 35774 transitions. [2018-11-28 11:54:40,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-11-28 11:54:40,752 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:54:40,752 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] [2018-11-28 11:54:40,752 INFO L423 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:54:40,752 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:54:40,752 INFO L82 PathProgramCache]: Analyzing trace with hash 853175647, now seen corresponding path program 1 times [2018-11-28 11:54:40,752 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:54:40,752 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:54:40,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:54:40,754 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:54:40,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:54:40,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:54:40,822 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:54:40,822 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:54:40,822 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 11:54:40,822 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 11:54:40,822 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 11:54:40,822 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 11:54:40,824 INFO L87 Difference]: Start difference. First operand 10667 states and 35774 transitions. Second operand 4 states. [2018-11-28 11:54:40,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:54:40,952 INFO L93 Difference]: Finished difference Result 12962 states and 42885 transitions. [2018-11-28 11:54:40,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 11:54:40,953 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 102 [2018-11-28 11:54:40,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:54:40,974 INFO L225 Difference]: With dead ends: 12962 [2018-11-28 11:54:40,974 INFO L226 Difference]: Without dead ends: 12962 [2018-11-28 11:54:40,975 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-11-28 11:54:40,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12962 states. [2018-11-28 11:54:41,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12962 to 11002. [2018-11-28 11:54:41,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11002 states. [2018-11-28 11:54:41,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11002 states to 11002 states and 36802 transitions. [2018-11-28 11:54:41,105 INFO L78 Accepts]: Start accepts. Automaton has 11002 states and 36802 transitions. Word has length 102 [2018-11-28 11:54:41,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:54:41,106 INFO L480 AbstractCegarLoop]: Abstraction has 11002 states and 36802 transitions. [2018-11-28 11:54:41,106 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 11:54:41,106 INFO L276 IsEmpty]: Start isEmpty. Operand 11002 states and 36802 transitions. [2018-11-28 11:54:41,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-11-28 11:54:41,118 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:54:41,118 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] [2018-11-28 11:54:41,118 INFO L423 AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:54:41,119 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:54:41,119 INFO L82 PathProgramCache]: Analyzing trace with hash -1470852192, now seen corresponding path program 1 times [2018-11-28 11:54:41,119 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:54:41,119 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:54:41,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:54:41,120 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:54:41,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:54:41,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:54:41,150 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:54:41,151 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:54:41,151 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 11:54:41,151 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 11:54:41,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 11:54:41,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 11:54:41,151 INFO L87 Difference]: Start difference. First operand 11002 states and 36802 transitions. Second operand 3 states. [2018-11-28 11:54:41,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:54:41,260 INFO L93 Difference]: Finished difference Result 11537 states and 38330 transitions. [2018-11-28 11:54:41,260 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 11:54:41,260 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 102 [2018-11-28 11:54:41,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:54:41,275 INFO L225 Difference]: With dead ends: 11537 [2018-11-28 11:54:41,275 INFO L226 Difference]: Without dead ends: 11537 [2018-11-28 11:54:41,275 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-11-28 11:54:41,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11537 states. [2018-11-28 11:54:41,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11537 to 11292. [2018-11-28 11:54:41,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11292 states. [2018-11-28 11:54:41,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11292 states to 11292 states and 37634 transitions. [2018-11-28 11:54:41,469 INFO L78 Accepts]: Start accepts. Automaton has 11292 states and 37634 transitions. Word has length 102 [2018-11-28 11:54:41,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:54:41,469 INFO L480 AbstractCegarLoop]: Abstraction has 11292 states and 37634 transitions. [2018-11-28 11:54:41,469 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 11:54:41,469 INFO L276 IsEmpty]: Start isEmpty. Operand 11292 states and 37634 transitions. [2018-11-28 11:54:41,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-11-28 11:54:41,480 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:54:41,480 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] [2018-11-28 11:54:41,480 INFO L423 AbstractCegarLoop]: === Iteration 14 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:54:41,480 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:54:41,480 INFO L82 PathProgramCache]: Analyzing trace with hash -977462835, now seen corresponding path program 1 times [2018-11-28 11:54:41,480 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:54:41,481 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:54:41,482 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:54:41,482 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:54:41,482 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:54:41,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:54:41,572 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:54:41,572 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:54:41,572 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-28 11:54:41,572 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-28 11:54:41,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-28 11:54:41,572 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-11-28 11:54:41,573 INFO L87 Difference]: Start difference. First operand 11292 states and 37634 transitions. Second operand 8 states. [2018-11-28 11:54:42,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:54:42,142 INFO L93 Difference]: Finished difference Result 28455 states and 93181 transitions. [2018-11-28 11:54:42,142 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-28 11:54:42,142 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 102 [2018-11-28 11:54:42,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:54:42,178 INFO L225 Difference]: With dead ends: 28455 [2018-11-28 11:54:42,178 INFO L226 Difference]: Without dead ends: 28327 [2018-11-28 11:54:42,179 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2018-11-28 11:54:42,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28327 states. [2018-11-28 11:54:42,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28327 to 16507. [2018-11-28 11:54:42,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16507 states. [2018-11-28 11:54:42,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16507 states to 16507 states and 54743 transitions. [2018-11-28 11:54:42,426 INFO L78 Accepts]: Start accepts. Automaton has 16507 states and 54743 transitions. Word has length 102 [2018-11-28 11:54:42,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:54:42,427 INFO L480 AbstractCegarLoop]: Abstraction has 16507 states and 54743 transitions. [2018-11-28 11:54:42,427 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-28 11:54:42,427 INFO L276 IsEmpty]: Start isEmpty. Operand 16507 states and 54743 transitions. [2018-11-28 11:54:42,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-11-28 11:54:42,444 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:54:42,445 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] [2018-11-28 11:54:42,445 INFO L423 AbstractCegarLoop]: === Iteration 15 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:54:42,445 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:54:42,445 INFO L82 PathProgramCache]: Analyzing trace with hash -15848818, now seen corresponding path program 1 times [2018-11-28 11:54:42,445 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:54:42,445 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:54:42,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:54:42,447 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:54:42,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:54:42,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:54:42,547 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:54:42,547 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:54:42,547 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 11:54:42,547 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 11:54:42,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 11:54:42,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 11:54:42,548 INFO L87 Difference]: Start difference. First operand 16507 states and 54743 transitions. Second operand 5 states. [2018-11-28 11:54:42,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:54:42,721 INFO L93 Difference]: Finished difference Result 20095 states and 65790 transitions. [2018-11-28 11:54:42,722 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-28 11:54:42,722 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 102 [2018-11-28 11:54:42,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:54:42,746 INFO L225 Difference]: With dead ends: 20095 [2018-11-28 11:54:42,746 INFO L226 Difference]: Without dead ends: 20095 [2018-11-28 11:54:42,746 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-11-28 11:54:42,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20095 states. [2018-11-28 11:54:42,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20095 to 17062. [2018-11-28 11:54:42,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17062 states. [2018-11-28 11:54:42,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17062 states to 17062 states and 56342 transitions. [2018-11-28 11:54:42,951 INFO L78 Accepts]: Start accepts. Automaton has 17062 states and 56342 transitions. Word has length 102 [2018-11-28 11:54:42,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:54:42,951 INFO L480 AbstractCegarLoop]: Abstraction has 17062 states and 56342 transitions. [2018-11-28 11:54:42,951 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 11:54:42,952 INFO L276 IsEmpty]: Start isEmpty. Operand 17062 states and 56342 transitions. [2018-11-28 11:54:42,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-11-28 11:54:42,969 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:54:42,969 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] [2018-11-28 11:54:42,969 INFO L423 AbstractCegarLoop]: === Iteration 16 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:54:42,969 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:54:42,969 INFO L82 PathProgramCache]: Analyzing trace with hash -688642701, now seen corresponding path program 1 times [2018-11-28 11:54:42,969 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:54:42,970 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:54:42,971 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:54:42,971 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:54:42,971 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:54:42,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:54:43,118 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:54:43,118 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:54:43,118 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-28 11:54:43,119 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-28 11:54:43,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-28 11:54:43,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-11-28 11:54:43,119 INFO L87 Difference]: Start difference. First operand 17062 states and 56342 transitions. Second operand 7 states. [2018-11-28 11:54:43,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:54:43,311 INFO L93 Difference]: Finished difference Result 19475 states and 63933 transitions. [2018-11-28 11:54:43,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 11:54:43,311 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 102 [2018-11-28 11:54:43,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:54:43,335 INFO L225 Difference]: With dead ends: 19475 [2018-11-28 11:54:43,335 INFO L226 Difference]: Without dead ends: 19475 [2018-11-28 11:54:43,336 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-11-28 11:54:43,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19475 states. [2018-11-28 11:54:43,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19475 to 17802. [2018-11-28 11:54:43,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17802 states. [2018-11-28 11:54:43,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17802 states to 17802 states and 58579 transitions. [2018-11-28 11:54:43,545 INFO L78 Accepts]: Start accepts. Automaton has 17802 states and 58579 transitions. Word has length 102 [2018-11-28 11:54:43,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:54:43,545 INFO L480 AbstractCegarLoop]: Abstraction has 17802 states and 58579 transitions. [2018-11-28 11:54:43,545 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-28 11:54:43,545 INFO L276 IsEmpty]: Start isEmpty. Operand 17802 states and 58579 transitions. [2018-11-28 11:54:43,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-11-28 11:54:43,562 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:54:43,563 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] [2018-11-28 11:54:43,563 INFO L423 AbstractCegarLoop]: === Iteration 17 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:54:43,563 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:54:43,563 INFO L82 PathProgramCache]: Analyzing trace with hash 1282296756, now seen corresponding path program 1 times [2018-11-28 11:54:43,563 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:54:43,563 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:54:43,565 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:54:43,565 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:54:43,565 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:54:43,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:54:43,663 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:54:43,664 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:54:43,664 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 11:54:43,664 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 11:54:43,664 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 11:54:43,664 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-28 11:54:43,664 INFO L87 Difference]: Start difference. First operand 17802 states and 58579 transitions. Second operand 5 states. [2018-11-28 11:54:43,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:54:43,774 INFO L93 Difference]: Finished difference Result 13507 states and 44587 transitions. [2018-11-28 11:54:43,774 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 11:54:43,774 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 102 [2018-11-28 11:54:43,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:54:43,791 INFO L225 Difference]: With dead ends: 13507 [2018-11-28 11:54:43,791 INFO L226 Difference]: Without dead ends: 13507 [2018-11-28 11:54:43,791 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-11-28 11:54:43,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13507 states. [2018-11-28 11:54:43,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13507 to 12707. [2018-11-28 11:54:43,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12707 states. [2018-11-28 11:54:43,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12707 states to 12707 states and 42212 transitions. [2018-11-28 11:54:43,935 INFO L78 Accepts]: Start accepts. Automaton has 12707 states and 42212 transitions. Word has length 102 [2018-11-28 11:54:43,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:54:43,936 INFO L480 AbstractCegarLoop]: Abstraction has 12707 states and 42212 transitions. [2018-11-28 11:54:43,936 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 11:54:43,936 INFO L276 IsEmpty]: Start isEmpty. Operand 12707 states and 42212 transitions. [2018-11-28 11:54:43,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-11-28 11:54:43,948 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:54:43,948 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] [2018-11-28 11:54:43,948 INFO L423 AbstractCegarLoop]: === Iteration 18 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:54:43,949 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:54:43,949 INFO L82 PathProgramCache]: Analyzing trace with hash 114990225, now seen corresponding path program 1 times [2018-11-28 11:54:43,949 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:54:43,949 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:54:43,950 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:54:43,950 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:54:43,950 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:54:43,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:54:44,048 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:54:44,048 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:54:44,049 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 11:54:44,049 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 11:54:44,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 11:54:44,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-28 11:54:44,049 INFO L87 Difference]: Start difference. First operand 12707 states and 42212 transitions. Second operand 6 states. [2018-11-28 11:54:44,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:54:44,148 INFO L93 Difference]: Finished difference Result 11427 states and 37284 transitions. [2018-11-28 11:54:44,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 11:54:44,148 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 102 [2018-11-28 11:54:44,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:54:44,167 INFO L225 Difference]: With dead ends: 11427 [2018-11-28 11:54:44,167 INFO L226 Difference]: Without dead ends: 11427 [2018-11-28 11:54:44,167 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-11-28 11:54:44,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11427 states. [2018-11-28 11:54:44,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11427 to 9460. [2018-11-28 11:54:44,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9460 states. [2018-11-28 11:54:44,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9460 states to 9460 states and 31265 transitions. [2018-11-28 11:54:44,289 INFO L78 Accepts]: Start accepts. Automaton has 9460 states and 31265 transitions. Word has length 102 [2018-11-28 11:54:44,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:54:44,289 INFO L480 AbstractCegarLoop]: Abstraction has 9460 states and 31265 transitions. [2018-11-28 11:54:44,289 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 11:54:44,290 INFO L276 IsEmpty]: Start isEmpty. Operand 9460 states and 31265 transitions. [2018-11-28 11:54:44,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-11-28 11:54:44,299 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:54:44,299 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] [2018-11-28 11:54:44,299 INFO L423 AbstractCegarLoop]: === Iteration 19 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:54:44,299 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:54:44,299 INFO L82 PathProgramCache]: Analyzing trace with hash 1432893840, now seen corresponding path program 1 times [2018-11-28 11:54:44,299 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:54:44,299 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:54:44,300 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:54:44,301 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:54:44,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:54:44,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:54:44,414 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:54:44,414 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:54:44,414 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 11:54:44,414 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 11:54:44,414 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 11:54:44,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-28 11:54:44,415 INFO L87 Difference]: Start difference. First operand 9460 states and 31265 transitions. Second operand 6 states. [2018-11-28 11:54:44,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:54:44,608 INFO L93 Difference]: Finished difference Result 10735 states and 34540 transitions. [2018-11-28 11:54:44,608 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-28 11:54:44,608 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 104 [2018-11-28 11:54:44,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:54:44,621 INFO L225 Difference]: With dead ends: 10735 [2018-11-28 11:54:44,621 INFO L226 Difference]: Without dead ends: 10735 [2018-11-28 11:54:44,621 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2018-11-28 11:54:44,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10735 states. [2018-11-28 11:54:44,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10735 to 9650. [2018-11-28 11:54:44,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9650 states. [2018-11-28 11:54:44,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9650 states to 9650 states and 31497 transitions. [2018-11-28 11:54:44,727 INFO L78 Accepts]: Start accepts. Automaton has 9650 states and 31497 transitions. Word has length 104 [2018-11-28 11:54:44,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:54:44,728 INFO L480 AbstractCegarLoop]: Abstraction has 9650 states and 31497 transitions. [2018-11-28 11:54:44,728 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 11:54:44,728 INFO L276 IsEmpty]: Start isEmpty. Operand 9650 states and 31497 transitions. [2018-11-28 11:54:44,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-11-28 11:54:44,736 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:54:44,736 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] [2018-11-28 11:54:44,736 INFO L423 AbstractCegarLoop]: === Iteration 20 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:54:44,737 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:54:44,737 INFO L82 PathProgramCache]: Analyzing trace with hash 984197201, now seen corresponding path program 1 times [2018-11-28 11:54:44,737 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:54:44,737 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:54:44,737 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:54:44,738 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:54:44,738 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:54:44,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:54:44,809 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:54:44,809 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:54:44,809 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 11:54:44,809 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 11:54:44,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 11:54:44,810 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 11:54:44,810 INFO L87 Difference]: Start difference. First operand 9650 states and 31497 transitions. Second operand 5 states. [2018-11-28 11:54:44,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:54:44,940 INFO L93 Difference]: Finished difference Result 10930 states and 35657 transitions. [2018-11-28 11:54:44,940 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 11:54:44,940 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 104 [2018-11-28 11:54:44,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:54:44,953 INFO L225 Difference]: With dead ends: 10930 [2018-11-28 11:54:44,953 INFO L226 Difference]: Without dead ends: 10930 [2018-11-28 11:54:44,954 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-11-28 11:54:44,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10930 states. [2018-11-28 11:54:45,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10930 to 9842. [2018-11-28 11:54:45,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9842 states. [2018-11-28 11:54:45,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9842 states to 9842 states and 32121 transitions. [2018-11-28 11:54:45,088 INFO L78 Accepts]: Start accepts. Automaton has 9842 states and 32121 transitions. Word has length 104 [2018-11-28 11:54:45,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:54:45,088 INFO L480 AbstractCegarLoop]: Abstraction has 9842 states and 32121 transitions. [2018-11-28 11:54:45,088 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 11:54:45,088 INFO L276 IsEmpty]: Start isEmpty. Operand 9842 states and 32121 transitions. [2018-11-28 11:54:45,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-11-28 11:54:45,097 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:54:45,098 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] [2018-11-28 11:54:45,098 INFO L423 AbstractCegarLoop]: === Iteration 21 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:54:45,098 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:54:45,098 INFO L82 PathProgramCache]: Analyzing trace with hash -2066005614, now seen corresponding path program 1 times [2018-11-28 11:54:45,098 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:54:45,098 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:54:45,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:54:45,099 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:54:45,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:54:45,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:54:45,206 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:54:45,206 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:54:45,206 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-28 11:54:45,206 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-28 11:54:45,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-28 11:54:45,207 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-28 11:54:45,207 INFO L87 Difference]: Start difference. First operand 9842 states and 32121 transitions. Second operand 7 states. [2018-11-28 11:54:45,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:54:45,480 INFO L93 Difference]: Finished difference Result 18994 states and 62054 transitions. [2018-11-28 11:54:45,480 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-28 11:54:45,480 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 104 [2018-11-28 11:54:45,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:54:45,491 INFO L225 Difference]: With dead ends: 18994 [2018-11-28 11:54:45,491 INFO L226 Difference]: Without dead ends: 9239 [2018-11-28 11:54:45,491 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2018-11-28 11:54:45,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9239 states. [2018-11-28 11:54:45,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9239 to 9031. [2018-11-28 11:54:45,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9031 states. [2018-11-28 11:54:45,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9031 states to 9031 states and 29563 transitions. [2018-11-28 11:54:45,587 INFO L78 Accepts]: Start accepts. Automaton has 9031 states and 29563 transitions. Word has length 104 [2018-11-28 11:54:45,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:54:45,587 INFO L480 AbstractCegarLoop]: Abstraction has 9031 states and 29563 transitions. [2018-11-28 11:54:45,587 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-28 11:54:45,587 INFO L276 IsEmpty]: Start isEmpty. Operand 9031 states and 29563 transitions. [2018-11-28 11:54:45,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-11-28 11:54:45,595 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:54:45,596 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] [2018-11-28 11:54:45,596 INFO L423 AbstractCegarLoop]: === Iteration 22 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:54:45,596 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:54:45,596 INFO L82 PathProgramCache]: Analyzing trace with hash 834644247, now seen corresponding path program 1 times [2018-11-28 11:54:45,596 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:54:45,596 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:54:45,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:54:45,597 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:54:45,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:54:45,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:54:45,731 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:54:45,731 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:54:45,731 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-28 11:54:45,731 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-28 11:54:45,731 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-28 11:54:45,731 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-11-28 11:54:45,732 INFO L87 Difference]: Start difference. First operand 9031 states and 29563 transitions. Second operand 7 states. [2018-11-28 11:54:45,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:54:45,936 INFO L93 Difference]: Finished difference Result 10102 states and 32606 transitions. [2018-11-28 11:54:45,937 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-28 11:54:45,937 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 104 [2018-11-28 11:54:45,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:54:45,949 INFO L225 Difference]: With dead ends: 10102 [2018-11-28 11:54:45,949 INFO L226 Difference]: Without dead ends: 10102 [2018-11-28 11:54:45,949 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 4 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=141, Unknown=0, NotChecked=0, Total=210 [2018-11-28 11:54:45,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10102 states. [2018-11-28 11:54:46,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10102 to 9398. [2018-11-28 11:54:46,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9398 states. [2018-11-28 11:54:46,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9398 states to 9398 states and 30574 transitions. [2018-11-28 11:54:46,066 INFO L78 Accepts]: Start accepts. Automaton has 9398 states and 30574 transitions. Word has length 104 [2018-11-28 11:54:46,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:54:46,066 INFO L480 AbstractCegarLoop]: Abstraction has 9398 states and 30574 transitions. [2018-11-28 11:54:46,066 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-28 11:54:46,066 INFO L276 IsEmpty]: Start isEmpty. Operand 9398 states and 30574 transitions. [2018-11-28 11:54:46,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-11-28 11:54:46,077 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:54:46,077 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] [2018-11-28 11:54:46,077 INFO L423 AbstractCegarLoop]: === Iteration 23 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:54:46,078 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:54:46,078 INFO L82 PathProgramCache]: Analyzing trace with hash -1827519050, now seen corresponding path program 2 times [2018-11-28 11:54:46,078 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:54:46,078 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:54:46,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:54:46,079 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:54:46,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:54:46,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:54:46,196 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:54:46,196 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:54:46,196 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-11-28 11:54:46,197 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-28 11:54:46,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-28 11:54:46,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-11-28 11:54:46,197 INFO L87 Difference]: Start difference. First operand 9398 states and 30574 transitions. Second operand 12 states. [2018-11-28 11:54:46,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:54:46,643 INFO L93 Difference]: Finished difference Result 16786 states and 55343 transitions. [2018-11-28 11:54:46,643 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-11-28 11:54:46,643 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 104 [2018-11-28 11:54:46,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:54:46,658 INFO L225 Difference]: With dead ends: 16786 [2018-11-28 11:54:46,658 INFO L226 Difference]: Without dead ends: 12882 [2018-11-28 11:54:46,658 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=100, Invalid=550, Unknown=0, NotChecked=0, Total=650 [2018-11-28 11:54:46,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12882 states. [2018-11-28 11:54:46,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12882 to 11934. [2018-11-28 11:54:46,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11934 states. [2018-11-28 11:54:46,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11934 states to 11934 states and 38312 transitions. [2018-11-28 11:54:46,792 INFO L78 Accepts]: Start accepts. Automaton has 11934 states and 38312 transitions. Word has length 104 [2018-11-28 11:54:46,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:54:46,792 INFO L480 AbstractCegarLoop]: Abstraction has 11934 states and 38312 transitions. [2018-11-28 11:54:46,792 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-28 11:54:46,793 INFO L276 IsEmpty]: Start isEmpty. Operand 11934 states and 38312 transitions. [2018-11-28 11:54:46,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-11-28 11:54:46,804 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:54:46,804 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] [2018-11-28 11:54:46,804 INFO L423 AbstractCegarLoop]: === Iteration 24 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:54:46,805 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:54:46,805 INFO L82 PathProgramCache]: Analyzing trace with hash 983882008, now seen corresponding path program 3 times [2018-11-28 11:54:46,805 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:54:46,805 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:54:46,806 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:54:46,806 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 11:54:46,806 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:54:46,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:54:46,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:54:46,872 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-11-28 11:54:46,991 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-11-28 11:54:46,992 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 11:54:46 BasicIcfg [2018-11-28 11:54:46,992 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-28 11:54:46,993 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-28 11:54:46,993 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-28 11:54:46,993 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-28 11:54:46,993 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:53:16" (3/4) ... [2018-11-28 11:54:46,996 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-11-28 11:54:47,115 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_34c20c6a-e99c-40e7-9151-be0723070517/bin-2019/uautomizer/witness.graphml [2018-11-28 11:54:47,115 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-28 11:54:47,116 INFO L168 Benchmark]: Toolchain (without parser) took 91512.93 ms. Allocated memory was 1.0 GB in the beginning and 6.8 GB in the end (delta: 5.8 GB). Free memory was 956.7 MB in the beginning and 5.1 GB in the end (delta: -4.1 GB). Peak memory consumption was 1.7 GB. Max. memory is 11.5 GB. [2018-11-28 11:54:47,117 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 1.0 GB. Free memory is still 984.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 11:54:47,117 INFO L168 Benchmark]: CACSL2BoogieTranslator took 407.95 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.4 MB). Free memory was 956.7 MB in the beginning and 1.1 GB in the end (delta: -157.9 MB). Peak memory consumption was 34.0 MB. Max. memory is 11.5 GB. [2018-11-28 11:54:47,118 INFO L168 Benchmark]: Boogie Procedure Inliner took 43.34 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: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. [2018-11-28 11:54:47,118 INFO L168 Benchmark]: Boogie Preprocessor took 22.70 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: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. [2018-11-28 11:54:47,118 INFO L168 Benchmark]: RCFGBuilder took 463.63 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: 48.4 MB). Peak memory consumption was 48.4 MB. Max. memory is 11.5 GB. [2018-11-28 11:54:47,118 INFO L168 Benchmark]: TraceAbstraction took 90449.52 ms. Allocated memory was 1.2 GB in the beginning and 6.8 GB in the end (delta: 5.7 GB). Free memory was 1.1 GB in the beginning and 5.1 GB in the end (delta: -4.0 GB). Peak memory consumption was 1.6 GB. Max. memory is 11.5 GB. [2018-11-28 11:54:47,118 INFO L168 Benchmark]: Witness Printer took 122.58 ms. Allocated memory is still 6.8 GB. Free memory was 5.1 GB in the beginning and 5.1 GB in the end (delta: 40.7 MB). Peak memory consumption was 40.7 MB. Max. memory is 11.5 GB. [2018-11-28 11:54:47,120 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.20 ms. Allocated memory is still 1.0 GB. Free memory is still 984.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 407.95 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.4 MB). Free memory was 956.7 MB in the beginning and 1.1 GB in the end (delta: -157.9 MB). Peak memory consumption was 34.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 43.34 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: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 22.70 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: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 463.63 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: 48.4 MB). Peak memory consumption was 48.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 90449.52 ms. Allocated memory was 1.2 GB in the beginning and 6.8 GB in the end (delta: 5.7 GB). Free memory was 1.1 GB in the beginning and 5.1 GB in the end (delta: -4.0 GB). Peak memory consumption was 1.6 GB. Max. memory is 11.5 GB. * Witness Printer took 122.58 ms. Allocated memory is still 6.8 GB. Free memory was 5.1 GB in the beginning and 5.1 GB in the end (delta: 40.7 MB). Peak memory consumption was 40.7 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] [L678] -1 int a = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0] [L679] -1 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0] [L680] -1 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0] [L682] -1 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L684] -1 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L685] -1 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L686] -1 int y$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L687] -1 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=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] [L688] -1 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=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] [L689] -1 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=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] [L690] -1 _Bool y$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=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] [L691] -1 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=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] [L692] -1 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=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] [L693] -1 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=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] [L694] -1 _Bool y$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=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] [L695] -1 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=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] [L696] -1 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=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}] [L697] -1 int y$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=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] [L698] -1 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=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] [L699] -1 int y$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=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] [L700] -1 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=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] [L702] -1 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=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] [L703] -1 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=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] [L704] -1 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=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] [L786] -1 pthread_t t1210; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=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] [L787] FCALL, FORK -1 pthread_create(&t1210, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=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] [L788] -1 pthread_t t1211; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=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] [L789] FCALL, FORK -1 pthread_create(&t1211, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=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] [L790] -1 pthread_t t1212; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=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] [L791] FCALL, FORK -1 pthread_create(&t1212, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=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] [L743] 0 y$w_buff1 = y$w_buff0 [L744] 0 y$w_buff0 = 2 [L745] 0 y$w_buff1_used = y$w_buff0_used [L746] 0 y$w_buff0_used = (_Bool)1 [L4] COND FALSE 0 !(!expression) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=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] [L748] 0 y$r_buff1_thd0 = y$r_buff0_thd0 [L749] 0 y$r_buff1_thd1 = y$r_buff0_thd1 [L750] 0 y$r_buff1_thd2 = y$r_buff0_thd2 [L751] 0 y$r_buff1_thd3 = y$r_buff0_thd3 [L752] 0 y$r_buff0_thd3 = (_Bool)1 [L755] 0 z = 1 [L758] 0 __unbuffered_p2_EAX = z [L761] 0 __unbuffered_p2_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L764] 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=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L708] 1 a = 1 [L711] 1 x = 1 [L716] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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] [L723] 2 x = 2 [L726] 2 y = 1 VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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] [L764] 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) [L765] EXPR 0 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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] [L729] 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=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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] [L765] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L729] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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, y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y=2, z=1] [L766] 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=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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, y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y=2, z=1] [L766] 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 [L729] 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=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y)=2, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y=2, z=1] [L729] 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) [L730] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L730] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L767] EXPR 0 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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] [L767] 0 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L731] 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=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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_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] [L768] 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=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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_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] [L731] 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 [L732] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L732] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L733] 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=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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_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] [L733] 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 [L736] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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] [L768] 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 [L771] 0 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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] [L793] -1 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, 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] [L797] 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=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, 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] [L797] EXPR -1 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, 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] [L797] 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=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, 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] [L797] -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) [L798] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, 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] [L798] -1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L799] 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=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, 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] [L799] -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 [L800] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, 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] [L800] -1 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L801] 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=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, 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 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 [L804] -1 weak$$choice0 = __VERIFIER_nondet_pointer() [L805] -1 weak$$choice2 = __VERIFIER_nondet_pointer() [L806] -1 y$flush_delayed = weak$$choice2 [L807] -1 y$mem_tmp = y VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=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] [L808] 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=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=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] [L808] -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) [L809] 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=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=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] [L809] -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)) [L810] 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=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=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] [L810] -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)) [L811] 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=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=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] [L811] -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)) [L812] 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=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=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] [L812] -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)) [L813] 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=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=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] [L813] -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)) [L814] 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=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=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] [L814] -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)) [L815] -1 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=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$flush_delayed ? y$mem_tmp : y VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=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$flush_delayed ? y$mem_tmp : y [L817] -1 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=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=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=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=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=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, 200 locations, 3 error locations. UNSAFE Result, 90.3s OverallTime, 24 OverallIterations, 1 TraceHistogramMax, 23.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 5756 SDtfs, 5408 SDslu, 12822 SDs, 0 SdLazy, 4074 SolverSat, 266 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 226 GetRequests, 72 SyntacticMatches, 18 SemanticMatches, 136 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 147 ImplicationChecksByTransitivity, 1.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=194884occurred in iteration=4, 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: 47.6s AutomataMinimizationTime, 23 MinimizatonAttempts, 454728 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 1989 NumberOfCodeBlocks, 1989 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 1862 ConstructedInterpolants, 0 QuantifiedInterpolants, 379997 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 23 InterpolantComputations, 23 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...