./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/pthread-wmm/rfi000_rmo.opt_false-unreach-call.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0ed9222f 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/rfi000_rmo.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 b75e5b8cdb5de0dc84c69b534dde09e58e02f350 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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-0ed9222-m [2019-01-13 03:40:28,210 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-13 03:40:28,212 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-13 03:40:28,225 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-13 03:40:28,226 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-13 03:40:28,227 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-13 03:40:28,228 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-13 03:40:28,230 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-13 03:40:28,232 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-13 03:40:28,233 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-13 03:40:28,234 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-13 03:40:28,235 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-13 03:40:28,235 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-13 03:40:28,237 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-13 03:40:28,238 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-13 03:40:28,239 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-13 03:40:28,240 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-13 03:40:28,242 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-13 03:40:28,244 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-13 03:40:28,246 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-13 03:40:28,247 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-13 03:40:28,248 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-13 03:40:28,251 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-13 03:40:28,251 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-13 03:40:28,252 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-13 03:40:28,253 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-13 03:40:28,254 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-13 03:40:28,255 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-13 03:40:28,256 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-13 03:40:28,257 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-13 03:40:28,258 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-13 03:40:28,258 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-13 03:40:28,258 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-13 03:40:28,259 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-13 03:40:28,260 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-13 03:40:28,261 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-13 03:40:28,262 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-01-13 03:40:28,284 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-13 03:40:28,285 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-13 03:40:28,286 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-13 03:40:28,287 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-13 03:40:28,287 INFO L133 SettingsManager]: * Use SBE=true [2019-01-13 03:40:28,287 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-13 03:40:28,287 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-13 03:40:28,287 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-13 03:40:28,287 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-13 03:40:28,289 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-13 03:40:28,289 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-13 03:40:28,289 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-13 03:40:28,289 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-13 03:40:28,289 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-13 03:40:28,290 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-13 03:40:28,290 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-13 03:40:28,290 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-13 03:40:28,290 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-13 03:40:28,290 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-13 03:40:28,290 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-13 03:40:28,291 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-13 03:40:28,292 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-13 03:40:28,292 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-13 03:40:28,292 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-13 03:40:28,293 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-13 03:40:28,293 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-13 03:40:28,293 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-13 03:40:28,293 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-13 03:40:28,293 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 -> b75e5b8cdb5de0dc84c69b534dde09e58e02f350 [2019-01-13 03:40:28,347 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-13 03:40:28,365 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-13 03:40:28,369 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-13 03:40:28,370 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-13 03:40:28,371 INFO L276 PluginConnector]: CDTParser initialized [2019-01-13 03:40:28,371 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/pthread-wmm/rfi000_rmo.opt_false-unreach-call.i [2019-01-13 03:40:28,434 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/660870db6/3c3e981929204dadb6b780197c3954f6/FLAG747411412 [2019-01-13 03:40:28,968 INFO L307 CDTParser]: Found 1 translation units. [2019-01-13 03:40:28,970 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/pthread-wmm/rfi000_rmo.opt_false-unreach-call.i [2019-01-13 03:40:28,984 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/660870db6/3c3e981929204dadb6b780197c3954f6/FLAG747411412 [2019-01-13 03:40:29,200 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/660870db6/3c3e981929204dadb6b780197c3954f6 [2019-01-13 03:40:29,203 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-13 03:40:29,205 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-13 03:40:29,206 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-13 03:40:29,206 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-13 03:40:29,210 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-13 03:40:29,211 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.01 03:40:29" (1/1) ... [2019-01-13 03:40:29,214 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@545503fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 03:40:29, skipping insertion in model container [2019-01-13 03:40:29,214 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.01 03:40:29" (1/1) ... [2019-01-13 03:40:29,223 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-13 03:40:29,285 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-13 03:40:29,667 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-13 03:40:29,686 INFO L191 MainTranslator]: Completed pre-run [2019-01-13 03:40:29,823 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-13 03:40:29,911 INFO L195 MainTranslator]: Completed translation [2019-01-13 03:40:29,912 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 03:40:29 WrapperNode [2019-01-13 03:40:29,912 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-13 03:40:29,914 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-13 03:40:29,914 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-13 03:40:29,914 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-13 03:40:29,924 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 03:40:29" (1/1) ... [2019-01-13 03:40:29,953 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 03:40:29" (1/1) ... [2019-01-13 03:40:30,015 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-13 03:40:30,016 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-13 03:40:30,016 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-13 03:40:30,016 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-13 03:40:30,032 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 03:40:29" (1/1) ... [2019-01-13 03:40:30,032 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 03:40:29" (1/1) ... [2019-01-13 03:40:30,041 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 03:40:29" (1/1) ... [2019-01-13 03:40:30,041 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 03:40:29" (1/1) ... [2019-01-13 03:40:30,068 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 03:40:29" (1/1) ... [2019-01-13 03:40:30,080 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 03:40:29" (1/1) ... [2019-01-13 03:40:30,086 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 03:40:29" (1/1) ... [2019-01-13 03:40:30,094 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-13 03:40:30,095 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-13 03:40:30,095 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-13 03:40:30,095 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-13 03:40:30,098 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 03:40: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 [2019-01-13 03:40:30,176 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-13 03:40:30,178 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-01-13 03:40:30,179 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-13 03:40:30,179 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-13 03:40:30,179 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-01-13 03:40:30,179 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-01-13 03:40:30,180 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-01-13 03:40:30,180 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-01-13 03:40:30,180 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-01-13 03:40:30,180 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-13 03:40:30,180 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-13 03:40:30,184 WARN L204 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-01-13 03:40:31,332 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-13 03:40:31,333 INFO L286 CfgBuilder]: Removed 8 assue(true) statements. [2019-01-13 03:40:31,334 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.01 03:40:31 BoogieIcfgContainer [2019-01-13 03:40:31,335 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-13 03:40:31,336 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-13 03:40:31,336 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-13 03:40:31,340 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-13 03:40:31,341 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.01 03:40:29" (1/3) ... [2019-01-13 03:40:31,342 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41d28d23 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.01 03:40:31, skipping insertion in model container [2019-01-13 03:40:31,342 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 03:40:29" (2/3) ... [2019-01-13 03:40:31,342 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41d28d23 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.01 03:40:31, skipping insertion in model container [2019-01-13 03:40:31,343 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.01 03:40:31" (3/3) ... [2019-01-13 03:40:31,345 INFO L112 eAbstractionObserver]: Analyzing ICFG rfi000_rmo.opt_false-unreach-call.i [2019-01-13 03:40:31,391 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:40:31,391 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:40:31,391 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:40:31,391 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:40:31,392 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:40:31,392 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:40:31,392 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:40:31,394 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:40:31,394 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:40:31,395 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:40:31,395 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:40:31,395 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:40:31,395 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:40:31,396 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:40:31,397 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:40:31,397 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:40:31,397 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:40:31,398 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:40:31,398 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:40:31,398 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:40:31,398 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:40:31,400 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:40:31,400 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:40:31,400 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:40:31,401 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:40:31,401 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:40:31,402 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:40:31,402 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:40:31,403 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:40:31,403 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:40:31,403 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:40:31,403 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:40:31,403 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:40:31,403 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:40:31,405 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:40:31,405 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:40:31,406 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:40:31,406 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:40:31,406 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:40:31,406 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:40:31,406 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:40:31,407 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:40:31,408 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:40:31,408 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:40:31,409 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:40:31,409 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:40:31,409 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:40:31,409 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:40:31,409 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:40:31,410 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:40:31,411 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:40:31,411 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:40:31,411 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:40:31,412 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:40:31,412 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:40:31,412 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:40:31,412 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:40:31,413 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:40:31,414 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:40:31,415 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:40:31,415 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:40:31,415 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:40:31,415 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:40:31,415 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:40:31,417 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:40:31,417 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:40:31,417 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet16.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:40:31,417 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet16.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:40:31,417 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:40:31,418 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:40:31,419 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet16.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:40:31,419 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet16.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:40:31,450 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-01-13 03:40:31,450 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-13 03:40:31,460 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2019-01-13 03:40:31,479 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2019-01-13 03:40:31,509 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-13 03:40:31,510 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-13 03:40:31,510 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-13 03:40:31,510 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-13 03:40:31,510 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-13 03:40:31,510 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-13 03:40:31,511 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-13 03:40:31,511 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-13 03:40:31,511 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-13 03:40:31,529 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 142places, 180 transitions [2019-01-13 03:40:33,195 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 25088 states. [2019-01-13 03:40:33,197 INFO L276 IsEmpty]: Start isEmpty. Operand 25088 states. [2019-01-13 03:40:33,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-01-13 03:40:33,205 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:40:33,207 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] [2019-01-13 03:40:33,209 INFO L423 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:40:33,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:40:33,216 INFO L82 PathProgramCache]: Analyzing trace with hash -1172530028, now seen corresponding path program 1 times [2019-01-13 03:40:33,218 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:40:33,219 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:40:33,276 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:40:33,277 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 03:40:33,277 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:40:33,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:40:33,619 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 03:40:33,622 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:40:33,622 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-13 03:40:33,627 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-13 03:40:33,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-13 03:40:33,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-13 03:40:33,646 INFO L87 Difference]: Start difference. First operand 25088 states. Second operand 4 states. [2019-01-13 03:40:34,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:40:34,940 INFO L93 Difference]: Finished difference Result 45388 states and 177626 transitions. [2019-01-13 03:40:34,941 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-13 03:40:34,942 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 37 [2019-01-13 03:40:34,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:40:35,332 INFO L225 Difference]: With dead ends: 45388 [2019-01-13 03:40:35,333 INFO L226 Difference]: Without dead ends: 40628 [2019-01-13 03:40:35,337 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-13 03:40:36,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40628 states. [2019-01-13 03:40:36,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40628 to 23662. [2019-01-13 03:40:36,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23662 states. [2019-01-13 03:40:37,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23662 states to 23662 states and 92543 transitions. [2019-01-13 03:40:37,195 INFO L78 Accepts]: Start accepts. Automaton has 23662 states and 92543 transitions. Word has length 37 [2019-01-13 03:40:37,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:40:37,196 INFO L480 AbstractCegarLoop]: Abstraction has 23662 states and 92543 transitions. [2019-01-13 03:40:37,196 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-13 03:40:37,196 INFO L276 IsEmpty]: Start isEmpty. Operand 23662 states and 92543 transitions. [2019-01-13 03:40:37,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-01-13 03:40:37,212 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:40:37,212 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] [2019-01-13 03:40:37,213 INFO L423 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:40:37,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:40:37,213 INFO L82 PathProgramCache]: Analyzing trace with hash -1746574175, now seen corresponding path program 1 times [2019-01-13 03:40:37,213 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:40:37,213 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:40:37,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:40:37,224 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 03:40:37,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:40:37,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:40:37,501 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 03:40:37,501 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:40:37,501 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-13 03:40:37,503 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-13 03:40:37,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-13 03:40:37,504 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-13 03:40:37,504 INFO L87 Difference]: Start difference. First operand 23662 states and 92543 transitions. Second operand 5 states. [2019-01-13 03:40:40,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:40:40,547 INFO L93 Difference]: Finished difference Result 64830 states and 241369 transitions. [2019-01-13 03:40:40,547 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-13 03:40:40,548 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 44 [2019-01-13 03:40:40,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:40:40,899 INFO L225 Difference]: With dead ends: 64830 [2019-01-13 03:40:40,899 INFO L226 Difference]: Without dead ends: 64670 [2019-01-13 03:40:40,900 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 [2019-01-13 03:40:41,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64670 states. [2019-01-13 03:40:42,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64670 to 37142. [2019-01-13 03:40:42,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37142 states. [2019-01-13 03:40:42,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37142 states to 37142 states and 138284 transitions. [2019-01-13 03:40:42,885 INFO L78 Accepts]: Start accepts. Automaton has 37142 states and 138284 transitions. Word has length 44 [2019-01-13 03:40:42,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:40:42,889 INFO L480 AbstractCegarLoop]: Abstraction has 37142 states and 138284 transitions. [2019-01-13 03:40:42,889 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-13 03:40:42,889 INFO L276 IsEmpty]: Start isEmpty. Operand 37142 states and 138284 transitions. [2019-01-13 03:40:42,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-01-13 03:40:42,895 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:40:42,896 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] [2019-01-13 03:40:42,896 INFO L423 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:40:42,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:40:42,896 INFO L82 PathProgramCache]: Analyzing trace with hash -1206649085, now seen corresponding path program 1 times [2019-01-13 03:40:42,897 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:40:42,897 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:40:42,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:40:42,911 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 03:40:42,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:40:42,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:40:43,078 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 03:40:43,078 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:40:43,078 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-13 03:40:43,079 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-13 03:40:43,079 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-13 03:40:43,079 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-13 03:40:43,079 INFO L87 Difference]: Start difference. First operand 37142 states and 138284 transitions. Second operand 4 states. [2019-01-13 03:40:43,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:40:43,159 INFO L93 Difference]: Finished difference Result 12364 states and 41177 transitions. [2019-01-13 03:40:43,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-13 03:40:43,159 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 45 [2019-01-13 03:40:43,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:40:43,201 INFO L225 Difference]: With dead ends: 12364 [2019-01-13 03:40:43,201 INFO L226 Difference]: Without dead ends: 11843 [2019-01-13 03:40:43,202 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 [2019-01-13 03:40:43,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11843 states. [2019-01-13 03:40:43,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11843 to 11843. [2019-01-13 03:40:43,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11843 states. [2019-01-13 03:40:43,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11843 states to 11843 states and 39622 transitions. [2019-01-13 03:40:43,503 INFO L78 Accepts]: Start accepts. Automaton has 11843 states and 39622 transitions. Word has length 45 [2019-01-13 03:40:43,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:40:43,504 INFO L480 AbstractCegarLoop]: Abstraction has 11843 states and 39622 transitions. [2019-01-13 03:40:43,504 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-13 03:40:43,504 INFO L276 IsEmpty]: Start isEmpty. Operand 11843 states and 39622 transitions. [2019-01-13 03:40:43,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-01-13 03:40:43,510 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:40:43,511 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 03:40:43,511 INFO L423 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:40:43,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:40:43,511 INFO L82 PathProgramCache]: Analyzing trace with hash -372868821, now seen corresponding path program 1 times [2019-01-13 03:40:43,511 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:40:43,512 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:40:43,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:40:43,514 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 03:40:43,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:40:43,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:40:43,732 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 03:40:43,733 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:40:43,733 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-13 03:40:43,733 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-13 03:40:43,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-13 03:40:43,734 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-13 03:40:43,734 INFO L87 Difference]: Start difference. First operand 11843 states and 39622 transitions. Second operand 4 states. [2019-01-13 03:40:44,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:40:44,149 INFO L93 Difference]: Finished difference Result 17019 states and 55693 transitions. [2019-01-13 03:40:44,150 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-13 03:40:44,150 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 58 [2019-01-13 03:40:44,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:40:44,195 INFO L225 Difference]: With dead ends: 17019 [2019-01-13 03:40:44,195 INFO L226 Difference]: Without dead ends: 17019 [2019-01-13 03:40:44,196 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-13 03:40:44,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17019 states. [2019-01-13 03:40:44,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17019 to 12879. [2019-01-13 03:40:44,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12879 states. [2019-01-13 03:40:44,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12879 states to 12879 states and 42720 transitions. [2019-01-13 03:40:44,627 INFO L78 Accepts]: Start accepts. Automaton has 12879 states and 42720 transitions. Word has length 58 [2019-01-13 03:40:44,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:40:44,627 INFO L480 AbstractCegarLoop]: Abstraction has 12879 states and 42720 transitions. [2019-01-13 03:40:44,628 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-13 03:40:44,628 INFO L276 IsEmpty]: Start isEmpty. Operand 12879 states and 42720 transitions. [2019-01-13 03:40:44,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-01-13 03:40:44,639 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:40:44,639 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] [2019-01-13 03:40:44,640 INFO L423 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:40:44,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:40:44,640 INFO L82 PathProgramCache]: Analyzing trace with hash 1400961321, now seen corresponding path program 1 times [2019-01-13 03:40:44,640 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:40:44,640 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:40:44,644 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:40:44,644 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 03:40:44,644 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:40:44,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:40:44,850 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 03:40:44,850 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:40:44,850 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-13 03:40:44,851 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-13 03:40:44,851 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-13 03:40:44,851 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-01-13 03:40:44,852 INFO L87 Difference]: Start difference. First operand 12879 states and 42720 transitions. Second operand 6 states. [2019-01-13 03:40:46,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:40:46,135 INFO L93 Difference]: Finished difference Result 18599 states and 60830 transitions. [2019-01-13 03:40:46,137 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-13 03:40:46,137 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 58 [2019-01-13 03:40:46,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:40:46,175 INFO L225 Difference]: With dead ends: 18599 [2019-01-13 03:40:46,175 INFO L226 Difference]: Without dead ends: 18567 [2019-01-13 03:40:46,176 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2019-01-13 03:40:46,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18567 states. [2019-01-13 03:40:46,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18567 to 14411. [2019-01-13 03:40:46,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14411 states. [2019-01-13 03:40:46,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14411 states to 14411 states and 47549 transitions. [2019-01-13 03:40:46,499 INFO L78 Accepts]: Start accepts. Automaton has 14411 states and 47549 transitions. Word has length 58 [2019-01-13 03:40:46,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:40:46,499 INFO L480 AbstractCegarLoop]: Abstraction has 14411 states and 47549 transitions. [2019-01-13 03:40:46,499 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-13 03:40:46,499 INFO L276 IsEmpty]: Start isEmpty. Operand 14411 states and 47549 transitions. [2019-01-13 03:40:46,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-01-13 03:40:46,527 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:40:46,527 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] [2019-01-13 03:40:46,528 INFO L423 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:40:46,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:40:46,528 INFO L82 PathProgramCache]: Analyzing trace with hash 1996508936, now seen corresponding path program 1 times [2019-01-13 03:40:46,528 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:40:46,528 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:40:46,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:40:46,531 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 03:40:46,531 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:40:46,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:40:46,688 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 03:40:46,689 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:40:46,689 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-13 03:40:46,689 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-13 03:40:46,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-13 03:40:46,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-13 03:40:46,691 INFO L87 Difference]: Start difference. First operand 14411 states and 47549 transitions. Second operand 4 states. [2019-01-13 03:40:47,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:40:47,519 INFO L93 Difference]: Finished difference Result 20322 states and 66029 transitions. [2019-01-13 03:40:47,519 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-13 03:40:47,520 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 72 [2019-01-13 03:40:47,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:40:47,558 INFO L225 Difference]: With dead ends: 20322 [2019-01-13 03:40:47,558 INFO L226 Difference]: Without dead ends: 20322 [2019-01-13 03:40:47,559 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-13 03:40:47,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20322 states. [2019-01-13 03:40:47,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20322 to 18247. [2019-01-13 03:40:47,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18247 states. [2019-01-13 03:40:47,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18247 states to 18247 states and 59758 transitions. [2019-01-13 03:40:47,894 INFO L78 Accepts]: Start accepts. Automaton has 18247 states and 59758 transitions. Word has length 72 [2019-01-13 03:40:47,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:40:47,895 INFO L480 AbstractCegarLoop]: Abstraction has 18247 states and 59758 transitions. [2019-01-13 03:40:47,895 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-13 03:40:47,895 INFO L276 IsEmpty]: Start isEmpty. Operand 18247 states and 59758 transitions. [2019-01-13 03:40:47,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-01-13 03:40:47,921 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:40:47,921 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] [2019-01-13 03:40:47,922 INFO L423 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:40:47,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:40:47,922 INFO L82 PathProgramCache]: Analyzing trace with hash -1947658423, now seen corresponding path program 1 times [2019-01-13 03:40:47,922 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:40:47,922 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:40:47,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:40:47,924 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 03:40:47,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:40:47,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:40:48,089 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 03:40:48,089 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:40:48,089 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-13 03:40:48,089 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-13 03:40:48,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-13 03:40:48,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-01-13 03:40:48,090 INFO L87 Difference]: Start difference. First operand 18247 states and 59758 transitions. Second operand 5 states. [2019-01-13 03:40:48,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:40:48,147 INFO L93 Difference]: Finished difference Result 3155 states and 8363 transitions. [2019-01-13 03:40:48,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-13 03:40:48,148 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 72 [2019-01-13 03:40:48,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:40:48,152 INFO L225 Difference]: With dead ends: 3155 [2019-01-13 03:40:48,152 INFO L226 Difference]: Without dead ends: 2655 [2019-01-13 03:40:48,152 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-01-13 03:40:48,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2655 states. [2019-01-13 03:40:48,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2655 to 2548. [2019-01-13 03:40:48,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2548 states. [2019-01-13 03:40:48,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2548 states to 2548 states and 6738 transitions. [2019-01-13 03:40:48,182 INFO L78 Accepts]: Start accepts. Automaton has 2548 states and 6738 transitions. Word has length 72 [2019-01-13 03:40:48,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:40:48,182 INFO L480 AbstractCegarLoop]: Abstraction has 2548 states and 6738 transitions. [2019-01-13 03:40:48,182 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-13 03:40:48,182 INFO L276 IsEmpty]: Start isEmpty. Operand 2548 states and 6738 transitions. [2019-01-13 03:40:48,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-01-13 03:40:48,187 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:40:48,187 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] [2019-01-13 03:40:48,187 INFO L423 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:40:48,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:40:48,188 INFO L82 PathProgramCache]: Analyzing trace with hash -1359573718, now seen corresponding path program 1 times [2019-01-13 03:40:48,188 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:40:48,188 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:40:48,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:40:48,190 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 03:40:48,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:40:48,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:40:48,524 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 03:40:48,524 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:40:48,524 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-13 03:40:48,524 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-13 03:40:48,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-13 03:40:48,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-01-13 03:40:48,525 INFO L87 Difference]: Start difference. First operand 2548 states and 6738 transitions. Second operand 5 states. [2019-01-13 03:40:48,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:40:48,714 INFO L93 Difference]: Finished difference Result 2925 states and 7599 transitions. [2019-01-13 03:40:48,716 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-13 03:40:48,716 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 91 [2019-01-13 03:40:48,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:40:48,721 INFO L225 Difference]: With dead ends: 2925 [2019-01-13 03:40:48,721 INFO L226 Difference]: Without dead ends: 2925 [2019-01-13 03:40:48,722 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-01-13 03:40:48,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2925 states. [2019-01-13 03:40:48,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2925 to 2630. [2019-01-13 03:40:48,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2630 states. [2019-01-13 03:40:48,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2630 states to 2630 states and 6945 transitions. [2019-01-13 03:40:48,750 INFO L78 Accepts]: Start accepts. Automaton has 2630 states and 6945 transitions. Word has length 91 [2019-01-13 03:40:48,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:40:48,751 INFO L480 AbstractCegarLoop]: Abstraction has 2630 states and 6945 transitions. [2019-01-13 03:40:48,751 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-13 03:40:48,751 INFO L276 IsEmpty]: Start isEmpty. Operand 2630 states and 6945 transitions. [2019-01-13 03:40:48,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-01-13 03:40:48,756 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:40:48,756 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] [2019-01-13 03:40:48,756 INFO L423 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:40:48,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:40:48,757 INFO L82 PathProgramCache]: Analyzing trace with hash 1302589579, now seen corresponding path program 1 times [2019-01-13 03:40:48,757 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:40:48,757 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:40:48,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:40:48,759 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 03:40:48,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:40:48,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:40:49,035 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 03:40:49,035 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:40:49,035 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-13 03:40:49,037 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-13 03:40:49,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-13 03:40:49,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-13 03:40:49,037 INFO L87 Difference]: Start difference. First operand 2630 states and 6945 transitions. Second operand 4 states. [2019-01-13 03:40:49,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:40:49,718 INFO L93 Difference]: Finished difference Result 3181 states and 8228 transitions. [2019-01-13 03:40:49,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-13 03:40:49,719 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 91 [2019-01-13 03:40:49,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:40:49,723 INFO L225 Difference]: With dead ends: 3181 [2019-01-13 03:40:49,723 INFO L226 Difference]: Without dead ends: 3153 [2019-01-13 03:40:49,724 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-13 03:40:49,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3153 states. [2019-01-13 03:40:49,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3153 to 3096. [2019-01-13 03:40:49,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3096 states. [2019-01-13 03:40:49,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3096 states to 3096 states and 8053 transitions. [2019-01-13 03:40:49,981 INFO L78 Accepts]: Start accepts. Automaton has 3096 states and 8053 transitions. Word has length 91 [2019-01-13 03:40:49,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:40:49,981 INFO L480 AbstractCegarLoop]: Abstraction has 3096 states and 8053 transitions. [2019-01-13 03:40:49,982 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-13 03:40:49,982 INFO L276 IsEmpty]: Start isEmpty. Operand 3096 states and 8053 transitions. [2019-01-13 03:40:49,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-01-13 03:40:49,988 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:40:49,988 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] [2019-01-13 03:40:49,988 INFO L423 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:40:49,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:40:49,989 INFO L82 PathProgramCache]: Analyzing trace with hash -2022796694, now seen corresponding path program 1 times [2019-01-13 03:40:49,989 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:40:49,989 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:40:49,991 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:40:49,991 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 03:40:49,991 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:40:50,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:40:50,098 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 03:40:50,098 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:40:50,098 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-13 03:40:50,099 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-13 03:40:50,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-13 03:40:50,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-13 03:40:50,099 INFO L87 Difference]: Start difference. First operand 3096 states and 8053 transitions. Second operand 4 states. [2019-01-13 03:40:50,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:40:50,506 INFO L93 Difference]: Finished difference Result 4008 states and 10487 transitions. [2019-01-13 03:40:50,507 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-13 03:40:50,507 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 91 [2019-01-13 03:40:50,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:40:50,513 INFO L225 Difference]: With dead ends: 4008 [2019-01-13 03:40:50,513 INFO L226 Difference]: Without dead ends: 4008 [2019-01-13 03:40:50,513 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 [2019-01-13 03:40:50,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4008 states. [2019-01-13 03:40:50,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4008 to 2965. [2019-01-13 03:40:50,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2965 states. [2019-01-13 03:40:50,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2965 states to 2965 states and 7662 transitions. [2019-01-13 03:40:50,549 INFO L78 Accepts]: Start accepts. Automaton has 2965 states and 7662 transitions. Word has length 91 [2019-01-13 03:40:50,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:40:50,549 INFO L480 AbstractCegarLoop]: Abstraction has 2965 states and 7662 transitions. [2019-01-13 03:40:50,549 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-13 03:40:50,550 INFO L276 IsEmpty]: Start isEmpty. Operand 2965 states and 7662 transitions. [2019-01-13 03:40:50,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-01-13 03:40:50,554 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:40:50,554 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] [2019-01-13 03:40:50,554 INFO L423 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:40:50,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:40:50,555 INFO L82 PathProgramCache]: Analyzing trace with hash 1536327676, now seen corresponding path program 2 times [2019-01-13 03:40:50,555 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:40:50,555 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:40:50,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:40:50,557 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 03:40:50,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:40:50,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:40:50,832 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 03:40:50,832 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:40:50,833 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-13 03:40:50,833 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-13 03:40:50,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-13 03:40:50,833 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-13 03:40:50,834 INFO L87 Difference]: Start difference. First operand 2965 states and 7662 transitions. Second operand 5 states. [2019-01-13 03:40:51,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:40:51,201 INFO L93 Difference]: Finished difference Result 3357 states and 8582 transitions. [2019-01-13 03:40:51,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-13 03:40:51,202 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 91 [2019-01-13 03:40:51,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:40:51,207 INFO L225 Difference]: With dead ends: 3357 [2019-01-13 03:40:51,208 INFO L226 Difference]: Without dead ends: 3329 [2019-01-13 03:40:51,208 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-01-13 03:40:51,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3329 states. [2019-01-13 03:40:51,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3329 to 2891. [2019-01-13 03:40:51,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2891 states. [2019-01-13 03:40:51,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2891 states to 2891 states and 7472 transitions. [2019-01-13 03:40:51,244 INFO L78 Accepts]: Start accepts. Automaton has 2891 states and 7472 transitions. Word has length 91 [2019-01-13 03:40:51,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:40:51,244 INFO L480 AbstractCegarLoop]: Abstraction has 2891 states and 7472 transitions. [2019-01-13 03:40:51,244 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-13 03:40:51,244 INFO L276 IsEmpty]: Start isEmpty. Operand 2891 states and 7472 transitions. [2019-01-13 03:40:51,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-01-13 03:40:51,249 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:40:51,249 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] [2019-01-13 03:40:51,249 INFO L423 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:40:51,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:40:51,250 INFO L82 PathProgramCache]: Analyzing trace with hash 1748261029, now seen corresponding path program 1 times [2019-01-13 03:40:51,250 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:40:51,250 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:40:51,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:40:51,252 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-13 03:40:51,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:40:51,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:40:51,432 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 03:40:51,432 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:40:51,432 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-13 03:40:51,432 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-13 03:40:51,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-13 03:40:51,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2019-01-13 03:40:51,435 INFO L87 Difference]: Start difference. First operand 2891 states and 7472 transitions. Second operand 7 states. [2019-01-13 03:40:52,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:40:52,028 INFO L93 Difference]: Finished difference Result 3286 states and 8389 transitions. [2019-01-13 03:40:52,029 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-13 03:40:52,029 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 93 [2019-01-13 03:40:52,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:40:52,035 INFO L225 Difference]: With dead ends: 3286 [2019-01-13 03:40:52,035 INFO L226 Difference]: Without dead ends: 3286 [2019-01-13 03:40:52,035 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2019-01-13 03:40:52,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3286 states. [2019-01-13 03:40:52,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3286 to 3003. [2019-01-13 03:40:52,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3003 states. [2019-01-13 03:40:52,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3003 states to 3003 states and 7699 transitions. [2019-01-13 03:40:52,068 INFO L78 Accepts]: Start accepts. Automaton has 3003 states and 7699 transitions. Word has length 93 [2019-01-13 03:40:52,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:40:52,068 INFO L480 AbstractCegarLoop]: Abstraction has 3003 states and 7699 transitions. [2019-01-13 03:40:52,069 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-13 03:40:52,069 INFO L276 IsEmpty]: Start isEmpty. Operand 3003 states and 7699 transitions. [2019-01-13 03:40:52,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-01-13 03:40:52,073 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:40:52,074 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] [2019-01-13 03:40:52,074 INFO L423 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:40:52,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:40:52,074 INFO L82 PathProgramCache]: Analyzing trace with hash 564913732, now seen corresponding path program 1 times [2019-01-13 03:40:52,074 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:40:52,074 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:40:52,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:40:52,076 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 03:40:52,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:40:52,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:40:52,525 WARN L181 SmtUtils]: Spent 239.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 14 [2019-01-13 03:40:52,716 WARN L181 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 9 [2019-01-13 03:40:52,745 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 03:40:52,746 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:40:52,746 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-13 03:40:52,746 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-13 03:40:52,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-13 03:40:52,748 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-01-13 03:40:52,748 INFO L87 Difference]: Start difference. First operand 3003 states and 7699 transitions. Second operand 5 states. [2019-01-13 03:40:52,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:40:52,942 INFO L93 Difference]: Finished difference Result 2531 states and 6471 transitions. [2019-01-13 03:40:52,943 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-13 03:40:52,943 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 93 [2019-01-13 03:40:52,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:40:52,947 INFO L225 Difference]: With dead ends: 2531 [2019-01-13 03:40:52,947 INFO L226 Difference]: Without dead ends: 2531 [2019-01-13 03:40:52,948 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-01-13 03:40:52,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2531 states. [2019-01-13 03:40:52,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2531 to 2434. [2019-01-13 03:40:52,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2434 states. [2019-01-13 03:40:52,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2434 states to 2434 states and 6271 transitions. [2019-01-13 03:40:52,974 INFO L78 Accepts]: Start accepts. Automaton has 2434 states and 6271 transitions. Word has length 93 [2019-01-13 03:40:52,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:40:52,975 INFO L480 AbstractCegarLoop]: Abstraction has 2434 states and 6271 transitions. [2019-01-13 03:40:52,975 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-13 03:40:52,975 INFO L276 IsEmpty]: Start isEmpty. Operand 2434 states and 6271 transitions. [2019-01-13 03:40:52,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-01-13 03:40:52,979 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:40:52,979 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 03:40:52,979 INFO L423 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:40:52,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:40:52,980 INFO L82 PathProgramCache]: Analyzing trace with hash -1370746555, now seen corresponding path program 1 times [2019-01-13 03:40:52,980 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:40:52,980 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:40:52,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:40:52,982 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 03:40:52,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:40:52,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:40:53,208 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 03:40:53,208 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:40:53,208 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-13 03:40:53,209 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-13 03:40:53,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-13 03:40:53,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-01-13 03:40:53,209 INFO L87 Difference]: Start difference. First operand 2434 states and 6271 transitions. Second operand 6 states. [2019-01-13 03:40:53,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:40:53,482 INFO L93 Difference]: Finished difference Result 2466 states and 6223 transitions. [2019-01-13 03:40:53,483 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-13 03:40:53,483 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 93 [2019-01-13 03:40:53,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:40:53,487 INFO L225 Difference]: With dead ends: 2466 [2019-01-13 03:40:53,487 INFO L226 Difference]: Without dead ends: 2466 [2019-01-13 03:40:53,488 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 [2019-01-13 03:40:53,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2466 states. [2019-01-13 03:40:53,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2466 to 2133. [2019-01-13 03:40:53,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2133 states. [2019-01-13 03:40:53,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2133 states to 2133 states and 5437 transitions. [2019-01-13 03:40:53,511 INFO L78 Accepts]: Start accepts. Automaton has 2133 states and 5437 transitions. Word has length 93 [2019-01-13 03:40:53,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:40:53,511 INFO L480 AbstractCegarLoop]: Abstraction has 2133 states and 5437 transitions. [2019-01-13 03:40:53,511 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-13 03:40:53,511 INFO L276 IsEmpty]: Start isEmpty. Operand 2133 states and 5437 transitions. [2019-01-13 03:40:53,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-01-13 03:40:53,515 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:40:53,515 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 03:40:53,515 INFO L423 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:40:53,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:40:53,515 INFO L82 PathProgramCache]: Analyzing trace with hash 153060183, now seen corresponding path program 1 times [2019-01-13 03:40:53,515 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:40:53,516 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:40:53,517 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:40:53,517 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 03:40:53,517 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:40:53,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:40:53,801 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 03:40:53,802 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:40:53,802 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-01-13 03:40:53,802 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-13 03:40:53,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-13 03:40:53,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-01-13 03:40:53,803 INFO L87 Difference]: Start difference. First operand 2133 states and 5437 transitions. Second operand 8 states. [2019-01-13 03:40:54,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:40:54,792 INFO L93 Difference]: Finished difference Result 4089 states and 10169 transitions. [2019-01-13 03:40:54,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-01-13 03:40:54,793 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 95 [2019-01-13 03:40:54,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:40:54,800 INFO L225 Difference]: With dead ends: 4089 [2019-01-13 03:40:54,800 INFO L226 Difference]: Without dead ends: 4057 [2019-01-13 03:40:54,801 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=61, Invalid=179, Unknown=0, NotChecked=0, Total=240 [2019-01-13 03:40:54,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4057 states. [2019-01-13 03:40:54,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4057 to 3169. [2019-01-13 03:40:54,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3169 states. [2019-01-13 03:40:54,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3169 states to 3169 states and 8031 transitions. [2019-01-13 03:40:54,843 INFO L78 Accepts]: Start accepts. Automaton has 3169 states and 8031 transitions. Word has length 95 [2019-01-13 03:40:54,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:40:54,843 INFO L480 AbstractCegarLoop]: Abstraction has 3169 states and 8031 transitions. [2019-01-13 03:40:54,843 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-13 03:40:54,843 INFO L276 IsEmpty]: Start isEmpty. Operand 3169 states and 8031 transitions. [2019-01-13 03:40:54,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-01-13 03:40:54,848 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:40:54,849 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] [2019-01-13 03:40:54,849 INFO L423 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:40:54,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:40:54,849 INFO L82 PathProgramCache]: Analyzing trace with hash 1397824664, now seen corresponding path program 1 times [2019-01-13 03:40:54,849 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:40:54,850 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:40:54,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:40:54,851 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 03:40:54,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:40:54,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:40:55,049 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 03:40:55,050 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:40:55,050 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-01-13 03:40:55,050 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-13 03:40:55,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-13 03:40:55,050 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-01-13 03:40:55,051 INFO L87 Difference]: Start difference. First operand 3169 states and 8031 transitions. Second operand 8 states. [2019-01-13 03:40:55,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:40:55,883 INFO L93 Difference]: Finished difference Result 4358 states and 10747 transitions. [2019-01-13 03:40:55,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-01-13 03:40:55,885 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 95 [2019-01-13 03:40:55,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:40:55,890 INFO L225 Difference]: With dead ends: 4358 [2019-01-13 03:40:55,890 INFO L226 Difference]: Without dead ends: 4304 [2019-01-13 03:40:55,891 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=103, Invalid=359, Unknown=0, NotChecked=0, Total=462 [2019-01-13 03:40:55,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4304 states. [2019-01-13 03:40:55,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4304 to 3179. [2019-01-13 03:40:55,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3179 states. [2019-01-13 03:40:55,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3179 states to 3179 states and 7983 transitions. [2019-01-13 03:40:55,929 INFO L78 Accepts]: Start accepts. Automaton has 3179 states and 7983 transitions. Word has length 95 [2019-01-13 03:40:55,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:40:55,930 INFO L480 AbstractCegarLoop]: Abstraction has 3179 states and 7983 transitions. [2019-01-13 03:40:55,930 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-13 03:40:55,930 INFO L276 IsEmpty]: Start isEmpty. Operand 3179 states and 7983 transitions. [2019-01-13 03:40:55,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-01-13 03:40:55,935 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:40:55,935 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] [2019-01-13 03:40:55,935 INFO L423 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:40:55,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:40:55,936 INFO L82 PathProgramCache]: Analyzing trace with hash -537835623, now seen corresponding path program 1 times [2019-01-13 03:40:55,936 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:40:55,936 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:40:55,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:40:55,937 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 03:40:55,938 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:40:55,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:40:56,159 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 03:40:56,159 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:40:56,159 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-13 03:40:56,159 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-13 03:40:56,160 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-13 03:40:56,160 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-01-13 03:40:56,160 INFO L87 Difference]: Start difference. First operand 3179 states and 7983 transitions. Second operand 7 states. [2019-01-13 03:40:56,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:40:56,527 INFO L93 Difference]: Finished difference Result 4075 states and 10083 transitions. [2019-01-13 03:40:56,528 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-13 03:40:56,528 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 95 [2019-01-13 03:40:56,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:40:56,534 INFO L225 Difference]: With dead ends: 4075 [2019-01-13 03:40:56,534 INFO L226 Difference]: Without dead ends: 4075 [2019-01-13 03:40:56,535 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2019-01-13 03:40:56,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4075 states. [2019-01-13 03:40:56,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4075 to 3279. [2019-01-13 03:40:56,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3279 states. [2019-01-13 03:40:56,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3279 states to 3279 states and 8173 transitions. [2019-01-13 03:40:56,572 INFO L78 Accepts]: Start accepts. Automaton has 3279 states and 8173 transitions. Word has length 95 [2019-01-13 03:40:56,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:40:56,572 INFO L480 AbstractCegarLoop]: Abstraction has 3279 states and 8173 transitions. [2019-01-13 03:40:56,572 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-13 03:40:56,572 INFO L276 IsEmpty]: Start isEmpty. Operand 3279 states and 8173 transitions. [2019-01-13 03:40:56,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-01-13 03:40:56,578 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:40:56,578 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] [2019-01-13 03:40:56,578 INFO L423 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:40:56,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:40:56,578 INFO L82 PathProgramCache]: Analyzing trace with hash -1452834343, now seen corresponding path program 1 times [2019-01-13 03:40:56,578 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:40:56,579 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:40:56,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:40:56,580 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 03:40:56,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:40:56,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:40:56,762 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 03:40:56,762 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:40:56,762 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-13 03:40:56,763 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-13 03:40:56,763 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-13 03:40:56,763 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-13 03:40:56,764 INFO L87 Difference]: Start difference. First operand 3279 states and 8173 transitions. Second operand 5 states. [2019-01-13 03:40:56,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:40:56,995 INFO L93 Difference]: Finished difference Result 3631 states and 9037 transitions. [2019-01-13 03:40:56,996 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-13 03:40:56,996 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 95 [2019-01-13 03:40:56,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:40:57,001 INFO L225 Difference]: With dead ends: 3631 [2019-01-13 03:40:57,002 INFO L226 Difference]: Without dead ends: 3599 [2019-01-13 03:40:57,002 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-01-13 03:40:57,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3599 states. [2019-01-13 03:40:57,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3599 to 2675. [2019-01-13 03:40:57,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2675 states. [2019-01-13 03:40:57,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2675 states to 2675 states and 6699 transitions. [2019-01-13 03:40:57,042 INFO L78 Accepts]: Start accepts. Automaton has 2675 states and 6699 transitions. Word has length 95 [2019-01-13 03:40:57,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:40:57,043 INFO L480 AbstractCegarLoop]: Abstraction has 2675 states and 6699 transitions. [2019-01-13 03:40:57,043 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-13 03:40:57,043 INFO L276 IsEmpty]: Start isEmpty. Operand 2675 states and 6699 transitions. [2019-01-13 03:40:57,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-01-13 03:40:57,048 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:40:57,048 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] [2019-01-13 03:40:57,048 INFO L423 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:40:57,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:40:57,049 INFO L82 PathProgramCache]: Analyzing trace with hash -208069862, now seen corresponding path program 1 times [2019-01-13 03:40:57,050 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:40:57,051 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:40:57,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:40:57,053 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 03:40:57,054 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:40:57,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:40:57,276 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 03:40:57,276 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:40:57,277 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-13 03:40:57,277 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-13 03:40:57,277 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-13 03:40:57,278 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-01-13 03:40:57,278 INFO L87 Difference]: Start difference. First operand 2675 states and 6699 transitions. Second operand 5 states. [2019-01-13 03:40:57,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:40:57,326 INFO L93 Difference]: Finished difference Result 4074 states and 10567 transitions. [2019-01-13 03:40:57,327 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-13 03:40:57,327 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 95 [2019-01-13 03:40:57,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:40:57,334 INFO L225 Difference]: With dead ends: 4074 [2019-01-13 03:40:57,334 INFO L226 Difference]: Without dead ends: 4074 [2019-01-13 03:40:57,335 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 [2019-01-13 03:40:57,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4074 states. [2019-01-13 03:40:57,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4074 to 2545. [2019-01-13 03:40:57,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2545 states. [2019-01-13 03:40:57,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2545 states to 2545 states and 6421 transitions. [2019-01-13 03:40:57,370 INFO L78 Accepts]: Start accepts. Automaton has 2545 states and 6421 transitions. Word has length 95 [2019-01-13 03:40:57,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:40:57,370 INFO L480 AbstractCegarLoop]: Abstraction has 2545 states and 6421 transitions. [2019-01-13 03:40:57,370 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-13 03:40:57,370 INFO L276 IsEmpty]: Start isEmpty. Operand 2545 states and 6421 transitions. [2019-01-13 03:40:57,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-01-13 03:40:57,374 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:40:57,375 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] [2019-01-13 03:40:57,375 INFO L423 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:40:57,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:40:57,375 INFO L82 PathProgramCache]: Analyzing trace with hash 1433103834, now seen corresponding path program 1 times [2019-01-13 03:40:57,375 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:40:57,375 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:40:57,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:40:57,377 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 03:40:57,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:40:57,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:40:57,692 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 03:40:57,692 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:40:57,692 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-13 03:40:57,694 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-13 03:40:57,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-13 03:40:57,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-01-13 03:40:57,695 INFO L87 Difference]: Start difference. First operand 2545 states and 6421 transitions. Second operand 6 states. [2019-01-13 03:40:57,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:40:57,837 INFO L93 Difference]: Finished difference Result 2704 states and 6714 transitions. [2019-01-13 03:40:57,838 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-13 03:40:57,838 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 95 [2019-01-13 03:40:57,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:40:57,841 INFO L225 Difference]: With dead ends: 2704 [2019-01-13 03:40:57,842 INFO L226 Difference]: Without dead ends: 2704 [2019-01-13 03:40:57,842 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2019-01-13 03:40:57,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2704 states. [2019-01-13 03:40:57,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2704 to 2558. [2019-01-13 03:40:57,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2558 states. [2019-01-13 03:40:57,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2558 states to 2558 states and 6437 transitions. [2019-01-13 03:40:57,869 INFO L78 Accepts]: Start accepts. Automaton has 2558 states and 6437 transitions. Word has length 95 [2019-01-13 03:40:57,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:40:57,869 INFO L480 AbstractCegarLoop]: Abstraction has 2558 states and 6437 transitions. [2019-01-13 03:40:57,869 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-13 03:40:57,869 INFO L276 IsEmpty]: Start isEmpty. Operand 2558 states and 6437 transitions. [2019-01-13 03:40:57,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-01-13 03:40:57,874 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:40:57,875 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] [2019-01-13 03:40:57,875 INFO L423 AbstractCegarLoop]: === Iteration 21 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:40:57,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:40:57,875 INFO L82 PathProgramCache]: Analyzing trace with hash 1762869595, now seen corresponding path program 1 times [2019-01-13 03:40:57,875 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:40:57,875 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:40:57,879 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:40:57,879 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 03:40:57,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:40:57,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:40:58,066 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 03:40:58,067 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:40:58,067 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-13 03:40:58,067 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-13 03:40:58,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-13 03:40:58,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-01-13 03:40:58,068 INFO L87 Difference]: Start difference. First operand 2558 states and 6437 transitions. Second operand 7 states. [2019-01-13 03:40:58,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:40:58,392 INFO L93 Difference]: Finished difference Result 4339 states and 11095 transitions. [2019-01-13 03:40:58,393 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-13 03:40:58,393 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 95 [2019-01-13 03:40:58,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:40:58,397 INFO L225 Difference]: With dead ends: 4339 [2019-01-13 03:40:58,397 INFO L226 Difference]: Without dead ends: 1810 [2019-01-13 03:40:58,398 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2019-01-13 03:40:58,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1810 states. [2019-01-13 03:40:58,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1810 to 1810. [2019-01-13 03:40:58,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1810 states. [2019-01-13 03:40:58,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1810 states to 1810 states and 4700 transitions. [2019-01-13 03:40:58,422 INFO L78 Accepts]: Start accepts. Automaton has 1810 states and 4700 transitions. Word has length 95 [2019-01-13 03:40:58,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:40:58,422 INFO L480 AbstractCegarLoop]: Abstraction has 1810 states and 4700 transitions. [2019-01-13 03:40:58,423 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-13 03:40:58,423 INFO L276 IsEmpty]: Start isEmpty. Operand 1810 states and 4700 transitions. [2019-01-13 03:40:58,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-01-13 03:40:58,426 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:40:58,427 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] [2019-01-13 03:40:58,427 INFO L423 AbstractCegarLoop]: === Iteration 22 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:40:58,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:40:58,427 INFO L82 PathProgramCache]: Analyzing trace with hash -1809124577, now seen corresponding path program 2 times [2019-01-13 03:40:58,427 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:40:58,428 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:40:58,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:40:58,430 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 03:40:58,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:40:58,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-13 03:40:58,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-13 03:40:58,529 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-01-13 03:40:58,760 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2019-01-13 03:40:58,765 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.01 03:40:58 BasicIcfg [2019-01-13 03:40:58,766 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-13 03:40:58,766 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-13 03:40:58,767 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-13 03:40:58,767 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-13 03:40:58,770 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.01 03:40:31" (3/4) ... [2019-01-13 03:40:58,774 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2019-01-13 03:40:58,975 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-13 03:40:58,975 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-13 03:40:58,976 INFO L168 Benchmark]: Toolchain (without parser) took 29771.88 ms. Allocated memory was 1.0 GB in the beginning and 2.3 GB in the end (delta: 1.3 GB). Free memory was 952.7 MB in the beginning and 681.9 MB in the end (delta: 270.8 MB). Peak memory consumption was 1.6 GB. Max. memory is 11.5 GB. [2019-01-13 03:40:58,977 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-13 03:40:58,977 INFO L168 Benchmark]: CACSL2BoogieTranslator took 706.73 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 113.8 MB). Free memory was 947.3 MB in the beginning and 1.1 GB in the end (delta: -133.1 MB). Peak memory consumption was 27.1 MB. Max. memory is 11.5 GB. [2019-01-13 03:40:58,978 INFO L168 Benchmark]: Boogie Procedure Inliner took 102.05 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. [2019-01-13 03:40:58,981 INFO L168 Benchmark]: Boogie Preprocessor took 78.23 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-13 03:40:58,981 INFO L168 Benchmark]: RCFGBuilder took 1240.67 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 46.6 MB). Peak memory consumption was 46.6 MB. Max. memory is 11.5 GB. [2019-01-13 03:40:58,983 INFO L168 Benchmark]: TraceAbstraction took 27429.80 ms. Allocated memory was 1.1 GB in the beginning and 2.3 GB in the end (delta: 1.2 GB). Free memory was 1.0 GB in the beginning and 708.7 MB in the end (delta: 318.3 MB). Peak memory consumption was 1.5 GB. Max. memory is 11.5 GB. [2019-01-13 03:40:58,984 INFO L168 Benchmark]: Witness Printer took 208.44 ms. Allocated memory is still 2.3 GB. Free memory was 708.7 MB in the beginning and 681.9 MB in the end (delta: 26.8 MB). Peak memory consumption was 26.8 MB. Max. memory is 11.5 GB. [2019-01-13 03:40:58,991 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 706.73 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 113.8 MB). Free memory was 947.3 MB in the beginning and 1.1 GB in the end (delta: -133.1 MB). Peak memory consumption was 27.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 102.05 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 78.23 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 1240.67 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 46.6 MB). Peak memory consumption was 46.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 27429.80 ms. Allocated memory was 1.1 GB in the beginning and 2.3 GB in the end (delta: 1.2 GB). Free memory was 1.0 GB in the beginning and 708.7 MB in the end (delta: 318.3 MB). Peak memory consumption was 1.5 GB. Max. memory is 11.5 GB. * Witness Printer took 208.44 ms. Allocated memory is still 2.3 GB. Free memory was 708.7 MB in the beginning and 681.9 MB in the end (delta: 26.8 MB). Peak memory consumption was 26.8 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L671] -1 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L673] -1 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0] [L675] -1 int __unbuffered_p1_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0] [L676] -1 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0] [L677] -1 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L679] -1 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L680] -1 _Bool x$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0] [L681] -1 int x$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0] [L682] -1 _Bool x$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0] [L683] -1 _Bool x$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0] [L684] -1 _Bool x$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0] [L685] -1 _Bool x$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0] [L686] -1 _Bool x$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0] [L687] -1 _Bool x$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0] [L688] -1 _Bool x$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0] [L689] -1 int *x$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}] [L690] -1 int x$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0] [L691] -1 _Bool x$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0] [L692] -1 int x$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0] [L693] -1 _Bool x$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0] [L695] -1 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L696] -1 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L697] -1 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L763] -1 pthread_t t1597; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L764] FCALL, FORK -1 pthread_create(&t1597, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L765] -1 pthread_t t1598; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L766] FCALL, FORK -1 pthread_create(&t1598, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L721] 0 x$w_buff1 = x$w_buff0 [L722] 0 x$w_buff0 = 2 [L723] 0 x$w_buff1_used = x$w_buff0_used [L724] 0 x$w_buff0_used = (_Bool)1 [L4] COND FALSE 0 !(!expression) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L726] 0 x$r_buff1_thd0 = x$r_buff0_thd0 [L727] 0 x$r_buff1_thd1 = x$r_buff0_thd1 [L728] 0 x$r_buff1_thd2 = x$r_buff0_thd2 [L729] 0 x$r_buff0_thd2 = (_Bool)1 [L732] 0 y = 1 [L735] 0 __unbuffered_p1_EAX = y [L738] 0 __unbuffered_p1_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L701] 1 y = 2 [L704] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L707] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L707] EXPR 1 x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x=1, y=2] [L707] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x)=1, x$w_buff1=0, x$w_buff1_used=0, x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x=1, y=2] [L707] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L708] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L708] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L709] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L709] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L710] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L710] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L711] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L711] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L714] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L741] EXPR 0 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L741] 0 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L742] EXPR 0 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L742] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L743] EXPR 0 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L743] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L744] EXPR 0 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L744] 0 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L745] EXPR 0 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L745] 0 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L748] 0 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L768] -1 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L772] EXPR -1 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L772] EXPR -1 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L772] EXPR -1 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L772] -1 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L773] EXPR -1 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L773] -1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L774] EXPR -1 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L774] -1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L775] EXPR -1 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L775] -1 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L776] EXPR -1 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L776] -1 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L779] -1 weak$$choice0 = __VERIFIER_nondet_pointer() [L780] -1 weak$$choice2 = __VERIFIER_nondet_pointer() [L781] -1 x$flush_delayed = weak$$choice2 [L782] -1 x$mem_tmp = x VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L783] EXPR -1 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L783] -1 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L784] EXPR -1 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L784] -1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L785] EXPR -1 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L785] -1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L786] EXPR -1 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L786] -1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L787] EXPR -1 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L787] -1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L788] EXPR -1 weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L788] -1 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L789] EXPR -1 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L789] -1 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L790] -1 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 1) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L791] EXPR -1 x$flush_delayed ? x$mem_tmp : x VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L791] -1 x = x$flush_delayed ? x$mem_tmp : x [L792] -1 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L4] COND TRUE -1 !expression VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L4] -1 __VERIFIER_error() VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 180 locations, 3 error locations. UNSAFE Result, 27.2s OverallTime, 22 OverallIterations, 1 TraceHistogramMax, 13.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 4864 SDtfs, 4349 SDslu, 9785 SDs, 0 SdLazy, 4221 SolverSat, 257 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 8.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 201 GetRequests, 56 SyntacticMatches, 15 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 163 ImplicationChecksByTransitivity, 4.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=37142occurred 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: 5.9s AutomataMinimizationTime, 21 MinimizatonAttempts, 62926 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 4.6s InterpolantComputationTime, 1789 NumberOfCodeBlocks, 1789 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 1673 ConstructedInterpolants, 0 QuantifiedInterpolants, 338935 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...