./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix041_power.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_2ba2babb-e1a9-44a9-9705-473d65fcfe98/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_2ba2babb-e1a9-44a9-9705-473d65fcfe98/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_2ba2babb-e1a9-44a9-9705-473d65fcfe98/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_2ba2babb-e1a9-44a9-9705-473d65fcfe98/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix041_power.opt_false-unreach-call.i -s /tmp/vcloud-vcloud-master/worker/working_dir_2ba2babb-e1a9-44a9-9705-473d65fcfe98/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_2ba2babb-e1a9-44a9-9705-473d65fcfe98/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 6d63aff9b017c63416774dd6f8f2467682d2e239 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 13:35:07,064 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-28 13:35:07,065 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-28 13:35:07,073 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-28 13:35:07,073 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-28 13:35:07,074 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-28 13:35:07,075 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-28 13:35:07,076 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-28 13:35:07,077 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-28 13:35:07,077 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-28 13:35:07,078 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-28 13:35:07,078 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-28 13:35:07,079 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-28 13:35:07,079 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-28 13:35:07,080 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-28 13:35:07,080 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-28 13:35:07,081 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-28 13:35:07,082 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-28 13:35:07,083 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-28 13:35:07,084 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-28 13:35:07,084 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-28 13:35:07,085 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-28 13:35:07,086 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-28 13:35:07,086 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-28 13:35:07,086 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-28 13:35:07,087 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-28 13:35:07,087 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-28 13:35:07,088 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-28 13:35:07,088 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-28 13:35:07,089 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-28 13:35:07,089 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-28 13:35:07,090 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-28 13:35:07,090 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-28 13:35:07,090 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-28 13:35:07,091 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-28 13:35:07,091 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-28 13:35:07,091 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_2ba2babb-e1a9-44a9-9705-473d65fcfe98/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-28 13:35:07,099 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-28 13:35:07,099 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-28 13:35:07,099 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-28 13:35:07,100 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-28 13:35:07,100 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-28 13:35:07,100 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-28 13:35:07,100 INFO L133 SettingsManager]: * Use SBE=true [2018-11-28 13:35:07,101 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-28 13:35:07,101 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-28 13:35:07,101 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-28 13:35:07,101 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-28 13:35:07,101 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-28 13:35:07,101 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-28 13:35:07,102 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-28 13:35:07,102 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-28 13:35:07,102 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-28 13:35:07,102 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-28 13:35:07,102 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-28 13:35:07,102 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-28 13:35:07,102 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-28 13:35:07,103 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-28 13:35:07,103 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-28 13:35:07,103 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-28 13:35:07,103 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-28 13:35:07,103 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-28 13:35:07,103 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-28 13:35:07,104 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-28 13:35:07,104 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-28 13:35:07,104 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-28 13:35:07,104 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-28 13:35:07,104 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_2ba2babb-e1a9-44a9-9705-473d65fcfe98/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 -> 6d63aff9b017c63416774dd6f8f2467682d2e239 [2018-11-28 13:35:07,127 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-28 13:35:07,136 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-28 13:35:07,139 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-28 13:35:07,140 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-28 13:35:07,141 INFO L276 PluginConnector]: CDTParser initialized [2018-11-28 13:35:07,141 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_2ba2babb-e1a9-44a9-9705-473d65fcfe98/bin-2019/uautomizer/../../sv-benchmarks/c/pthread-wmm/mix041_power.opt_false-unreach-call.i [2018-11-28 13:35:07,186 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_2ba2babb-e1a9-44a9-9705-473d65fcfe98/bin-2019/uautomizer/data/91b05807b/d123e0b8d7a94964861871df199ddca5/FLAG5525ae897 [2018-11-28 13:35:07,566 INFO L307 CDTParser]: Found 1 translation units. [2018-11-28 13:35:07,567 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_2ba2babb-e1a9-44a9-9705-473d65fcfe98/sv-benchmarks/c/pthread-wmm/mix041_power.opt_false-unreach-call.i [2018-11-28 13:35:07,576 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_2ba2babb-e1a9-44a9-9705-473d65fcfe98/bin-2019/uautomizer/data/91b05807b/d123e0b8d7a94964861871df199ddca5/FLAG5525ae897 [2018-11-28 13:35:07,941 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_2ba2babb-e1a9-44a9-9705-473d65fcfe98/bin-2019/uautomizer/data/91b05807b/d123e0b8d7a94964861871df199ddca5 [2018-11-28 13:35:07,943 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-28 13:35:07,944 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-28 13:35:07,945 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-28 13:35:07,945 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-28 13:35:07,948 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-28 13:35:07,948 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 01:35:07" (1/1) ... [2018-11-28 13:35:07,950 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@54baf904 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:35:07, skipping insertion in model container [2018-11-28 13:35:07,951 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 01:35:07" (1/1) ... [2018-11-28 13:35:07,956 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-28 13:35:07,985 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-28 13:35:08,207 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 13:35:08,214 INFO L191 MainTranslator]: Completed pre-run [2018-11-28 13:35:08,292 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 13:35:08,332 INFO L195 MainTranslator]: Completed translation [2018-11-28 13:35:08,333 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:35:08 WrapperNode [2018-11-28 13:35:08,333 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-28 13:35:08,334 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-28 13:35:08,334 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-28 13:35:08,334 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-28 13:35:08,340 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:35:08" (1/1) ... [2018-11-28 13:35:08,350 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:35:08" (1/1) ... [2018-11-28 13:35:08,367 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-28 13:35:08,367 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-28 13:35:08,367 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-28 13:35:08,367 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-28 13:35:08,373 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:35:08" (1/1) ... [2018-11-28 13:35:08,373 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:35:08" (1/1) ... [2018-11-28 13:35:08,376 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:35:08" (1/1) ... [2018-11-28 13:35:08,377 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:35:08" (1/1) ... [2018-11-28 13:35:08,385 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:35:08" (1/1) ... [2018-11-28 13:35:08,388 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:35:08" (1/1) ... [2018-11-28 13:35:08,390 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:35:08" (1/1) ... [2018-11-28 13:35:08,393 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-28 13:35:08,393 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-28 13:35:08,393 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-28 13:35:08,393 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-28 13:35:08,394 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:35:08" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2ba2babb-e1a9-44a9-9705-473d65fcfe98/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 13:35:08,428 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-28 13:35:08,429 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-28 13:35:08,429 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2018-11-28 13:35:08,429 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-28 13:35:08,429 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2018-11-28 13:35:08,429 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2018-11-28 13:35:08,429 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2018-11-28 13:35:08,429 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2018-11-28 13:35:08,429 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2018-11-28 13:35:08,429 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-28 13:35:08,429 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-28 13:35:08,430 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 13:35:08,854 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-28 13:35:08,854 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-11-28 13:35:08,855 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 01:35:08 BoogieIcfgContainer [2018-11-28 13:35:08,855 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-28 13:35:08,855 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-28 13:35:08,855 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-28 13:35:08,857 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-28 13:35:08,857 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 01:35:07" (1/3) ... [2018-11-28 13:35:08,858 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74edae51 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 01:35:08, skipping insertion in model container [2018-11-28 13:35:08,858 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:35:08" (2/3) ... [2018-11-28 13:35:08,858 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74edae51 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 01:35:08, skipping insertion in model container [2018-11-28 13:35:08,858 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 01:35:08" (3/3) ... [2018-11-28 13:35:08,859 INFO L112 eAbstractionObserver]: Analyzing ICFG mix041_power.opt_false-unreach-call.i [2018-11-28 13:35:08,881 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:35:08,881 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:35:08,881 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:35:08,882 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:35:08,882 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:35:08,882 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:35:08,882 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:35:08,882 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:35:08,882 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:35:08,882 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:35:08,883 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:35:08,883 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:35:08,883 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:35:08,883 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:35:08,883 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:35:08,883 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:35:08,884 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:35:08,884 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:35:08,884 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:35:08,884 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:35:08,884 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:35:08,884 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:35:08,885 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:35:08,885 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:35:08,885 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:35:08,885 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:35:08,885 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:35:08,885 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:35:08,885 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:35:08,886 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:35:08,886 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:35:08,886 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:35:08,886 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:35:08,886 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:35:08,887 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:35:08,887 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:35:08,887 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:35:08,887 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:35:08,887 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:35:08,887 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:35:08,887 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:35:08,888 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:35:08,888 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:35:08,888 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:35:08,888 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:35:08,888 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:35:08,888 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:35:08,889 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:35:08,889 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:35:08,889 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:35:08,889 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:35:08,889 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:35:08,889 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:35:08,889 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:35:08,889 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:35:08,889 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:35:08,889 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:35:08,890 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:35:08,890 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:35:08,890 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:35:08,890 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:35:08,890 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:35:08,890 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:35:08,890 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:35:08,890 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:35:08,890 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:35:08,890 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet16.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:35:08,890 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet16.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:35:08,890 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:35:08,891 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:35:08,891 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet16.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:35:08,891 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet16.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:35:08,894 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2018-11-28 13:35:08,894 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-28 13:35:08,899 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-11-28 13:35:08,908 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2018-11-28 13:35:08,926 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-28 13:35:08,926 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-28 13:35:08,926 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-28 13:35:08,926 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-28 13:35:08,927 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-28 13:35:08,927 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-28 13:35:08,927 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-28 13:35:08,927 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-28 13:35:08,927 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-28 13:35:08,933 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 143places, 181 transitions [2018-11-28 13:35:10,071 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 25089 states. [2018-11-28 13:35:10,073 INFO L276 IsEmpty]: Start isEmpty. Operand 25089 states. [2018-11-28 13:35:10,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-11-28 13:35:10,079 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:35:10,079 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] [2018-11-28 13:35:10,081 INFO L423 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:35:10,085 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:35:10,085 INFO L82 PathProgramCache]: Analyzing trace with hash 224065163, now seen corresponding path program 1 times [2018-11-28 13:35:10,086 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:35:10,087 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:35:10,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:35:10,123 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:35:10,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:35:10,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:35:10,261 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 13:35:10,262 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:35:10,262 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 13:35:10,265 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 13:35:10,273 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 13:35:10,273 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 13:35:10,275 INFO L87 Difference]: Start difference. First operand 25089 states. Second operand 4 states. [2018-11-28 13:35:10,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:35:10,824 INFO L93 Difference]: Finished difference Result 45389 states and 177627 transitions. [2018-11-28 13:35:10,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 13:35:10,825 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 38 [2018-11-28 13:35:10,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:35:11,030 INFO L225 Difference]: With dead ends: 45389 [2018-11-28 13:35:11,031 INFO L226 Difference]: Without dead ends: 40629 [2018-11-28 13:35:11,032 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 13:35:11,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40629 states. [2018-11-28 13:35:11,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40629 to 23663. [2018-11-28 13:35:11,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23663 states. [2018-11-28 13:35:11,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23663 states to 23663 states and 92544 transitions. [2018-11-28 13:35:11,910 INFO L78 Accepts]: Start accepts. Automaton has 23663 states and 92544 transitions. Word has length 38 [2018-11-28 13:35:11,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:35:11,910 INFO L480 AbstractCegarLoop]: Abstraction has 23663 states and 92544 transitions. [2018-11-28 13:35:11,910 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 13:35:11,911 INFO L276 IsEmpty]: Start isEmpty. Operand 23663 states and 92544 transitions. [2018-11-28 13:35:11,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-11-28 13:35:11,914 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:35:11,916 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 13:35:11,916 INFO L423 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:35:11,916 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:35:11,916 INFO L82 PathProgramCache]: Analyzing trace with hash -2113194510, now seen corresponding path program 1 times [2018-11-28 13:35:11,917 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:35:11,917 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:35:11,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:35:11,921 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:35:11,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:35:11,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:35:11,970 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 13:35:11,970 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:35:11,970 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 13:35:11,971 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 13:35:11,972 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 13:35:11,972 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 13:35:11,972 INFO L87 Difference]: Start difference. First operand 23663 states and 92544 transitions. Second operand 3 states. [2018-11-28 13:35:12,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:35:12,186 INFO L93 Difference]: Finished difference Result 23663 states and 92160 transitions. [2018-11-28 13:35:12,187 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 13:35:12,187 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 45 [2018-11-28 13:35:12,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:35:12,236 INFO L225 Difference]: With dead ends: 23663 [2018-11-28 13:35:12,236 INFO L226 Difference]: Without dead ends: 23663 [2018-11-28 13:35:12,237 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 13:35:12,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23663 states. [2018-11-28 13:35:12,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23663 to 23663. [2018-11-28 13:35:12,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23663 states. [2018-11-28 13:35:12,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23663 states to 23663 states and 92160 transitions. [2018-11-28 13:35:12,944 INFO L78 Accepts]: Start accepts. Automaton has 23663 states and 92160 transitions. Word has length 45 [2018-11-28 13:35:12,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:35:12,944 INFO L480 AbstractCegarLoop]: Abstraction has 23663 states and 92160 transitions. [2018-11-28 13:35:12,945 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 13:35:12,945 INFO L276 IsEmpty]: Start isEmpty. Operand 23663 states and 92160 transitions. [2018-11-28 13:35:12,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-11-28 13:35:12,946 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:35:12,947 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 13:35:12,947 INFO L423 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:35:12,947 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:35:12,947 INFO L82 PathProgramCache]: Analyzing trace with hash 384821427, now seen corresponding path program 1 times [2018-11-28 13:35:12,947 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:35:12,947 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:35:12,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:35:12,950 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:35:12,950 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:35:12,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:35:13,019 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 13:35:13,020 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:35:13,020 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 13:35:13,020 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 13:35:13,020 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 13:35:13,020 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 13:35:13,020 INFO L87 Difference]: Start difference. First operand 23663 states and 92160 transitions. Second operand 5 states. [2018-11-28 13:35:13,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:35:13,910 INFO L93 Difference]: Finished difference Result 64831 states and 240932 transitions. [2018-11-28 13:35:13,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-28 13:35:13,911 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 45 [2018-11-28 13:35:13,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:35:14,109 INFO L225 Difference]: With dead ends: 64831 [2018-11-28 13:35:14,109 INFO L226 Difference]: Without dead ends: 64671 [2018-11-28 13:35:14,110 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 13:35:14,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64671 states. [2018-11-28 13:35:15,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64671 to 37143. [2018-11-28 13:35:15,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37143 states. [2018-11-28 13:35:15,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37143 states to 37143 states and 137901 transitions. [2018-11-28 13:35:15,313 INFO L78 Accepts]: Start accepts. Automaton has 37143 states and 137901 transitions. Word has length 45 [2018-11-28 13:35:15,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:35:15,314 INFO L480 AbstractCegarLoop]: Abstraction has 37143 states and 137901 transitions. [2018-11-28 13:35:15,314 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 13:35:15,314 INFO L276 IsEmpty]: Start isEmpty. Operand 37143 states and 137901 transitions. [2018-11-28 13:35:15,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-11-28 13:35:15,315 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:35:15,315 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] [2018-11-28 13:35:15,315 INFO L423 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:35:15,316 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:35:15,316 INFO L82 PathProgramCache]: Analyzing trace with hash 1508997083, now seen corresponding path program 1 times [2018-11-28 13:35:15,316 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:35:15,316 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:35:15,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:35:15,317 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:35:15,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:35:15,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:35:15,348 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 13:35:15,348 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:35:15,349 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 13:35:15,349 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 13:35:15,349 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 13:35:15,349 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 13:35:15,349 INFO L87 Difference]: Start difference. First operand 37143 states and 137901 transitions. Second operand 3 states. [2018-11-28 13:35:15,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:35:15,510 INFO L93 Difference]: Finished difference Result 37143 states and 137892 transitions. [2018-11-28 13:35:15,510 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 13:35:15,510 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 46 [2018-11-28 13:35:15,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:35:15,592 INFO L225 Difference]: With dead ends: 37143 [2018-11-28 13:35:15,593 INFO L226 Difference]: Without dead ends: 37143 [2018-11-28 13:35:15,593 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 13:35:15,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37143 states. [2018-11-28 13:35:16,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37143 to 37143. [2018-11-28 13:35:16,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37143 states. [2018-11-28 13:35:16,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37143 states to 37143 states and 137892 transitions. [2018-11-28 13:35:16,176 INFO L78 Accepts]: Start accepts. Automaton has 37143 states and 137892 transitions. Word has length 46 [2018-11-28 13:35:16,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:35:16,176 INFO L480 AbstractCegarLoop]: Abstraction has 37143 states and 137892 transitions. [2018-11-28 13:35:16,176 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 13:35:16,176 INFO L276 IsEmpty]: Start isEmpty. Operand 37143 states and 137892 transitions. [2018-11-28 13:35:16,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-11-28 13:35:16,179 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:35:16,179 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] [2018-11-28 13:35:16,179 INFO L423 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:35:16,179 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:35:16,180 INFO L82 PathProgramCache]: Analyzing trace with hash -1043159878, now seen corresponding path program 1 times [2018-11-28 13:35:16,180 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:35:16,180 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:35:16,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:35:16,182 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:35:16,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:35:16,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:35:16,225 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 13:35:16,226 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:35:16,226 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 13:35:16,226 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 13:35:16,226 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 13:35:16,226 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 13:35:16,227 INFO L87 Difference]: Start difference. First operand 37143 states and 137892 transitions. Second operand 5 states. [2018-11-28 13:35:16,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:35:16,846 INFO L93 Difference]: Finished difference Result 66627 states and 246193 transitions. [2018-11-28 13:35:16,847 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-28 13:35:16,847 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 46 [2018-11-28 13:35:16,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:35:16,962 INFO L225 Difference]: With dead ends: 66627 [2018-11-28 13:35:16,963 INFO L226 Difference]: Without dead ends: 66459 [2018-11-28 13:35:16,963 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 13:35:17,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66459 states. [2018-11-28 13:35:17,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66459 to 38835. [2018-11-28 13:35:17,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38835 states. [2018-11-28 13:35:17,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38835 states to 38835 states and 143650 transitions. [2018-11-28 13:35:17,654 INFO L78 Accepts]: Start accepts. Automaton has 38835 states and 143650 transitions. Word has length 46 [2018-11-28 13:35:17,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:35:17,654 INFO L480 AbstractCegarLoop]: Abstraction has 38835 states and 143650 transitions. [2018-11-28 13:35:17,654 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 13:35:17,654 INFO L276 IsEmpty]: Start isEmpty. Operand 38835 states and 143650 transitions. [2018-11-28 13:35:17,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-11-28 13:35:17,660 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:35:17,660 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 13:35:17,660 INFO L423 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:35:17,660 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:35:17,661 INFO L82 PathProgramCache]: Analyzing trace with hash 897528764, now seen corresponding path program 1 times [2018-11-28 13:35:17,661 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:35:17,661 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:35:17,662 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:35:17,662 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:35:17,663 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:35:17,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:35:17,882 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:35:17,882 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:35:17,883 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 13:35:17,883 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 13:35:17,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 13:35:17,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 13:35:17,883 INFO L87 Difference]: Start difference. First operand 38835 states and 143650 transitions. Second operand 4 states. [2018-11-28 13:35:17,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:35:17,987 INFO L93 Difference]: Finished difference Result 14217 states and 47061 transitions. [2018-11-28 13:35:17,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 13:35:17,988 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 53 [2018-11-28 13:35:17,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:35:18,005 INFO L225 Difference]: With dead ends: 14217 [2018-11-28 13:35:18,006 INFO L226 Difference]: Without dead ends: 13696 [2018-11-28 13:35:18,006 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 13:35:18,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13696 states. [2018-11-28 13:35:18,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13696 to 13696. [2018-11-28 13:35:18,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13696 states. [2018-11-28 13:35:18,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13696 states to 13696 states and 45509 transitions. [2018-11-28 13:35:18,152 INFO L78 Accepts]: Start accepts. Automaton has 13696 states and 45509 transitions. Word has length 53 [2018-11-28 13:35:18,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:35:18,152 INFO L480 AbstractCegarLoop]: Abstraction has 13696 states and 45509 transitions. [2018-11-28 13:35:18,152 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 13:35:18,152 INFO L276 IsEmpty]: Start isEmpty. Operand 13696 states and 45509 transitions. [2018-11-28 13:35:18,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-11-28 13:35:18,155 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:35:18,155 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:35:18,155 INFO L423 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:35:18,155 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:35:18,155 INFO L82 PathProgramCache]: Analyzing trace with hash 1116900446, now seen corresponding path program 1 times [2018-11-28 13:35:18,155 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:35:18,155 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:35:18,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:35:18,157 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:35:18,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:35:18,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:35:18,207 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 13:35:18,207 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:35:18,208 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 13:35:18,208 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 13:35:18,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 13:35:18,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 13:35:18,208 INFO L87 Difference]: Start difference. First operand 13696 states and 45509 transitions. Second operand 4 states. [2018-11-28 13:35:18,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:35:18,379 INFO L93 Difference]: Finished difference Result 19084 states and 62264 transitions. [2018-11-28 13:35:18,379 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 13:35:18,379 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 59 [2018-11-28 13:35:18,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:35:18,402 INFO L225 Difference]: With dead ends: 19084 [2018-11-28 13:35:18,402 INFO L226 Difference]: Without dead ends: 19084 [2018-11-28 13:35:18,402 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 13:35:18,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19084 states. [2018-11-28 13:35:18,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19084 to 14780. [2018-11-28 13:35:18,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14780 states. [2018-11-28 13:35:18,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14780 states to 14780 states and 48764 transitions. [2018-11-28 13:35:18,577 INFO L78 Accepts]: Start accepts. Automaton has 14780 states and 48764 transitions. Word has length 59 [2018-11-28 13:35:18,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:35:18,577 INFO L480 AbstractCegarLoop]: Abstraction has 14780 states and 48764 transitions. [2018-11-28 13:35:18,577 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 13:35:18,578 INFO L276 IsEmpty]: Start isEmpty. Operand 14780 states and 48764 transitions. [2018-11-28 13:35:18,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-11-28 13:35:18,581 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:35:18,581 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:35:18,582 INFO L423 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:35:18,582 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:35:18,582 INFO L82 PathProgramCache]: Analyzing trace with hash -1435256515, now seen corresponding path program 1 times [2018-11-28 13:35:18,582 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:35:18,582 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:35:18,583 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:35:18,583 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:35:18,584 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:35:18,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:35:18,630 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 13:35:18,631 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:35:18,631 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 13:35:18,631 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 13:35:18,631 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 13:35:18,631 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-28 13:35:18,631 INFO L87 Difference]: Start difference. First operand 14780 states and 48764 transitions. Second operand 5 states. [2018-11-28 13:35:18,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:35:18,679 INFO L93 Difference]: Finished difference Result 2828 states and 7576 transitions. [2018-11-28 13:35:18,680 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 13:35:18,680 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 59 [2018-11-28 13:35:18,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:35:18,682 INFO L225 Difference]: With dead ends: 2828 [2018-11-28 13:35:18,682 INFO L226 Difference]: Without dead ends: 2416 [2018-11-28 13:35:18,682 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 13:35:18,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2416 states. [2018-11-28 13:35:18,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2416 to 2313. [2018-11-28 13:35:18,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2313 states. [2018-11-28 13:35:18,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2313 states to 2313 states and 6179 transitions. [2018-11-28 13:35:18,699 INFO L78 Accepts]: Start accepts. Automaton has 2313 states and 6179 transitions. Word has length 59 [2018-11-28 13:35:18,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:35:18,700 INFO L480 AbstractCegarLoop]: Abstraction has 2313 states and 6179 transitions. [2018-11-28 13:35:18,700 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 13:35:18,700 INFO L276 IsEmpty]: Start isEmpty. Operand 2313 states and 6179 transitions. [2018-11-28 13:35:18,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-11-28 13:35:18,702 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:35:18,702 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] [2018-11-28 13:35:18,702 INFO L423 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:35:18,702 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:35:18,702 INFO L82 PathProgramCache]: Analyzing trace with hash 1291396420, now seen corresponding path program 1 times [2018-11-28 13:35:18,702 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:35:18,702 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:35:18,703 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:35:18,704 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:35:18,704 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:35:18,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:35:18,774 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 13:35:18,774 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:35:18,774 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 13:35:18,775 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 13:35:18,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 13:35:18,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 13:35:18,775 INFO L87 Difference]: Start difference. First operand 2313 states and 6179 transitions. Second operand 4 states. [2018-11-28 13:35:18,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:35:18,874 INFO L93 Difference]: Finished difference Result 2750 states and 7226 transitions. [2018-11-28 13:35:18,875 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 13:35:18,875 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 92 [2018-11-28 13:35:18,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:35:18,877 INFO L225 Difference]: With dead ends: 2750 [2018-11-28 13:35:18,877 INFO L226 Difference]: Without dead ends: 2750 [2018-11-28 13:35:18,877 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 13:35:18,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2750 states. [2018-11-28 13:35:18,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2750 to 2402. [2018-11-28 13:35:18,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2402 states. [2018-11-28 13:35:18,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2402 states to 2402 states and 6381 transitions. [2018-11-28 13:35:18,897 INFO L78 Accepts]: Start accepts. Automaton has 2402 states and 6381 transitions. Word has length 92 [2018-11-28 13:35:18,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:35:18,897 INFO L480 AbstractCegarLoop]: Abstraction has 2402 states and 6381 transitions. [2018-11-28 13:35:18,897 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 13:35:18,897 INFO L276 IsEmpty]: Start isEmpty. Operand 2402 states and 6381 transitions. [2018-11-28 13:35:18,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-11-28 13:35:18,900 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:35:18,900 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] [2018-11-28 13:35:18,900 INFO L423 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:35:18,900 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:35:18,900 INFO L82 PathProgramCache]: Analyzing trace with hash -2033989853, now seen corresponding path program 1 times [2018-11-28 13:35:18,900 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:35:18,900 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:35:18,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:35:18,902 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:35:18,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:35:18,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:35:18,971 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 13:35:18,972 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:35:18,972 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 13:35:18,972 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 13:35:18,972 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 13:35:18,972 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-28 13:35:18,972 INFO L87 Difference]: Start difference. First operand 2402 states and 6381 transitions. Second operand 4 states. [2018-11-28 13:35:19,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:35:19,110 INFO L93 Difference]: Finished difference Result 3360 states and 8951 transitions. [2018-11-28 13:35:19,110 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 13:35:19,110 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 92 [2018-11-28 13:35:19,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:35:19,112 INFO L225 Difference]: With dead ends: 3360 [2018-11-28 13:35:19,113 INFO L226 Difference]: Without dead ends: 3360 [2018-11-28 13:35:19,113 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-28 13:35:19,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3360 states. [2018-11-28 13:35:19,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3360 to 2367. [2018-11-28 13:35:19,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2367 states. [2018-11-28 13:35:19,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2367 states to 2367 states and 6242 transitions. [2018-11-28 13:35:19,133 INFO L78 Accepts]: Start accepts. Automaton has 2367 states and 6242 transitions. Word has length 92 [2018-11-28 13:35:19,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:35:19,134 INFO L480 AbstractCegarLoop]: Abstraction has 2367 states and 6242 transitions. [2018-11-28 13:35:19,134 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 13:35:19,134 INFO L276 IsEmpty]: Start isEmpty. Operand 2367 states and 6242 transitions. [2018-11-28 13:35:19,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-11-28 13:35:19,136 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:35:19,136 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] [2018-11-28 13:35:19,136 INFO L423 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:35:19,136 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:35:19,136 INFO L82 PathProgramCache]: Analyzing trace with hash 1525134517, now seen corresponding path program 2 times [2018-11-28 13:35:19,137 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:35:19,137 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:35:19,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:35:19,138 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:35:19,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:35:19,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:35:19,217 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 13:35:19,217 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:35:19,218 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 13:35:19,218 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 13:35:19,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 13:35:19,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 13:35:19,218 INFO L87 Difference]: Start difference. First operand 2367 states and 6242 transitions. Second operand 5 states. [2018-11-28 13:35:19,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:35:19,339 INFO L93 Difference]: Finished difference Result 2725 states and 7108 transitions. [2018-11-28 13:35:19,339 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-28 13:35:19,339 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 92 [2018-11-28 13:35:19,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:35:19,342 INFO L225 Difference]: With dead ends: 2725 [2018-11-28 13:35:19,342 INFO L226 Difference]: Without dead ends: 2725 [2018-11-28 13:35:19,342 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 13:35:19,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2725 states. [2018-11-28 13:35:19,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2725 to 2363. [2018-11-28 13:35:19,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2363 states. [2018-11-28 13:35:19,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2363 states to 2363 states and 6233 transitions. [2018-11-28 13:35:19,362 INFO L78 Accepts]: Start accepts. Automaton has 2363 states and 6233 transitions. Word has length 92 [2018-11-28 13:35:19,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:35:19,362 INFO L480 AbstractCegarLoop]: Abstraction has 2363 states and 6233 transitions. [2018-11-28 13:35:19,362 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 13:35:19,362 INFO L276 IsEmpty]: Start isEmpty. Operand 2363 states and 6233 transitions. [2018-11-28 13:35:19,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-11-28 13:35:19,364 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:35:19,365 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] [2018-11-28 13:35:19,365 INFO L423 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:35:19,365 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:35:19,365 INFO L82 PathProgramCache]: Analyzing trace with hash -272933984, now seen corresponding path program 1 times [2018-11-28 13:35:19,365 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:35:19,365 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:35:19,366 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:35:19,367 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 13:35:19,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:35:19,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:35:19,388 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 13:35:19,389 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:35:19,389 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 13:35:19,389 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 13:35:19,389 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 13:35:19,389 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 13:35:19,389 INFO L87 Difference]: Start difference. First operand 2363 states and 6233 transitions. Second operand 3 states. [2018-11-28 13:35:19,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:35:19,463 INFO L93 Difference]: Finished difference Result 2413 states and 6340 transitions. [2018-11-28 13:35:19,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 13:35:19,463 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 92 [2018-11-28 13:35:19,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:35:19,465 INFO L225 Difference]: With dead ends: 2413 [2018-11-28 13:35:19,466 INFO L226 Difference]: Without dead ends: 2413 [2018-11-28 13:35:19,466 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 13:35:19,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2413 states. [2018-11-28 13:35:19,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2413 to 2375. [2018-11-28 13:35:19,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2375 states. [2018-11-28 13:35:19,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2375 states to 2375 states and 6257 transitions. [2018-11-28 13:35:19,483 INFO L78 Accepts]: Start accepts. Automaton has 2375 states and 6257 transitions. Word has length 92 [2018-11-28 13:35:19,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:35:19,484 INFO L480 AbstractCegarLoop]: Abstraction has 2375 states and 6257 transitions. [2018-11-28 13:35:19,484 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 13:35:19,484 INFO L276 IsEmpty]: Start isEmpty. Operand 2375 states and 6257 transitions. [2018-11-28 13:35:19,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-11-28 13:35:19,486 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:35:19,486 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] [2018-11-28 13:35:19,486 INFO L423 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:35:19,487 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:35:19,487 INFO L82 PathProgramCache]: Analyzing trace with hash -300063354, now seen corresponding path program 1 times [2018-11-28 13:35:19,487 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:35:19,487 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:35:19,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:35:19,488 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:35:19,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:35:19,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:35:19,529 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 13:35:19,529 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:35:19,529 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 13:35:19,530 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 13:35:19,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 13:35:19,531 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-28 13:35:19,531 INFO L87 Difference]: Start difference. First operand 2375 states and 6257 transitions. Second operand 4 states. [2018-11-28 13:35:19,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:35:19,648 INFO L93 Difference]: Finished difference Result 4576 states and 12148 transitions. [2018-11-28 13:35:19,648 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 13:35:19,648 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 94 [2018-11-28 13:35:19,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:35:19,653 INFO L225 Difference]: With dead ends: 4576 [2018-11-28 13:35:19,654 INFO L226 Difference]: Without dead ends: 4576 [2018-11-28 13:35:19,654 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-28 13:35:19,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4576 states. [2018-11-28 13:35:19,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4576 to 2359. [2018-11-28 13:35:19,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2359 states. [2018-11-28 13:35:19,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2359 states to 2359 states and 6176 transitions. [2018-11-28 13:35:19,691 INFO L78 Accepts]: Start accepts. Automaton has 2359 states and 6176 transitions. Word has length 94 [2018-11-28 13:35:19,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:35:19,691 INFO L480 AbstractCegarLoop]: Abstraction has 2359 states and 6176 transitions. [2018-11-28 13:35:19,691 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 13:35:19,691 INFO L276 IsEmpty]: Start isEmpty. Operand 2359 states and 6176 transitions. [2018-11-28 13:35:19,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-11-28 13:35:19,694 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:35:19,694 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] [2018-11-28 13:35:19,695 INFO L423 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:35:19,695 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:35:19,695 INFO L82 PathProgramCache]: Analyzing trace with hash 1161516645, now seen corresponding path program 1 times [2018-11-28 13:35:19,695 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:35:19,695 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:35:19,696 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:35:19,696 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:35:19,696 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:35:19,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:35:19,774 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 13:35:19,774 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:35:19,774 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 13:35:19,774 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 13:35:19,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 13:35:19,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-28 13:35:19,775 INFO L87 Difference]: Start difference. First operand 2359 states and 6176 transitions. Second operand 6 states. [2018-11-28 13:35:20,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:35:20,024 INFO L93 Difference]: Finished difference Result 2638 states and 6728 transitions. [2018-11-28 13:35:20,025 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 13:35:20,025 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 94 [2018-11-28 13:35:20,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:35:20,027 INFO L225 Difference]: With dead ends: 2638 [2018-11-28 13:35:20,027 INFO L226 Difference]: Without dead ends: 2568 [2018-11-28 13:35:20,027 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-11-28 13:35:20,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2568 states. [2018-11-28 13:35:20,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2568 to 2501. [2018-11-28 13:35:20,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2501 states. [2018-11-28 13:35:20,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2501 states to 2501 states and 6462 transitions. [2018-11-28 13:35:20,045 INFO L78 Accepts]: Start accepts. Automaton has 2501 states and 6462 transitions. Word has length 94 [2018-11-28 13:35:20,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:35:20,045 INFO L480 AbstractCegarLoop]: Abstraction has 2501 states and 6462 transitions. [2018-11-28 13:35:20,045 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 13:35:20,045 INFO L276 IsEmpty]: Start isEmpty. Operand 2501 states and 6462 transitions. [2018-11-28 13:35:20,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-11-28 13:35:20,047 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:35:20,047 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] [2018-11-28 13:35:20,047 INFO L423 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:35:20,047 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:35:20,047 INFO L82 PathProgramCache]: Analyzing trace with hash -1432710172, now seen corresponding path program 1 times [2018-11-28 13:35:20,047 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:35:20,047 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:35:20,048 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:35:20,048 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:35:20,049 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:35:20,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:35:20,130 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 13:35:20,130 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:35:20,130 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-28 13:35:20,130 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-28 13:35:20,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-28 13:35:20,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-11-28 13:35:20,131 INFO L87 Difference]: Start difference. First operand 2501 states and 6462 transitions. Second operand 7 states. [2018-11-28 13:35:20,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:35:20,337 INFO L93 Difference]: Finished difference Result 2719 states and 7001 transitions. [2018-11-28 13:35:20,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 13:35:20,338 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 94 [2018-11-28 13:35:20,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:35:20,340 INFO L225 Difference]: With dead ends: 2719 [2018-11-28 13:35:20,340 INFO L226 Difference]: Without dead ends: 2719 [2018-11-28 13:35:20,341 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-11-28 13:35:20,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2719 states. [2018-11-28 13:35:20,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2719 to 2485. [2018-11-28 13:35:20,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2485 states. [2018-11-28 13:35:20,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2485 states to 2485 states and 6429 transitions. [2018-11-28 13:35:20,365 INFO L78 Accepts]: Start accepts. Automaton has 2485 states and 6429 transitions. Word has length 94 [2018-11-28 13:35:20,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:35:20,366 INFO L480 AbstractCegarLoop]: Abstraction has 2485 states and 6429 transitions. [2018-11-28 13:35:20,366 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-28 13:35:20,366 INFO L276 IsEmpty]: Start isEmpty. Operand 2485 states and 6429 transitions. [2018-11-28 13:35:20,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-11-28 13:35:20,369 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:35:20,369 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] [2018-11-28 13:35:20,369 INFO L423 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:35:20,369 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:35:20,369 INFO L82 PathProgramCache]: Analyzing trace with hash -21830652, now seen corresponding path program 1 times [2018-11-28 13:35:20,370 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:35:20,370 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:35:20,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:35:20,371 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:35:20,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:35:20,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:35:20,474 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 13:35:20,474 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:35:20,474 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 13:35:20,474 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 13:35:20,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 13:35:20,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-28 13:35:20,475 INFO L87 Difference]: Start difference. First operand 2485 states and 6429 transitions. Second operand 5 states. [2018-11-28 13:35:20,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:35:20,542 INFO L93 Difference]: Finished difference Result 2259 states and 5832 transitions. [2018-11-28 13:35:20,542 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 13:35:20,542 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 94 [2018-11-28 13:35:20,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:35:20,544 INFO L225 Difference]: With dead ends: 2259 [2018-11-28 13:35:20,544 INFO L226 Difference]: Without dead ends: 2259 [2018-11-28 13:35:20,545 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 13:35:20,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2259 states. [2018-11-28 13:35:20,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2259 to 2257. [2018-11-28 13:35:20,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2257 states. [2018-11-28 13:35:20,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2257 states to 2257 states and 5828 transitions. [2018-11-28 13:35:20,566 INFO L78 Accepts]: Start accepts. Automaton has 2257 states and 5828 transitions. Word has length 94 [2018-11-28 13:35:20,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:35:20,566 INFO L480 AbstractCegarLoop]: Abstraction has 2257 states and 5828 transitions. [2018-11-28 13:35:20,566 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 13:35:20,566 INFO L276 IsEmpty]: Start isEmpty. Operand 2257 states and 5828 transitions. [2018-11-28 13:35:20,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-11-28 13:35:20,569 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:35:20,569 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:35:20,569 INFO L423 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:35:20,569 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:35:20,569 INFO L82 PathProgramCache]: Analyzing trace with hash 525851419, now seen corresponding path program 1 times [2018-11-28 13:35:20,569 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:35:20,569 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:35:20,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:35:20,571 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:35:20,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:35:20,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:35:20,627 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 13:35:20,627 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:35:20,627 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 13:35:20,628 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 13:35:20,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 13:35:20,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 13:35:20,628 INFO L87 Difference]: Start difference. First operand 2257 states and 5828 transitions. Second operand 5 states. [2018-11-28 13:35:20,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:35:20,803 INFO L93 Difference]: Finished difference Result 4039 states and 10710 transitions. [2018-11-28 13:35:20,804 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 13:35:20,804 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 94 [2018-11-28 13:35:20,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:35:20,807 INFO L225 Difference]: With dead ends: 4039 [2018-11-28 13:35:20,807 INFO L226 Difference]: Without dead ends: 4039 [2018-11-28 13:35:20,807 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-11-28 13:35:20,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4039 states. [2018-11-28 13:35:20,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4039 to 2293. [2018-11-28 13:35:20,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2293 states. [2018-11-28 13:35:20,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2293 states to 2293 states and 5908 transitions. [2018-11-28 13:35:20,829 INFO L78 Accepts]: Start accepts. Automaton has 2293 states and 5908 transitions. Word has length 94 [2018-11-28 13:35:20,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:35:20,829 INFO L480 AbstractCegarLoop]: Abstraction has 2293 states and 5908 transitions. [2018-11-28 13:35:20,830 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 13:35:20,830 INFO L276 IsEmpty]: Start isEmpty. Operand 2293 states and 5908 transitions. [2018-11-28 13:35:20,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-11-28 13:35:20,832 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:35:20,832 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] [2018-11-28 13:35:20,832 INFO L423 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:35:20,832 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:35:20,832 INFO L82 PathProgramCache]: Analyzing trace with hash -1833455590, now seen corresponding path program 1 times [2018-11-28 13:35:20,832 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:35:20,833 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:35:20,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:35:20,834 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:35:20,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:35:20,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:35:20,939 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 13:35:20,940 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:35:20,940 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 13:35:20,940 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 13:35:20,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 13:35:20,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-28 13:35:20,940 INFO L87 Difference]: Start difference. First operand 2293 states and 5908 transitions. Second operand 6 states. [2018-11-28 13:35:21,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:35:21,039 INFO L93 Difference]: Finished difference Result 2005 states and 5012 transitions. [2018-11-28 13:35:21,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 13:35:21,040 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 94 [2018-11-28 13:35:21,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:35:21,041 INFO L225 Difference]: With dead ends: 2005 [2018-11-28 13:35:21,041 INFO L226 Difference]: Without dead ends: 2005 [2018-11-28 13:35:21,041 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 13:35:21,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2005 states. [2018-11-28 13:35:21,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2005 to 1668. [2018-11-28 13:35:21,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1668 states. [2018-11-28 13:35:21,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1668 states to 1668 states and 4216 transitions. [2018-11-28 13:35:21,054 INFO L78 Accepts]: Start accepts. Automaton has 1668 states and 4216 transitions. Word has length 94 [2018-11-28 13:35:21,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:35:21,055 INFO L480 AbstractCegarLoop]: Abstraction has 1668 states and 4216 transitions. [2018-11-28 13:35:21,055 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 13:35:21,055 INFO L276 IsEmpty]: Start isEmpty. Operand 1668 states and 4216 transitions. [2018-11-28 13:35:21,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-11-28 13:35:21,056 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:35:21,056 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] [2018-11-28 13:35:21,056 INFO L423 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:35:21,056 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:35:21,056 INFO L82 PathProgramCache]: Analyzing trace with hash -1322965038, now seen corresponding path program 1 times [2018-11-28 13:35:21,056 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:35:21,056 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:35:21,057 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:35:21,057 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:35:21,057 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:35:21,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:35:21,133 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 13:35:21,133 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:35:21,134 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-28 13:35:21,134 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-28 13:35:21,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-28 13:35:21,134 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-11-28 13:35:21,134 INFO L87 Difference]: Start difference. First operand 1668 states and 4216 transitions. Second operand 8 states. [2018-11-28 13:35:21,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:35:21,490 INFO L93 Difference]: Finished difference Result 3044 states and 7595 transitions. [2018-11-28 13:35:21,491 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-28 13:35:21,491 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 96 [2018-11-28 13:35:21,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:35:21,493 INFO L225 Difference]: With dead ends: 3044 [2018-11-28 13:35:21,493 INFO L226 Difference]: Without dead ends: 3044 [2018-11-28 13:35:21,493 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=179, Unknown=0, NotChecked=0, Total=240 [2018-11-28 13:35:21,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3044 states. [2018-11-28 13:35:21,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3044 to 2386. [2018-11-28 13:35:21,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2386 states. [2018-11-28 13:35:21,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2386 states to 2386 states and 6058 transitions. [2018-11-28 13:35:21,513 INFO L78 Accepts]: Start accepts. Automaton has 2386 states and 6058 transitions. Word has length 96 [2018-11-28 13:35:21,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:35:21,513 INFO L480 AbstractCegarLoop]: Abstraction has 2386 states and 6058 transitions. [2018-11-28 13:35:21,513 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-28 13:35:21,513 INFO L276 IsEmpty]: Start isEmpty. Operand 2386 states and 6058 transitions. [2018-11-28 13:35:21,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-11-28 13:35:21,515 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:35:21,515 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] [2018-11-28 13:35:21,516 INFO L423 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:35:21,516 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:35:21,516 INFO L82 PathProgramCache]: Analyzing trace with hash -78200557, now seen corresponding path program 1 times [2018-11-28 13:35:21,516 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:35:21,516 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:35:21,517 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:35:21,517 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:35:21,517 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:35:21,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:35:21,618 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 13:35:21,618 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:35:21,619 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-28 13:35:21,619 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-28 13:35:21,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-28 13:35:21,619 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-11-28 13:35:21,619 INFO L87 Difference]: Start difference. First operand 2386 states and 6058 transitions. Second operand 7 states. [2018-11-28 13:35:21,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:35:21,832 INFO L93 Difference]: Finished difference Result 2463 states and 6197 transitions. [2018-11-28 13:35:21,833 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-28 13:35:21,833 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 96 [2018-11-28 13:35:21,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:35:21,835 INFO L225 Difference]: With dead ends: 2463 [2018-11-28 13:35:21,835 INFO L226 Difference]: Without dead ends: 2443 [2018-11-28 13:35:21,835 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2018-11-28 13:35:21,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2443 states. [2018-11-28 13:35:21,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2443 to 2370. [2018-11-28 13:35:21,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2370 states. [2018-11-28 13:35:21,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2370 states to 2370 states and 6018 transitions. [2018-11-28 13:35:21,852 INFO L78 Accepts]: Start accepts. Automaton has 2370 states and 6018 transitions. Word has length 96 [2018-11-28 13:35:21,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:35:21,852 INFO L480 AbstractCegarLoop]: Abstraction has 2370 states and 6018 transitions. [2018-11-28 13:35:21,852 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-28 13:35:21,852 INFO L276 IsEmpty]: Start isEmpty. Operand 2370 states and 6018 transitions. [2018-11-28 13:35:21,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-11-28 13:35:21,854 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:35:21,854 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] [2018-11-28 13:35:21,855 INFO L423 AbstractCegarLoop]: === Iteration 21 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:35:21,855 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:35:21,855 INFO L82 PathProgramCache]: Analyzing trace with hash 1892738900, now seen corresponding path program 1 times [2018-11-28 13:35:21,855 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:35:21,855 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:35:21,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:35:21,856 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:35:21,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:35:21,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:35:21,911 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 13:35:21,911 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:35:21,912 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 13:35:21,912 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 13:35:21,912 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 13:35:21,912 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-28 13:35:21,913 INFO L87 Difference]: Start difference. First operand 2370 states and 6018 transitions. Second operand 6 states. [2018-11-28 13:35:22,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:35:22,063 INFO L93 Difference]: Finished difference Result 2483 states and 6279 transitions. [2018-11-28 13:35:22,063 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-28 13:35:22,063 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 96 [2018-11-28 13:35:22,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:35:22,065 INFO L225 Difference]: With dead ends: 2483 [2018-11-28 13:35:22,065 INFO L226 Difference]: Without dead ends: 2483 [2018-11-28 13:35:22,066 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2018-11-28 13:35:22,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2483 states. [2018-11-28 13:35:22,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2483 to 2423. [2018-11-28 13:35:22,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2423 states. [2018-11-28 13:35:22,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2423 states to 2423 states and 6147 transitions. [2018-11-28 13:35:22,084 INFO L78 Accepts]: Start accepts. Automaton has 2423 states and 6147 transitions. Word has length 96 [2018-11-28 13:35:22,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:35:22,084 INFO L480 AbstractCegarLoop]: Abstraction has 2423 states and 6147 transitions. [2018-11-28 13:35:22,084 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 13:35:22,084 INFO L276 IsEmpty]: Start isEmpty. Operand 2423 states and 6147 transitions. [2018-11-28 13:35:22,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-11-28 13:35:22,087 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:35:22,087 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] [2018-11-28 13:35:22,087 INFO L423 AbstractCegarLoop]: === Iteration 22 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:35:22,088 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:35:22,088 INFO L82 PathProgramCache]: Analyzing trace with hash 977740180, now seen corresponding path program 1 times [2018-11-28 13:35:22,088 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:35:22,088 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:35:22,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:35:22,091 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:35:22,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:35:22,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:35:22,142 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 13:35:22,142 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:35:22,143 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 13:35:22,143 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 13:35:22,143 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 13:35:22,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 13:35:22,143 INFO L87 Difference]: Start difference. First operand 2423 states and 6147 transitions. Second operand 5 states. [2018-11-28 13:35:22,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:35:22,248 INFO L93 Difference]: Finished difference Result 2743 states and 6947 transitions. [2018-11-28 13:35:22,248 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 13:35:22,248 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 96 [2018-11-28 13:35:22,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:35:22,251 INFO L225 Difference]: With dead ends: 2743 [2018-11-28 13:35:22,251 INFO L226 Difference]: Without dead ends: 2743 [2018-11-28 13:35:22,251 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 13:35:22,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2743 states. [2018-11-28 13:35:22,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2743 to 2152. [2018-11-28 13:35:22,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2152 states. [2018-11-28 13:35:22,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2152 states to 2152 states and 5472 transitions. [2018-11-28 13:35:22,270 INFO L78 Accepts]: Start accepts. Automaton has 2152 states and 5472 transitions. Word has length 96 [2018-11-28 13:35:22,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:35:22,270 INFO L480 AbstractCegarLoop]: Abstraction has 2152 states and 5472 transitions. [2018-11-28 13:35:22,270 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 13:35:22,270 INFO L276 IsEmpty]: Start isEmpty. Operand 2152 states and 5472 transitions. [2018-11-28 13:35:22,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-11-28 13:35:22,272 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:35:22,272 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] [2018-11-28 13:35:22,272 INFO L423 AbstractCegarLoop]: === Iteration 23 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:35:22,272 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:35:22,273 INFO L82 PathProgramCache]: Analyzing trace with hash -2072462635, now seen corresponding path program 1 times [2018-11-28 13:35:22,273 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:35:22,273 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:35:22,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:35:22,274 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:35:22,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:35:22,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:35:22,362 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:35:22,362 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:35:22,362 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-28 13:35:22,363 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-28 13:35:22,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-28 13:35:22,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-11-28 13:35:22,363 INFO L87 Difference]: Start difference. First operand 2152 states and 5472 transitions. Second operand 9 states. [2018-11-28 13:35:22,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:35:22,473 INFO L93 Difference]: Finished difference Result 3904 states and 10123 transitions. [2018-11-28 13:35:22,474 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-28 13:35:22,474 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 96 [2018-11-28 13:35:22,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:35:22,475 INFO L225 Difference]: With dead ends: 3904 [2018-11-28 13:35:22,476 INFO L226 Difference]: Without dead ends: 1836 [2018-11-28 13:35:22,476 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2018-11-28 13:35:22,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1836 states. [2018-11-28 13:35:22,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1836 to 1836. [2018-11-28 13:35:22,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1836 states. [2018-11-28 13:35:22,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1836 states to 1836 states and 4797 transitions. [2018-11-28 13:35:22,491 INFO L78 Accepts]: Start accepts. Automaton has 1836 states and 4797 transitions. Word has length 96 [2018-11-28 13:35:22,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:35:22,491 INFO L480 AbstractCegarLoop]: Abstraction has 1836 states and 4797 transitions. [2018-11-28 13:35:22,492 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-28 13:35:22,492 INFO L276 IsEmpty]: Start isEmpty. Operand 1836 states and 4797 transitions. [2018-11-28 13:35:22,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-11-28 13:35:22,494 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:35:22,494 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] [2018-11-28 13:35:22,494 INFO L423 AbstractCegarLoop]: === Iteration 24 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:35:22,494 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:35:22,494 INFO L82 PathProgramCache]: Analyzing trace with hash -1343180800, now seen corresponding path program 2 times [2018-11-28 13:35:22,494 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:35:22,494 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:35:22,496 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:35:22,496 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:35:22,496 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:35:22,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:35:22,557 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 13:35:22,557 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:35:22,557 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 13:35:22,558 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 13:35:22,558 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 13:35:22,558 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-28 13:35:22,558 INFO L87 Difference]: Start difference. First operand 1836 states and 4797 transitions. Second operand 5 states. [2018-11-28 13:35:22,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:35:22,581 INFO L93 Difference]: Finished difference Result 1836 states and 4776 transitions. [2018-11-28 13:35:22,582 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 13:35:22,582 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 96 [2018-11-28 13:35:22,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:35:22,584 INFO L225 Difference]: With dead ends: 1836 [2018-11-28 13:35:22,584 INFO L226 Difference]: Without dead ends: 1836 [2018-11-28 13:35:22,584 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-11-28 13:35:22,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1836 states. [2018-11-28 13:35:22,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1836 to 1791. [2018-11-28 13:35:22,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1791 states. [2018-11-28 13:35:22,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1791 states to 1791 states and 4686 transitions. [2018-11-28 13:35:22,598 INFO L78 Accepts]: Start accepts. Automaton has 1791 states and 4686 transitions. Word has length 96 [2018-11-28 13:35:22,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:35:22,599 INFO L480 AbstractCegarLoop]: Abstraction has 1791 states and 4686 transitions. [2018-11-28 13:35:22,599 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 13:35:22,599 INFO L276 IsEmpty]: Start isEmpty. Operand 1791 states and 4686 transitions. [2018-11-28 13:35:22,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-11-28 13:35:22,601 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:35:22,601 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] [2018-11-28 13:35:22,601 INFO L423 AbstractCegarLoop]: === Iteration 25 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:35:22,601 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:35:22,601 INFO L82 PathProgramCache]: Analyzing trace with hash -1013415039, now seen corresponding path program 2 times [2018-11-28 13:35:22,601 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:35:22,601 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:35:22,602 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:35:22,603 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 13:35:22,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:35:22,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:35:22,701 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:35:22,701 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:35:22,701 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-11-28 13:35:22,701 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-28 13:35:22,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-28 13:35:22,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-11-28 13:35:22,702 INFO L87 Difference]: Start difference. First operand 1791 states and 4686 transitions. Second operand 12 states. [2018-11-28 13:35:23,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:35:23,044 INFO L93 Difference]: Finished difference Result 3398 states and 8984 transitions. [2018-11-28 13:35:23,045 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-11-28 13:35:23,045 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 96 [2018-11-28 13:35:23,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:35:23,047 INFO L225 Difference]: With dead ends: 3398 [2018-11-28 13:35:23,047 INFO L226 Difference]: Without dead ends: 2422 [2018-11-28 13:35:23,048 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=100, Invalid=550, Unknown=0, NotChecked=0, Total=650 [2018-11-28 13:35:23,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2422 states. [2018-11-28 13:35:23,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2422 to 2270. [2018-11-28 13:35:23,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2270 states. [2018-11-28 13:35:23,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2270 states to 2270 states and 5808 transitions. [2018-11-28 13:35:23,064 INFO L78 Accepts]: Start accepts. Automaton has 2270 states and 5808 transitions. Word has length 96 [2018-11-28 13:35:23,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:35:23,064 INFO L480 AbstractCegarLoop]: Abstraction has 2270 states and 5808 transitions. [2018-11-28 13:35:23,064 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-28 13:35:23,064 INFO L276 IsEmpty]: Start isEmpty. Operand 2270 states and 5808 transitions. [2018-11-28 13:35:23,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-11-28 13:35:23,067 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:35:23,067 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] [2018-11-28 13:35:23,067 INFO L423 AbstractCegarLoop]: === Iteration 26 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:35:23,067 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:35:23,067 INFO L82 PathProgramCache]: Analyzing trace with hash -2137183355, now seen corresponding path program 3 times [2018-11-28 13:35:23,067 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:35:23,067 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:35:23,068 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:35:23,069 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 13:35:23,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:35:23,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:35:23,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:35:23,116 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-11-28 13:35:23,197 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-11-28 13:35:23,198 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 01:35:23 BasicIcfg [2018-11-28 13:35:23,198 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-28 13:35:23,198 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-28 13:35:23,198 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-28 13:35:23,198 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-28 13:35:23,200 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 01:35:08" (3/4) ... [2018-11-28 13:35:23,202 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-11-28 13:35:23,291 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_2ba2babb-e1a9-44a9-9705-473d65fcfe98/bin-2019/uautomizer/witness.graphml [2018-11-28 13:35:23,291 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-28 13:35:23,292 INFO L168 Benchmark]: Toolchain (without parser) took 15348.72 ms. Allocated memory was 1.0 GB in the beginning and 2.5 GB in the end (delta: 1.5 GB). Free memory was 949.6 MB in the beginning and 1.3 GB in the end (delta: -365.5 MB). Peak memory consumption was 1.1 GB. Max. memory is 11.5 GB. [2018-11-28 13:35:23,293 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 976.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 13:35:23,293 INFO L168 Benchmark]: CACSL2BoogieTranslator took 388.64 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 132.1 MB). Free memory was 949.6 MB in the beginning and 1.1 GB in the end (delta: -160.7 MB). Peak memory consumption was 31.2 MB. Max. memory is 11.5 GB. [2018-11-28 13:35:23,293 INFO L168 Benchmark]: Boogie Procedure Inliner took 33.23 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-11-28 13:35:23,294 INFO L168 Benchmark]: Boogie Preprocessor took 25.73 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 13:35:23,294 INFO L168 Benchmark]: RCFGBuilder took 462.03 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.7 MB). Peak memory consumption was 48.7 MB. Max. memory is 11.5 GB. [2018-11-28 13:35:23,294 INFO L168 Benchmark]: TraceAbstraction took 14342.59 ms. Allocated memory was 1.2 GB in the beginning and 2.5 GB in the end (delta: 1.3 GB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -284.6 MB). Peak memory consumption was 1.0 GB. Max. memory is 11.5 GB. [2018-11-28 13:35:23,294 INFO L168 Benchmark]: Witness Printer took 92.75 ms. Allocated memory is still 2.5 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 25.7 MB). Peak memory consumption was 25.7 MB. Max. memory is 11.5 GB. [2018-11-28 13:35:23,295 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.14 ms. Allocated memory is still 1.0 GB. Free memory is still 976.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 388.64 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 132.1 MB). Free memory was 949.6 MB in the beginning and 1.1 GB in the end (delta: -160.7 MB). Peak memory consumption was 31.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 33.23 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 25.73 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 462.03 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.7 MB). Peak memory consumption was 48.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 14342.59 ms. Allocated memory was 1.2 GB in the beginning and 2.5 GB in the end (delta: 1.3 GB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -284.6 MB). Peak memory consumption was 1.0 GB. Max. memory is 11.5 GB. * Witness Printer took 92.75 ms. Allocated memory is still 2.5 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 25.7 MB). Peak memory consumption was 25.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: [L671] -1 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L673] -1 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0] [L675] -1 int __unbuffered_p1_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0] [L676] -1 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0] [L677] -1 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L679] -1 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L680] -1 _Bool x$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0] [L681] -1 int x$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0] [L682] -1 _Bool x$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0] [L683] -1 _Bool x$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0] [L684] -1 _Bool x$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0] [L685] -1 _Bool x$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0] [L686] -1 _Bool x$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0] [L687] -1 _Bool x$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0] [L688] -1 _Bool x$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0] [L689] -1 int *x$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}] [L690] -1 int x$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0] [L691] -1 _Bool x$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0] [L692] -1 int x$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0] [L693] -1 _Bool x$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0] [L695] -1 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L697] -1 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L698] -1 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L699] -1 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L765] -1 pthread_t t1093; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L766] FCALL, FORK -1 pthread_create(&t1093, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L767] -1 pthread_t t1094; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L768] FCALL, FORK -1 pthread_create(&t1094, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L723] 0 x$w_buff1 = x$w_buff0 [L724] 0 x$w_buff0 = 2 [L725] 0 x$w_buff1_used = x$w_buff0_used [L726] 0 x$w_buff0_used = (_Bool)1 [L4] COND FALSE 0 !(!expression) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L728] 0 x$r_buff1_thd0 = x$r_buff0_thd0 [L729] 0 x$r_buff1_thd1 = x$r_buff0_thd1 [L730] 0 x$r_buff1_thd2 = x$r_buff0_thd2 [L731] 0 x$r_buff0_thd2 = (_Bool)1 [L734] 0 y = 1 [L737] 0 __unbuffered_p1_EAX = y [L740] 0 __unbuffered_p1_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L743] EXPR 0 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L703] 1 z = 1 [L706] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L743] 0 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L744] EXPR 0 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L709] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L744] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L709] EXPR 1 x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x=2, y=1, z=1] [L745] EXPR 0 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x=2, y=1, z=1] [L745] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L709] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x)=2, x$w_buff1=0, x$w_buff1_used=0, x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x=2, y=1, z=1] [L709] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L710] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L746] EXPR 0 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L710] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L746] 0 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L747] EXPR 0 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L747] 0 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L750] 0 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L711] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L711] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L712] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L712] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L713] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L713] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L716] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L770] -1 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L774] EXPR -1 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L774] EXPR -1 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L774] EXPR -1 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L774] -1 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L775] EXPR -1 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L775] -1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L776] EXPR -1 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L776] -1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L777] EXPR -1 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L777] -1 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L778] EXPR -1 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L778] -1 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L781] -1 weak$$choice0 = __VERIFIER_nondet_pointer() [L782] -1 weak$$choice2 = __VERIFIER_nondet_pointer() [L783] -1 x$flush_delayed = weak$$choice2 [L784] -1 x$mem_tmp = x VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L785] EXPR -1 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L785] -1 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L786] EXPR -1 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L786] -1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L787] EXPR -1 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L787] -1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L788] EXPR -1 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L788] -1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L789] EXPR -1 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L789] -1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L790] EXPR -1 weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L790] -1 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L791] EXPR -1 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L791] -1 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L792] -1 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L793] EXPR -1 x$flush_delayed ? x$mem_tmp : x VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L793] -1 x = x$flush_delayed ? x$mem_tmp : x [L794] -1 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L4] COND TRUE -1 !expression VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L4] -1 __VERIFIER_error() VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 181 locations, 3 error locations. UNSAFE Result, 14.2s OverallTime, 26 OverallIterations, 1 TraceHistogramMax, 6.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 5188 SDtfs, 4866 SDslu, 11128 SDs, 0 SdLazy, 3767 SolverSat, 247 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 226 GetRequests, 71 SyntacticMatches, 14 SemanticMatches, 141 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 153 ImplicationChecksByTransitivity, 1.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=38835occurred in iteration=5, 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: 4.7s AutomataMinimizationTime, 25 MinimizatonAttempts, 84448 StatesRemovedByMinimization, 21 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 2091 NumberOfCodeBlocks, 2091 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 1970 ConstructedInterpolants, 0 QuantifiedInterpolants, 400273 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 25 InterpolantComputations, 25 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...