./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/pthread-wmm/rfi001_pso.opt_false-unreach-call.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 2e94e6aa Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/svcomp/c/pthread-wmm/rfi001_pso.opt_false-unreach-call.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --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 4d16ad85263306ac9d29b22bbbb80825fd6ef8e4 ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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.24-2e94e6a [2018-12-31 22:47:28,070 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-31 22:47:28,072 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-31 22:47:28,090 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-31 22:47:28,090 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-31 22:47:28,092 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-31 22:47:28,093 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-31 22:47:28,095 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-31 22:47:28,097 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-31 22:47:28,097 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-31 22:47:28,098 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-31 22:47:28,098 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-31 22:47:28,099 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-31 22:47:28,100 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-31 22:47:28,101 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-31 22:47:28,102 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-31 22:47:28,103 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-31 22:47:28,105 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-31 22:47:28,107 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-31 22:47:28,109 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-31 22:47:28,110 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-31 22:47:28,111 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-31 22:47:28,113 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-31 22:47:28,113 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-31 22:47:28,114 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-31 22:47:28,115 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-31 22:47:28,116 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-31 22:47:28,116 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-31 22:47:28,117 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-31 22:47:28,118 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-31 22:47:28,118 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-31 22:47:28,119 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-31 22:47:28,119 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-31 22:47:28,119 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-31 22:47:28,120 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-31 22:47:28,121 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-31 22:47:28,122 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-12-31 22:47:28,142 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-31 22:47:28,143 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-31 22:47:28,144 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-31 22:47:28,144 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-31 22:47:28,145 INFO L133 SettingsManager]: * Use SBE=true [2018-12-31 22:47:28,145 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-31 22:47:28,145 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-31 22:47:28,145 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-31 22:47:28,145 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-31 22:47:28,145 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-31 22:47:28,146 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-31 22:47:28,146 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-31 22:47:28,146 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-31 22:47:28,146 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-31 22:47:28,146 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-31 22:47:28,146 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-31 22:47:28,147 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-31 22:47:28,148 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-31 22:47:28,148 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-31 22:47:28,148 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-31 22:47:28,148 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-31 22:47:28,148 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-31 22:47:28,149 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-31 22:47:28,149 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-31 22:47:28,149 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-31 22:47:28,149 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-31 22:47:28,149 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-31 22:47:28,150 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-31 22:47:28,150 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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux 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 -> 4d16ad85263306ac9d29b22bbbb80825fd6ef8e4 [2018-12-31 22:47:28,193 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-31 22:47:28,211 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-31 22:47:28,215 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-31 22:47:28,216 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-31 22:47:28,217 INFO L276 PluginConnector]: CDTParser initialized [2018-12-31 22:47:28,218 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/pthread-wmm/rfi001_pso.opt_false-unreach-call.i [2018-12-31 22:47:28,285 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/335a370e2/4ab835e3058348dab78e3606c5da41e3/FLAG834327eb6 [2018-12-31 22:47:28,861 INFO L307 CDTParser]: Found 1 translation units. [2018-12-31 22:47:28,862 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/pthread-wmm/rfi001_pso.opt_false-unreach-call.i [2018-12-31 22:47:28,887 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/335a370e2/4ab835e3058348dab78e3606c5da41e3/FLAG834327eb6 [2018-12-31 22:47:29,093 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/335a370e2/4ab835e3058348dab78e3606c5da41e3 [2018-12-31 22:47:29,098 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-31 22:47:29,100 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-31 22:47:29,101 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-31 22:47:29,102 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-31 22:47:29,106 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-31 22:47:29,107 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.12 10:47:29" (1/1) ... [2018-12-31 22:47:29,112 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@488d0b16 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 10:47:29, skipping insertion in model container [2018-12-31 22:47:29,112 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.12 10:47:29" (1/1) ... [2018-12-31 22:47:29,122 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-31 22:47:29,172 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-31 22:47:29,618 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-31 22:47:29,637 INFO L191 MainTranslator]: Completed pre-run [2018-12-31 22:47:29,791 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-31 22:47:29,871 INFO L195 MainTranslator]: Completed translation [2018-12-31 22:47:29,871 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 10:47:29 WrapperNode [2018-12-31 22:47:29,872 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-31 22:47:29,873 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-31 22:47:29,874 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-31 22:47:29,874 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-31 22:47:29,884 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 10:47:29" (1/1) ... [2018-12-31 22:47:29,914 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 10:47:29" (1/1) ... [2018-12-31 22:47:29,966 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-31 22:47:29,966 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-31 22:47:29,967 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-31 22:47:29,967 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-31 22:47:29,988 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 10:47:29" (1/1) ... [2018-12-31 22:47:29,990 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 10:47:29" (1/1) ... [2018-12-31 22:47:30,001 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 10:47:29" (1/1) ... [2018-12-31 22:47:30,001 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 10:47:29" (1/1) ... [2018-12-31 22:47:30,020 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 10:47:29" (1/1) ... [2018-12-31 22:47:30,027 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 10:47:29" (1/1) ... [2018-12-31 22:47:30,036 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 10:47:29" (1/1) ... [2018-12-31 22:47:30,042 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-31 22:47:30,043 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-31 22:47:30,043 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-31 22:47:30,043 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-31 22:47:30,044 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 10:47:29" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-31 22:47:30,109 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-31 22:47:30,109 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2018-12-31 22:47:30,109 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2018-12-31 22:47:30,109 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-31 22:47:30,109 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2018-12-31 22:47:30,110 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2018-12-31 22:47:30,110 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2018-12-31 22:47:30,110 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2018-12-31 22:47:30,110 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2018-12-31 22:47:30,110 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-31 22:47:30,110 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-31 22:47:30,113 WARN L198 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2018-12-31 22:47:31,258 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-31 22:47:31,259 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-12-31 22:47:31,259 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 10:47:31 BoogieIcfgContainer [2018-12-31 22:47:31,260 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-31 22:47:31,261 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-31 22:47:31,261 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-31 22:47:31,265 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-31 22:47:31,265 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.12 10:47:29" (1/3) ... [2018-12-31 22:47:31,267 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6fcee7b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.12 10:47:31, skipping insertion in model container [2018-12-31 22:47:31,267 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 10:47:29" (2/3) ... [2018-12-31 22:47:31,268 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6fcee7b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.12 10:47:31, skipping insertion in model container [2018-12-31 22:47:31,268 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 10:47:31" (3/3) ... [2018-12-31 22:47:31,270 INFO L112 eAbstractionObserver]: Analyzing ICFG rfi001_pso.opt_false-unreach-call.i [2018-12-31 22:47:31,323 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:47:31,323 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:47:31,324 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:47:31,324 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:47:31,324 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:47:31,325 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:47:31,325 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:47:31,325 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:47:31,325 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:47:31,326 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:47:31,326 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:47:31,326 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:47:31,326 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:47:31,326 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:47:31,327 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:47:31,327 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:47:31,327 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:47:31,328 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:47:31,328 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:47:31,328 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:47:31,328 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:47:31,328 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:47:31,329 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:47:31,329 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:47:31,329 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:47:31,329 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:47:31,330 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:47:31,330 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:47:31,330 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:47:31,330 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:47:31,330 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:47:31,331 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:47:31,331 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:47:31,331 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:47:31,332 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:47:31,332 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:47:31,332 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:47:31,332 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:47:31,332 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:47:31,332 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:47:31,333 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:47:31,333 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:47:31,333 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:47:31,334 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:47:31,334 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:47:31,334 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:47:31,334 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:47:31,334 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:47:31,335 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:47:31,335 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:47:31,335 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:47:31,335 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:47:31,336 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:47:31,336 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:47:31,336 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:47:31,336 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:47:31,336 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:47:31,337 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:47:31,337 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:47:31,337 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:47:31,337 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:47:31,337 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:47:31,338 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:47:31,338 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:47:31,338 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:47:31,338 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:47:31,338 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet16.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:47:31,339 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet16.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:47:31,339 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:47:31,339 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:47:31,339 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet16.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:47:31,339 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet16.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:47:31,370 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2018-12-31 22:47:31,370 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-31 22:47:31,379 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-12-31 22:47:31,398 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2018-12-31 22:47:31,426 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-31 22:47:31,427 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-31 22:47:31,427 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-31 22:47:31,427 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-31 22:47:31,427 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-31 22:47:31,427 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-31 22:47:31,428 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-31 22:47:31,428 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-31 22:47:31,428 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-31 22:47:31,442 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 143places, 181 transitions [2018-12-31 22:47:32,897 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 25089 states. [2018-12-31 22:47:32,899 INFO L276 IsEmpty]: Start isEmpty. Operand 25089 states. [2018-12-31 22:47:32,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-12-31 22:47:32,908 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 22:47:32,909 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-12-31 22:47:32,912 INFO L423 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 22:47:32,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 22:47:32,919 INFO L82 PathProgramCache]: Analyzing trace with hash 2006103772, now seen corresponding path program 1 times [2018-12-31 22:47:32,922 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 22:47:32,922 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 22:47:32,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:47:32,989 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 22:47:32,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:47:33,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 22:47:33,242 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 22:47:33,245 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 22:47:33,245 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 22:47:33,250 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-31 22:47:33,262 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-31 22:47:33,263 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-31 22:47:33,266 INFO L87 Difference]: Start difference. First operand 25089 states. Second operand 4 states. [2018-12-31 22:47:34,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 22:47:34,397 INFO L93 Difference]: Finished difference Result 45389 states and 177627 transitions. [2018-12-31 22:47:34,398 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-31 22:47:34,399 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 38 [2018-12-31 22:47:34,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 22:47:34,723 INFO L225 Difference]: With dead ends: 45389 [2018-12-31 22:47:34,723 INFO L226 Difference]: Without dead ends: 40629 [2018-12-31 22:47:34,725 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-31 22:47:35,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40629 states. [2018-12-31 22:47:36,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40629 to 23663. [2018-12-31 22:47:36,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23663 states. [2018-12-31 22:47:36,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23663 states to 23663 states and 92544 transitions. [2018-12-31 22:47:36,496 INFO L78 Accepts]: Start accepts. Automaton has 23663 states and 92544 transitions. Word has length 38 [2018-12-31 22:47:36,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 22:47:36,496 INFO L480 AbstractCegarLoop]: Abstraction has 23663 states and 92544 transitions. [2018-12-31 22:47:36,496 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-31 22:47:36,498 INFO L276 IsEmpty]: Start isEmpty. Operand 23663 states and 92544 transitions. [2018-12-31 22:47:36,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-12-31 22:47:36,513 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 22:47:36,514 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-12-31 22:47:36,514 INFO L423 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 22:47:36,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 22:47:36,515 INFO L82 PathProgramCache]: Analyzing trace with hash 455349977, now seen corresponding path program 1 times [2018-12-31 22:47:36,515 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 22:47:36,515 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 22:47:36,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:47:36,528 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 22:47:36,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:47:36,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 22:47:36,835 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 22:47:36,836 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 22:47:36,836 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-31 22:47:36,838 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 22:47:36,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 22:47:36,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-31 22:47:36,839 INFO L87 Difference]: Start difference. First operand 23663 states and 92544 transitions. Second operand 5 states. [2018-12-31 22:47:40,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 22:47:40,336 INFO L93 Difference]: Finished difference Result 64831 states and 241370 transitions. [2018-12-31 22:47:40,336 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-31 22:47:40,336 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 45 [2018-12-31 22:47:40,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 22:47:40,626 INFO L225 Difference]: With dead ends: 64831 [2018-12-31 22:47:40,626 INFO L226 Difference]: Without dead ends: 64671 [2018-12-31 22:47:40,627 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-31 22:47:40,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64671 states. [2018-12-31 22:47:42,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64671 to 37143. [2018-12-31 22:47:42,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37143 states. [2018-12-31 22:47:42,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37143 states to 37143 states and 138285 transitions. [2018-12-31 22:47:42,327 INFO L78 Accepts]: Start accepts. Automaton has 37143 states and 138285 transitions. Word has length 45 [2018-12-31 22:47:42,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 22:47:42,328 INFO L480 AbstractCegarLoop]: Abstraction has 37143 states and 138285 transitions. [2018-12-31 22:47:42,328 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 22:47:42,328 INFO L276 IsEmpty]: Start isEmpty. Operand 37143 states and 138285 transitions. [2018-12-31 22:47:42,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-12-31 22:47:42,333 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 22:47:42,333 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-12-31 22:47:42,333 INFO L423 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 22:47:42,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 22:47:42,334 INFO L82 PathProgramCache]: Analyzing trace with hash -636463316, now seen corresponding path program 1 times [2018-12-31 22:47:42,334 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 22:47:42,334 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 22:47:42,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:47:42,339 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 22:47:42,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:47:42,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 22:47:42,453 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 22:47:42,454 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 22:47:42,454 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 22:47:42,454 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-31 22:47:42,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-31 22:47:42,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-31 22:47:42,455 INFO L87 Difference]: Start difference. First operand 37143 states and 138285 transitions. Second operand 4 states. [2018-12-31 22:47:42,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 22:47:42,547 INFO L93 Difference]: Finished difference Result 12365 states and 41178 transitions. [2018-12-31 22:47:42,548 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-31 22:47:42,548 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 46 [2018-12-31 22:47:42,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 22:47:42,580 INFO L225 Difference]: With dead ends: 12365 [2018-12-31 22:47:42,580 INFO L226 Difference]: Without dead ends: 11844 [2018-12-31 22:47:42,581 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-31 22:47:42,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11844 states. [2018-12-31 22:47:42,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11844 to 11844. [2018-12-31 22:47:42,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11844 states. [2018-12-31 22:47:42,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11844 states to 11844 states and 39623 transitions. [2018-12-31 22:47:42,834 INFO L78 Accepts]: Start accepts. Automaton has 11844 states and 39623 transitions. Word has length 46 [2018-12-31 22:47:42,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 22:47:42,834 INFO L480 AbstractCegarLoop]: Abstraction has 11844 states and 39623 transitions. [2018-12-31 22:47:42,834 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-31 22:47:42,834 INFO L276 IsEmpty]: Start isEmpty. Operand 11844 states and 39623 transitions. [2018-12-31 22:47:42,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-12-31 22:47:42,841 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 22:47:42,842 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 22:47:42,842 INFO L423 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 22:47:42,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 22:47:42,842 INFO L82 PathProgramCache]: Analyzing trace with hash -1620049916, now seen corresponding path program 1 times [2018-12-31 22:47:42,842 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 22:47:42,842 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 22:47:42,847 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:47:42,847 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 22:47:42,847 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:47:42,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 22:47:42,996 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 22:47:42,996 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 22:47:42,996 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 22:47:42,996 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-31 22:47:42,997 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-31 22:47:42,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-31 22:47:42,997 INFO L87 Difference]: Start difference. First operand 11844 states and 39623 transitions. Second operand 4 states. [2018-12-31 22:47:43,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 22:47:43,389 INFO L93 Difference]: Finished difference Result 17020 states and 55694 transitions. [2018-12-31 22:47:43,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-31 22:47:43,390 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 59 [2018-12-31 22:47:43,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 22:47:43,421 INFO L225 Difference]: With dead ends: 17020 [2018-12-31 22:47:43,421 INFO L226 Difference]: Without dead ends: 17020 [2018-12-31 22:47:43,422 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-12-31 22:47:43,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17020 states. [2018-12-31 22:47:43,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17020 to 12880. [2018-12-31 22:47:43,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12880 states. [2018-12-31 22:47:43,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12880 states to 12880 states and 42721 transitions. [2018-12-31 22:47:43,748 INFO L78 Accepts]: Start accepts. Automaton has 12880 states and 42721 transitions. Word has length 59 [2018-12-31 22:47:43,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 22:47:43,749 INFO L480 AbstractCegarLoop]: Abstraction has 12880 states and 42721 transitions. [2018-12-31 22:47:43,749 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-31 22:47:43,749 INFO L276 IsEmpty]: Start isEmpty. Operand 12880 states and 42721 transitions. [2018-12-31 22:47:43,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-12-31 22:47:43,757 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 22:47:43,757 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 22:47:43,757 INFO L423 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 22:47:43,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 22:47:43,758 INFO L82 PathProgramCache]: Analyzing trace with hash -1954448924, now seen corresponding path program 1 times [2018-12-31 22:47:43,758 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 22:47:43,758 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 22:47:43,764 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:47:43,764 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 22:47:43,766 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:47:43,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 22:47:44,070 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 22:47:44,070 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 22:47:44,070 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-31 22:47:44,071 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 22:47:44,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 22:47:44,071 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-31 22:47:44,072 INFO L87 Difference]: Start difference. First operand 12880 states and 42721 transitions. Second operand 5 states. [2018-12-31 22:47:44,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 22:47:44,130 INFO L93 Difference]: Finished difference Result 2524 states and 6738 transitions. [2018-12-31 22:47:44,131 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-31 22:47:44,131 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 59 [2018-12-31 22:47:44,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 22:47:44,135 INFO L225 Difference]: With dead ends: 2524 [2018-12-31 22:47:44,135 INFO L226 Difference]: Without dead ends: 2112 [2018-12-31 22:47:44,135 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-12-31 22:47:44,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2112 states. [2018-12-31 22:47:44,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2112 to 2009. [2018-12-31 22:47:44,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2009 states. [2018-12-31 22:47:44,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2009 states to 2009 states and 5341 transitions. [2018-12-31 22:47:44,168 INFO L78 Accepts]: Start accepts. Automaton has 2009 states and 5341 transitions. Word has length 59 [2018-12-31 22:47:44,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 22:47:44,169 INFO L480 AbstractCegarLoop]: Abstraction has 2009 states and 5341 transitions. [2018-12-31 22:47:44,169 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 22:47:44,169 INFO L276 IsEmpty]: Start isEmpty. Operand 2009 states and 5341 transitions. [2018-12-31 22:47:44,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-12-31 22:47:44,174 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 22:47:44,174 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-12-31 22:47:44,174 INFO L423 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 22:47:44,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 22:47:44,175 INFO L82 PathProgramCache]: Analyzing trace with hash -226906360, now seen corresponding path program 1 times [2018-12-31 22:47:44,175 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 22:47:44,175 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 22:47:44,177 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:47:44,178 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 22:47:44,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:47:44,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 22:47:44,385 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 22:47:44,385 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 22:47:44,385 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 22:47:44,386 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-31 22:47:44,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-31 22:47:44,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-31 22:47:44,387 INFO L87 Difference]: Start difference. First operand 2009 states and 5341 transitions. Second operand 4 states. [2018-12-31 22:47:44,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 22:47:44,737 INFO L93 Difference]: Finished difference Result 2446 states and 6388 transitions. [2018-12-31 22:47:44,737 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-31 22:47:44,737 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 92 [2018-12-31 22:47:44,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 22:47:44,742 INFO L225 Difference]: With dead ends: 2446 [2018-12-31 22:47:44,742 INFO L226 Difference]: Without dead ends: 2446 [2018-12-31 22:47:44,743 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-31 22:47:44,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2446 states. [2018-12-31 22:47:44,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2446 to 2098. [2018-12-31 22:47:44,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2098 states. [2018-12-31 22:47:44,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2098 states to 2098 states and 5543 transitions. [2018-12-31 22:47:44,776 INFO L78 Accepts]: Start accepts. Automaton has 2098 states and 5543 transitions. Word has length 92 [2018-12-31 22:47:44,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 22:47:44,777 INFO L480 AbstractCegarLoop]: Abstraction has 2098 states and 5543 transitions. [2018-12-31 22:47:44,777 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-31 22:47:44,777 INFO L276 IsEmpty]: Start isEmpty. Operand 2098 states and 5543 transitions. [2018-12-31 22:47:44,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-12-31 22:47:44,782 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 22:47:44,782 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-12-31 22:47:44,783 INFO L423 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 22:47:44,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 22:47:44,783 INFO L82 PathProgramCache]: Analyzing trace with hash 742674663, now seen corresponding path program 1 times [2018-12-31 22:47:44,783 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 22:47:44,783 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 22:47:44,786 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:47:44,786 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 22:47:44,786 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:47:44,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 22:47:45,214 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 22:47:45,215 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 22:47:45,216 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 22:47:45,216 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-31 22:47:45,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-31 22:47:45,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-31 22:47:45,217 INFO L87 Difference]: Start difference. First operand 2098 states and 5543 transitions. Second operand 4 states. [2018-12-31 22:47:45,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 22:47:45,601 INFO L93 Difference]: Finished difference Result 3056 states and 8113 transitions. [2018-12-31 22:47:45,601 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-31 22:47:45,602 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 92 [2018-12-31 22:47:45,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 22:47:45,606 INFO L225 Difference]: With dead ends: 3056 [2018-12-31 22:47:45,606 INFO L226 Difference]: Without dead ends: 3056 [2018-12-31 22:47:45,607 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-31 22:47:45,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3056 states. [2018-12-31 22:47:45,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3056 to 2063. [2018-12-31 22:47:45,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2063 states. [2018-12-31 22:47:45,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2063 states to 2063 states and 5404 transitions. [2018-12-31 22:47:45,638 INFO L78 Accepts]: Start accepts. Automaton has 2063 states and 5404 transitions. Word has length 92 [2018-12-31 22:47:45,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 22:47:45,638 INFO L480 AbstractCegarLoop]: Abstraction has 2063 states and 5404 transitions. [2018-12-31 22:47:45,639 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-31 22:47:45,639 INFO L276 IsEmpty]: Start isEmpty. Operand 2063 states and 5404 transitions. [2018-12-31 22:47:45,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-12-31 22:47:45,644 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 22:47:45,644 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-12-31 22:47:45,645 INFO L423 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 22:47:45,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 22:47:45,646 INFO L82 PathProgramCache]: Analyzing trace with hash 6831737, now seen corresponding path program 2 times [2018-12-31 22:47:45,646 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 22:47:45,646 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 22:47:45,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:47:45,649 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 22:47:45,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:47:45,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 22:47:45,821 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 22:47:45,821 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 22:47:45,821 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-31 22:47:45,822 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 22:47:45,822 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 22:47:45,822 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-31 22:47:45,822 INFO L87 Difference]: Start difference. First operand 2063 states and 5404 transitions. Second operand 5 states. [2018-12-31 22:47:46,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 22:47:46,105 INFO L93 Difference]: Finished difference Result 2421 states and 6270 transitions. [2018-12-31 22:47:46,106 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-31 22:47:46,106 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 92 [2018-12-31 22:47:46,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 22:47:46,109 INFO L225 Difference]: With dead ends: 2421 [2018-12-31 22:47:46,109 INFO L226 Difference]: Without dead ends: 2421 [2018-12-31 22:47:46,110 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-31 22:47:46,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2421 states. [2018-12-31 22:47:46,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2421 to 2059. [2018-12-31 22:47:46,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2059 states. [2018-12-31 22:47:46,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2059 states to 2059 states and 5395 transitions. [2018-12-31 22:47:46,132 INFO L78 Accepts]: Start accepts. Automaton has 2059 states and 5395 transitions. Word has length 92 [2018-12-31 22:47:46,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 22:47:46,133 INFO L480 AbstractCegarLoop]: Abstraction has 2059 states and 5395 transitions. [2018-12-31 22:47:46,133 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 22:47:46,133 INFO L276 IsEmpty]: Start isEmpty. Operand 2059 states and 5395 transitions. [2018-12-31 22:47:46,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-12-31 22:47:46,137 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 22:47:46,137 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-12-31 22:47:46,137 INFO L423 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 22:47:46,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 22:47:46,138 INFO L82 PathProgramCache]: Analyzing trace with hash -1791236764, now seen corresponding path program 1 times [2018-12-31 22:47:46,138 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 22:47:46,138 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 22:47:46,140 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:47:46,140 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-31 22:47:46,140 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:47:46,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 22:47:46,203 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 22:47:46,204 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 22:47:46,204 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-31 22:47:46,204 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 22:47:46,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 22:47:46,204 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 22:47:46,205 INFO L87 Difference]: Start difference. First operand 2059 states and 5395 transitions. Second operand 3 states. [2018-12-31 22:47:46,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 22:47:46,400 INFO L93 Difference]: Finished difference Result 2109 states and 5502 transitions. [2018-12-31 22:47:46,401 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 22:47:46,401 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 92 [2018-12-31 22:47:46,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 22:47:46,404 INFO L225 Difference]: With dead ends: 2109 [2018-12-31 22:47:46,404 INFO L226 Difference]: Without dead ends: 2109 [2018-12-31 22:47:46,404 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 22:47:46,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2109 states. [2018-12-31 22:47:46,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2109 to 2071. [2018-12-31 22:47:46,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2071 states. [2018-12-31 22:47:46,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2071 states to 2071 states and 5419 transitions. [2018-12-31 22:47:46,424 INFO L78 Accepts]: Start accepts. Automaton has 2071 states and 5419 transitions. Word has length 92 [2018-12-31 22:47:46,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 22:47:46,425 INFO L480 AbstractCegarLoop]: Abstraction has 2071 states and 5419 transitions. [2018-12-31 22:47:46,425 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 22:47:46,425 INFO L276 IsEmpty]: Start isEmpty. Operand 2071 states and 5419 transitions. [2018-12-31 22:47:46,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-31 22:47:46,428 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 22:47:46,428 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-12-31 22:47:46,429 INFO L423 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 22:47:46,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 22:47:46,429 INFO L82 PathProgramCache]: Analyzing trace with hash -1380045558, now seen corresponding path program 1 times [2018-12-31 22:47:46,429 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 22:47:46,429 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 22:47:46,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:47:46,431 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 22:47:46,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:47:46,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 22:47:46,633 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 22:47:46,633 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 22:47:46,634 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 22:47:46,634 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-31 22:47:46,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-31 22:47:46,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-31 22:47:46,634 INFO L87 Difference]: Start difference. First operand 2071 states and 5419 transitions. Second operand 4 states. [2018-12-31 22:47:47,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 22:47:47,116 INFO L93 Difference]: Finished difference Result 3968 states and 10470 transitions. [2018-12-31 22:47:47,117 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-31 22:47:47,117 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 94 [2018-12-31 22:47:47,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 22:47:47,122 INFO L225 Difference]: With dead ends: 3968 [2018-12-31 22:47:47,122 INFO L226 Difference]: Without dead ends: 3968 [2018-12-31 22:47:47,123 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-31 22:47:47,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3968 states. [2018-12-31 22:47:47,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3968 to 2055. [2018-12-31 22:47:47,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2055 states. [2018-12-31 22:47:47,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2055 states to 2055 states and 5338 transitions. [2018-12-31 22:47:47,152 INFO L78 Accepts]: Start accepts. Automaton has 2055 states and 5338 transitions. Word has length 94 [2018-12-31 22:47:47,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 22:47:47,152 INFO L480 AbstractCegarLoop]: Abstraction has 2055 states and 5338 transitions. [2018-12-31 22:47:47,152 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-31 22:47:47,152 INFO L276 IsEmpty]: Start isEmpty. Operand 2055 states and 5338 transitions. [2018-12-31 22:47:47,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-31 22:47:47,156 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 22:47:47,156 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-12-31 22:47:47,156 INFO L423 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 22:47:47,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 22:47:47,157 INFO L82 PathProgramCache]: Analyzing trace with hash -1050279797, now seen corresponding path program 1 times [2018-12-31 22:47:47,158 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 22:47:47,158 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 22:47:47,160 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:47:47,160 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 22:47:47,160 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:47:47,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 22:47:47,453 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 22:47:47,454 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 22:47:47,454 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-31 22:47:47,454 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-31 22:47:47,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-31 22:47:47,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-31 22:47:47,456 INFO L87 Difference]: Start difference. First operand 2055 states and 5338 transitions. Second operand 6 states. [2018-12-31 22:47:47,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 22:47:47,889 INFO L93 Difference]: Finished difference Result 2334 states and 5890 transitions. [2018-12-31 22:47:47,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-31 22:47:47,897 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 94 [2018-12-31 22:47:47,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 22:47:47,901 INFO L225 Difference]: With dead ends: 2334 [2018-12-31 22:47:47,901 INFO L226 Difference]: Without dead ends: 2264 [2018-12-31 22:47:47,902 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-12-31 22:47:47,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2264 states. [2018-12-31 22:47:47,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2264 to 2197. [2018-12-31 22:47:47,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2197 states. [2018-12-31 22:47:47,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2197 states to 2197 states and 5624 transitions. [2018-12-31 22:47:47,925 INFO L78 Accepts]: Start accepts. Automaton has 2197 states and 5624 transitions. Word has length 94 [2018-12-31 22:47:47,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 22:47:47,925 INFO L480 AbstractCegarLoop]: Abstraction has 2197 states and 5624 transitions. [2018-12-31 22:47:47,926 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-31 22:47:47,926 INFO L276 IsEmpty]: Start isEmpty. Operand 2197 states and 5624 transitions. [2018-12-31 22:47:47,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-31 22:47:47,929 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 22:47:47,929 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-12-31 22:47:47,930 INFO L423 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 22:47:47,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 22:47:47,930 INFO L82 PathProgramCache]: Analyzing trace with hash 650460682, now seen corresponding path program 1 times [2018-12-31 22:47:47,930 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 22:47:47,930 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 22:47:47,933 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:47:47,933 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 22:47:47,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:47:47,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 22:47:48,355 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 22:47:48,356 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 22:47:48,356 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-31 22:47:48,356 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-31 22:47:48,356 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-31 22:47:48,356 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-12-31 22:47:48,359 INFO L87 Difference]: Start difference. First operand 2197 states and 5624 transitions. Second operand 7 states. [2018-12-31 22:47:48,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 22:47:48,908 INFO L93 Difference]: Finished difference Result 2415 states and 6163 transitions. [2018-12-31 22:47:48,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-31 22:47:48,909 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 94 [2018-12-31 22:47:48,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 22:47:48,912 INFO L225 Difference]: With dead ends: 2415 [2018-12-31 22:47:48,912 INFO L226 Difference]: Without dead ends: 2415 [2018-12-31 22:47:48,913 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-12-31 22:47:48,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2415 states. [2018-12-31 22:47:48,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2415 to 2181. [2018-12-31 22:47:48,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2181 states. [2018-12-31 22:47:48,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2181 states to 2181 states and 5591 transitions. [2018-12-31 22:47:48,940 INFO L78 Accepts]: Start accepts. Automaton has 2181 states and 5591 transitions. Word has length 94 [2018-12-31 22:47:48,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 22:47:48,940 INFO L480 AbstractCegarLoop]: Abstraction has 2181 states and 5591 transitions. [2018-12-31 22:47:48,940 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-31 22:47:48,940 INFO L276 IsEmpty]: Start isEmpty. Operand 2181 states and 5591 transitions. [2018-12-31 22:47:48,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-31 22:47:48,944 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 22:47:48,945 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-12-31 22:47:48,945 INFO L423 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 22:47:48,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 22:47:48,945 INFO L82 PathProgramCache]: Analyzing trace with hash 2061340202, now seen corresponding path program 1 times [2018-12-31 22:47:48,945 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 22:47:48,945 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 22:47:48,947 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:47:48,947 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 22:47:48,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:47:48,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 22:47:49,267 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 22:47:49,268 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 22:47:49,268 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-31 22:47:49,268 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 22:47:49,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 22:47:49,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-31 22:47:49,269 INFO L87 Difference]: Start difference. First operand 2181 states and 5591 transitions. Second operand 5 states. [2018-12-31 22:47:50,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 22:47:50,162 INFO L93 Difference]: Finished difference Result 4042 states and 10545 transitions. [2018-12-31 22:47:50,163 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-31 22:47:50,163 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 94 [2018-12-31 22:47:50,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 22:47:50,169 INFO L225 Difference]: With dead ends: 4042 [2018-12-31 22:47:50,169 INFO L226 Difference]: Without dead ends: 4016 [2018-12-31 22:47:50,169 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-12-31 22:47:50,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4016 states. [2018-12-31 22:47:50,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4016 to 2235. [2018-12-31 22:47:50,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2235 states. [2018-12-31 22:47:50,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2235 states to 2235 states and 5717 transitions. [2018-12-31 22:47:50,201 INFO L78 Accepts]: Start accepts. Automaton has 2235 states and 5717 transitions. Word has length 94 [2018-12-31 22:47:50,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 22:47:50,202 INFO L480 AbstractCegarLoop]: Abstraction has 2235 states and 5717 transitions. [2018-12-31 22:47:50,202 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 22:47:50,202 INFO L276 IsEmpty]: Start isEmpty. Operand 2235 states and 5717 transitions. [2018-12-31 22:47:50,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-31 22:47:50,205 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 22:47:50,206 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-12-31 22:47:50,206 INFO L423 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 22:47:50,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 22:47:50,206 INFO L82 PathProgramCache]: Analyzing trace with hash -1443186967, now seen corresponding path program 1 times [2018-12-31 22:47:50,206 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 22:47:50,206 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 22:47:50,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:47:50,208 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 22:47:50,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:47:50,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 22:47:50,645 WARN L181 SmtUtils]: Spent 235.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 14 [2018-12-31 22:47:50,917 WARN L181 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 9 [2018-12-31 22:47:50,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-12-31 22:47:50,939 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 22:47:50,940 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-31 22:47:50,940 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 22:47:50,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 22:47:50,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-31 22:47:50,940 INFO L87 Difference]: Start difference. First operand 2235 states and 5717 transitions. Second operand 5 states. [2018-12-31 22:47:51,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 22:47:51,215 INFO L93 Difference]: Finished difference Result 1991 states and 5072 transitions. [2018-12-31 22:47:51,216 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-31 22:47:51,216 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 94 [2018-12-31 22:47:51,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 22:47:51,220 INFO L225 Difference]: With dead ends: 1991 [2018-12-31 22:47:51,220 INFO L226 Difference]: Without dead ends: 1991 [2018-12-31 22:47:51,220 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-12-31 22:47:51,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1991 states. [2018-12-31 22:47:51,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1991 to 1989. [2018-12-31 22:47:51,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1989 states. [2018-12-31 22:47:51,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1989 states to 1989 states and 5068 transitions. [2018-12-31 22:47:51,243 INFO L78 Accepts]: Start accepts. Automaton has 1989 states and 5068 transitions. Word has length 94 [2018-12-31 22:47:51,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 22:47:51,243 INFO L480 AbstractCegarLoop]: Abstraction has 1989 states and 5068 transitions. [2018-12-31 22:47:51,243 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 22:47:51,243 INFO L276 IsEmpty]: Start isEmpty. Operand 1989 states and 5068 transitions. [2018-12-31 22:47:51,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-31 22:47:51,247 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 22:47:51,247 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-12-31 22:47:51,248 INFO L423 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 22:47:51,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 22:47:51,248 INFO L82 PathProgramCache]: Analyzing trace with hash -1220650390, now seen corresponding path program 1 times [2018-12-31 22:47:51,248 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 22:47:51,248 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 22:47:51,250 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:47:51,250 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 22:47:51,250 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:47:51,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 22:47:51,415 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 22:47:51,415 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 22:47:51,416 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 22:47:51,416 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-31 22:47:51,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-31 22:47:51,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-31 22:47:51,416 INFO L87 Difference]: Start difference. First operand 1989 states and 5068 transitions. Second operand 4 states. [2018-12-31 22:47:51,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 22:47:51,554 INFO L93 Difference]: Finished difference Result 2325 states and 5988 transitions. [2018-12-31 22:47:51,555 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-31 22:47:51,555 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 94 [2018-12-31 22:47:51,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 22:47:51,559 INFO L225 Difference]: With dead ends: 2325 [2018-12-31 22:47:51,560 INFO L226 Difference]: Without dead ends: 2325 [2018-12-31 22:47:51,560 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-31 22:47:51,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2325 states. [2018-12-31 22:47:51,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2325 to 2293. [2018-12-31 22:47:51,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2293 states. [2018-12-31 22:47:51,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2293 states to 2293 states and 5908 transitions. [2018-12-31 22:47:51,595 INFO L78 Accepts]: Start accepts. Automaton has 2293 states and 5908 transitions. Word has length 94 [2018-12-31 22:47:51,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 22:47:51,596 INFO L480 AbstractCegarLoop]: Abstraction has 2293 states and 5908 transitions. [2018-12-31 22:47:51,596 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-31 22:47:51,596 INFO L276 IsEmpty]: Start isEmpty. Operand 2293 states and 5908 transitions. [2018-12-31 22:47:51,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-31 22:47:51,602 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 22:47:51,603 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-12-31 22:47:51,603 INFO L423 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 22:47:51,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 22:47:51,603 INFO L82 PathProgramCache]: Analyzing trace with hash 997107563, now seen corresponding path program 1 times [2018-12-31 22:47:51,603 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 22:47:51,605 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 22:47:51,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:47:51,608 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 22:47:51,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:47:51,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 22:47:51,821 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 22:47:51,821 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 22:47:51,821 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-31 22:47:51,822 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-31 22:47:51,822 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-31 22:47:51,822 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-31 22:47:51,822 INFO L87 Difference]: Start difference. First operand 2293 states and 5908 transitions. Second operand 6 states. [2018-12-31 22:47:52,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 22:47:52,092 INFO L93 Difference]: Finished difference Result 2005 states and 5012 transitions. [2018-12-31 22:47:52,093 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-31 22:47:52,093 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 94 [2018-12-31 22:47:52,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 22:47:52,097 INFO L225 Difference]: With dead ends: 2005 [2018-12-31 22:47:52,097 INFO L226 Difference]: Without dead ends: 2005 [2018-12-31 22:47:52,098 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2018-12-31 22:47:52,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2005 states. [2018-12-31 22:47:52,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2005 to 1668. [2018-12-31 22:47:52,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1668 states. [2018-12-31 22:47:52,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1668 states to 1668 states and 4216 transitions. [2018-12-31 22:47:52,121 INFO L78 Accepts]: Start accepts. Automaton has 1668 states and 4216 transitions. Word has length 94 [2018-12-31 22:47:52,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 22:47:52,122 INFO L480 AbstractCegarLoop]: Abstraction has 1668 states and 4216 transitions. [2018-12-31 22:47:52,122 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-31 22:47:52,122 INFO L276 IsEmpty]: Start isEmpty. Operand 1668 states and 4216 transitions. [2018-12-31 22:47:52,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-31 22:47:52,126 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 22:47:52,126 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-12-31 22:47:52,126 INFO L423 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 22:47:52,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 22:47:52,126 INFO L82 PathProgramCache]: Analyzing trace with hash -896804400, now seen corresponding path program 1 times [2018-12-31 22:47:52,127 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 22:47:52,127 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 22:47:52,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:47:52,128 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 22:47:52,129 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:47:52,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 22:47:52,318 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 22:47:52,319 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 22:47:52,319 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-31 22:47:52,319 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-31 22:47:52,320 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-31 22:47:52,320 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-12-31 22:47:52,320 INFO L87 Difference]: Start difference. First operand 1668 states and 4216 transitions. Second operand 8 states. [2018-12-31 22:47:52,738 WARN L181 SmtUtils]: Spent 308.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2018-12-31 22:47:53,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 22:47:53,430 INFO L93 Difference]: Finished difference Result 4730 states and 12191 transitions. [2018-12-31 22:47:53,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-12-31 22:47:53,431 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 96 [2018-12-31 22:47:53,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 22:47:53,438 INFO L225 Difference]: With dead ends: 4730 [2018-12-31 22:47:53,438 INFO L226 Difference]: Without dead ends: 4730 [2018-12-31 22:47:53,439 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=88, Invalid=292, Unknown=0, NotChecked=0, Total=380 [2018-12-31 22:47:53,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4730 states. [2018-12-31 22:47:53,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4730 to 2396. [2018-12-31 22:47:53,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2396 states. [2018-12-31 22:47:53,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2396 states to 2396 states and 6085 transitions. [2018-12-31 22:47:53,477 INFO L78 Accepts]: Start accepts. Automaton has 2396 states and 6085 transitions. Word has length 96 [2018-12-31 22:47:53,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 22:47:53,477 INFO L480 AbstractCegarLoop]: Abstraction has 2396 states and 6085 transitions. [2018-12-31 22:47:53,477 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-31 22:47:53,477 INFO L276 IsEmpty]: Start isEmpty. Operand 2396 states and 6085 transitions. [2018-12-31 22:47:53,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-31 22:47:53,481 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 22:47:53,481 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-12-31 22:47:53,481 INFO L423 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 22:47:53,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 22:47:53,482 INFO L82 PathProgramCache]: Analyzing trace with hash 347960081, now seen corresponding path program 1 times [2018-12-31 22:47:53,482 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 22:47:53,482 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 22:47:53,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:47:53,484 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 22:47:53,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:47:53,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 22:47:53,643 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 22:47:53,643 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 22:47:53,643 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-31 22:47:53,644 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 22:47:53,644 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 22:47:53,644 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-31 22:47:53,644 INFO L87 Difference]: Start difference. First operand 2396 states and 6085 transitions. Second operand 5 states. [2018-12-31 22:47:53,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 22:47:53,685 INFO L93 Difference]: Finished difference Result 4125 states and 10700 transitions. [2018-12-31 22:47:53,686 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-31 22:47:53,686 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 96 [2018-12-31 22:47:53,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 22:47:53,691 INFO L225 Difference]: With dead ends: 4125 [2018-12-31 22:47:53,691 INFO L226 Difference]: Without dead ends: 4125 [2018-12-31 22:47:53,692 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-12-31 22:47:53,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4125 states. [2018-12-31 22:47:53,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4125 to 2333. [2018-12-31 22:47:53,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2333 states. [2018-12-31 22:47:53,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2333 states to 2333 states and 5892 transitions. [2018-12-31 22:47:53,724 INFO L78 Accepts]: Start accepts. Automaton has 2333 states and 5892 transitions. Word has length 96 [2018-12-31 22:47:53,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 22:47:53,724 INFO L480 AbstractCegarLoop]: Abstraction has 2333 states and 5892 transitions. [2018-12-31 22:47:53,724 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 22:47:53,724 INFO L276 IsEmpty]: Start isEmpty. Operand 2333 states and 5892 transitions. [2018-12-31 22:47:53,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-31 22:47:53,728 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 22:47:53,729 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-12-31 22:47:53,729 INFO L423 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 22:47:53,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 22:47:53,729 INFO L82 PathProgramCache]: Analyzing trace with hash -567038639, now seen corresponding path program 1 times [2018-12-31 22:47:53,729 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 22:47:53,729 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 22:47:53,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:47:53,733 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 22:47:53,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:47:53,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 22:47:54,085 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 22:47:54,085 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 22:47:54,085 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-31 22:47:54,087 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 22:47:54,087 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 22:47:54,087 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-31 22:47:54,087 INFO L87 Difference]: Start difference. First operand 2333 states and 5892 transitions. Second operand 5 states. [2018-12-31 22:47:55,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 22:47:55,058 INFO L93 Difference]: Finished difference Result 2653 states and 6692 transitions. [2018-12-31 22:47:55,058 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-31 22:47:55,059 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 96 [2018-12-31 22:47:55,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 22:47:55,062 INFO L225 Difference]: With dead ends: 2653 [2018-12-31 22:47:55,062 INFO L226 Difference]: Without dead ends: 2653 [2018-12-31 22:47:55,063 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-12-31 22:47:55,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2653 states. [2018-12-31 22:47:55,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2653 to 2081. [2018-12-31 22:47:55,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2081 states. [2018-12-31 22:47:55,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2081 states to 2081 states and 5265 transitions. [2018-12-31 22:47:55,089 INFO L78 Accepts]: Start accepts. Automaton has 2081 states and 5265 transitions. Word has length 96 [2018-12-31 22:47:55,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 22:47:55,089 INFO L480 AbstractCegarLoop]: Abstraction has 2081 states and 5265 transitions. [2018-12-31 22:47:55,089 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 22:47:55,089 INFO L276 IsEmpty]: Start isEmpty. Operand 2081 states and 5265 transitions. [2018-12-31 22:47:55,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-31 22:47:55,093 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 22:47:55,093 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-12-31 22:47:55,094 INFO L423 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 22:47:55,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 22:47:55,094 INFO L82 PathProgramCache]: Analyzing trace with hash 677725842, now seen corresponding path program 1 times [2018-12-31 22:47:55,094 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 22:47:55,094 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 22:47:55,096 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:47:55,096 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 22:47:55,096 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:47:55,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 22:47:55,361 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 22:47:55,361 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 22:47:55,361 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-12-31 22:47:55,362 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-31 22:47:55,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-31 22:47:55,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-12-31 22:47:55,362 INFO L87 Difference]: Start difference. First operand 2081 states and 5265 transitions. Second operand 10 states. [2018-12-31 22:47:55,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 22:47:55,897 INFO L93 Difference]: Finished difference Result 3834 states and 9903 transitions. [2018-12-31 22:47:55,899 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-31 22:47:55,899 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 96 [2018-12-31 22:47:55,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 22:47:55,902 INFO L225 Difference]: With dead ends: 3834 [2018-12-31 22:47:55,903 INFO L226 Difference]: Without dead ends: 1799 [2018-12-31 22:47:55,903 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=69, Invalid=171, Unknown=0, NotChecked=0, Total=240 [2018-12-31 22:47:55,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1799 states. [2018-12-31 22:47:55,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1799 to 1799. [2018-12-31 22:47:55,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1799 states. [2018-12-31 22:47:55,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1799 states to 1799 states and 4708 transitions. [2018-12-31 22:47:55,922 INFO L78 Accepts]: Start accepts. Automaton has 1799 states and 4708 transitions. Word has length 96 [2018-12-31 22:47:55,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 22:47:55,923 INFO L480 AbstractCegarLoop]: Abstraction has 1799 states and 4708 transitions. [2018-12-31 22:47:55,923 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-31 22:47:55,923 INFO L276 IsEmpty]: Start isEmpty. Operand 1799 states and 4708 transitions. [2018-12-31 22:47:55,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-31 22:47:55,925 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 22:47:55,926 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-12-31 22:47:55,926 INFO L423 AbstractCegarLoop]: === Iteration 21 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 22:47:55,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 22:47:55,926 INFO L82 PathProgramCache]: Analyzing trace with hash 1311116434, now seen corresponding path program 2 times [2018-12-31 22:47:55,926 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 22:47:55,926 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 22:47:55,928 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:47:55,928 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 22:47:55,928 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:47:55,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 22:47:56,169 WARN L181 SmtUtils]: Spent 172.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-12-31 22:47:56,628 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 22:47:56,628 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 22:47:56,628 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-12-31 22:47:56,629 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-31 22:47:56,629 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-31 22:47:56,629 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-12-31 22:47:56,629 INFO L87 Difference]: Start difference. First operand 1799 states and 4708 transitions. Second operand 12 states. [2018-12-31 22:47:57,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 22:47:57,297 INFO L93 Difference]: Finished difference Result 3406 states and 9006 transitions. [2018-12-31 22:47:57,298 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-12-31 22:47:57,298 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 96 [2018-12-31 22:47:57,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 22:47:57,301 INFO L225 Difference]: With dead ends: 3406 [2018-12-31 22:47:57,301 INFO L226 Difference]: Without dead ends: 2430 [2018-12-31 22:47:57,302 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=100, Invalid=550, Unknown=0, NotChecked=0, Total=650 [2018-12-31 22:47:57,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2430 states. [2018-12-31 22:47:57,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2430 to 2278. [2018-12-31 22:47:57,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2278 states. [2018-12-31 22:47:57,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2278 states to 2278 states and 5830 transitions. [2018-12-31 22:47:57,327 INFO L78 Accepts]: Start accepts. Automaton has 2278 states and 5830 transitions. Word has length 96 [2018-12-31 22:47:57,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 22:47:57,327 INFO L480 AbstractCegarLoop]: Abstraction has 2278 states and 5830 transitions. [2018-12-31 22:47:57,327 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-31 22:47:57,327 INFO L276 IsEmpty]: Start isEmpty. Operand 2278 states and 5830 transitions. [2018-12-31 22:47:57,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-31 22:47:57,331 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 22:47:57,331 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-12-31 22:47:57,331 INFO L423 AbstractCegarLoop]: === Iteration 22 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 22:47:57,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 22:47:57,332 INFO L82 PathProgramCache]: Analyzing trace with hash 187348118, now seen corresponding path program 3 times [2018-12-31 22:47:57,332 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 22:47:57,332 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 22:47:57,334 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:47:57,334 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-31 22:47:57,334 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:47:57,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-31 22:47:57,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-31 22:47:57,433 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-31 22:47:57,631 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-12-31 22:47:57,632 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.12 10:47:57 BasicIcfg [2018-12-31 22:47:57,633 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-31 22:47:57,634 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-31 22:47:57,634 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-31 22:47:57,634 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-31 22:47:57,636 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 10:47:31" (3/4) ... [2018-12-31 22:47:57,640 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-31 22:47:57,849 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2018-12-31 22:47:57,849 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-31 22:47:57,850 INFO L168 Benchmark]: Toolchain (without parser) took 28751.35 ms. Allocated memory was 1.0 GB in the beginning and 2.4 GB in the end (delta: 1.4 GB). Free memory was 946.0 MB in the beginning and 1.4 GB in the end (delta: -428.5 MB). Peak memory consumption was 928.3 MB. Max. memory is 11.5 GB. [2018-12-31 22:47:57,851 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-31 22:47:57,852 INFO L168 Benchmark]: CACSL2BoogieTranslator took 770.59 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 151.5 MB). Free memory was 940.6 MB in the beginning and 1.1 GB in the end (delta: -183.8 MB). Peak memory consumption was 25.8 MB. Max. memory is 11.5 GB. [2018-12-31 22:47:57,852 INFO L168 Benchmark]: Boogie Procedure Inliner took 92.75 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2018-12-31 22:47:57,852 INFO L168 Benchmark]: Boogie Preprocessor took 75.98 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-31 22:47:57,853 INFO L168 Benchmark]: RCFGBuilder took 1216.97 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: 44.4 MB). Peak memory consumption was 44.4 MB. Max. memory is 11.5 GB. [2018-12-31 22:47:57,855 INFO L168 Benchmark]: TraceAbstraction took 26372.30 ms. Allocated memory was 1.2 GB in the beginning and 2.4 GB in the end (delta: 1.2 GB). Free memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: -328.7 MB). Peak memory consumption was 876.7 MB. Max. memory is 11.5 GB. [2018-12-31 22:47:57,855 INFO L168 Benchmark]: Witness Printer took 215.17 ms. Allocated memory is still 2.4 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 27.5 MB). Peak memory consumption was 27.5 MB. Max. memory is 11.5 GB. [2018-12-31 22:47:57,858 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.18 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 770.59 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 151.5 MB). Free memory was 940.6 MB in the beginning and 1.1 GB in the end (delta: -183.8 MB). Peak memory consumption was 25.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 92.75 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 75.98 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 1216.97 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: 44.4 MB). Peak memory consumption was 44.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 26372.30 ms. Allocated memory was 1.2 GB in the beginning and 2.4 GB in the end (delta: 1.2 GB). Free memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: -328.7 MB). Peak memory consumption was 876.7 MB. Max. memory is 11.5 GB. * Witness Printer took 215.17 ms. Allocated memory is still 2.4 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 27.5 MB). Peak memory consumption was 27.5 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] [L681] -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, y=0] [L682] -1 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L683] -1 int y$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L684] -1 _Bool y$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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0] [L685] -1 _Bool y$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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0] [L686] -1 _Bool y$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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0] [L687] -1 _Bool y$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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0] [L688] -1 _Bool y$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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0] [L689] -1 _Bool y$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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0] [L690] -1 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0] [L691] -1 int *y$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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}] [L692] -1 int y$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0] [L693] -1 _Bool y$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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0] [L694] -1 int y$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0] [L695] -1 _Bool y$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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L765] -1 pthread_t t1609; 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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L766] FCALL, FORK -1 pthread_create(&t1609, ((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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L767] -1 pthread_t t1610; 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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L768] FCALL, FORK -1 pthread_create(&t1610, ((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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L723] 0 y$w_buff1 = y$w_buff0 [L724] 0 y$w_buff0 = 2 [L725] 0 y$w_buff1_used = y$w_buff0_used [L726] 0 y$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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L728] 0 y$r_buff1_thd0 = y$r_buff0_thd0 [L729] 0 y$r_buff1_thd1 = y$r_buff0_thd1 [L730] 0 y$r_buff1_thd2 = y$r_buff0_thd2 [L731] 0 y$r_buff0_thd2 = (_Bool)1 [L734] 0 z = 1 [L737] 0 __unbuffered_p1_EAX = z [L740] 0 __unbuffered_p1_EBX = 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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L743] EXPR 0 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L703] 1 x = 1 [L706] 1 y = 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, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L743] 0 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L744] EXPR 0 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$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=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L709] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) 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, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L744] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L709] EXPR 1 y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y 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, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y=2, z=1] [L745] EXPR 0 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=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, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y=2, z=1] [L745] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L709] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) 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, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y)=2, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y=2, z=1] [L709] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L710] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$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=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L746] EXPR 0 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$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=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L710] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L746] 0 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L747] EXPR 0 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=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, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L747] 0 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [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=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L711] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$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=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L711] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L712] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$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=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L712] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L713] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$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=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L713] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$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=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [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=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L774] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [__unbuffered_cnt=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=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L774] EXPR -1 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y 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=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L774] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [__unbuffered_cnt=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=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L774] -1 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L775] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$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=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L775] -1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L776] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=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=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L776] -1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L777] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$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=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L777] -1 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L778] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [__unbuffered_cnt=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=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L778] -1 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L781] -1 weak$$choice0 = __VERIFIER_nondet_pointer() [L782] -1 weak$$choice2 = __VERIFIER_nondet_pointer() [L783] -1 y$flush_delayed = weak$$choice2 [L784] -1 y$mem_tmp = y 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=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L785] EXPR -1 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) VAL [__unbuffered_cnt=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=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L785] -1 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L786] EXPR -1 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=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=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L786] -1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L787] EXPR -1 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=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=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L787] -1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L788] EXPR -1 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=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=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L788] -1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L789] EXPR -1 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=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=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L789] -1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L790] EXPR -1 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) VAL [__unbuffered_cnt=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=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L790] -1 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L791] EXPR -1 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=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=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L791] -1 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L792] -1 main$tmp_guard1 = !(y == 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=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L793] EXPR -1 y$flush_delayed ? y$mem_tmp : y 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=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L793] -1 y = y$flush_delayed ? y$mem_tmp : y [L794] -1 y$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=1, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L4] COND TRUE -1 !expression VAL [__unbuffered_cnt=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=1, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L4] -1 __VERIFIER_error() VAL [__unbuffered_cnt=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=1, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 181 locations, 3 error locations. UNSAFE Result, 26.2s OverallTime, 22 OverallIterations, 1 TraceHistogramMax, 13.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 4504 SDtfs, 4387 SDslu, 9791 SDs, 0 SdLazy, 3422 SolverSat, 226 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 8.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 202 GetRequests, 61 SyntacticMatches, 17 SemanticMatches, 124 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 174 ImplicationChecksByTransitivity, 5.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=37143occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 4.4s AutomataMinimizationTime, 21 MinimizatonAttempts, 59694 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 5.1s InterpolantComputationTime, 1849 NumberOfCodeBlocks, 1849 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 1732 ConstructedInterpolants, 0 QuantifiedInterpolants, 335324 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 21 InterpolantComputations, 21 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...