./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/pthread-wmm/rfi010_power.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/rfi010_power.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 df6b0475df83f06f064c78d3a4d54c725d19829e ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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:58:47,423 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-13 03:58:47,425 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-13 03:58:47,437 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-13 03:58:47,438 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-13 03:58:47,439 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-13 03:58:47,441 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-13 03:58:47,443 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-13 03:58:47,445 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-13 03:58:47,446 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-13 03:58:47,447 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-13 03:58:47,447 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-13 03:58:47,448 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-13 03:58:47,450 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-13 03:58:47,451 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-13 03:58:47,452 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-13 03:58:47,453 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-13 03:58:47,455 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-13 03:58:47,457 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-13 03:58:47,459 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-13 03:58:47,461 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-13 03:58:47,462 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-13 03:58:47,465 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-13 03:58:47,466 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-13 03:58:47,466 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-13 03:58:47,467 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-13 03:58:47,469 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-13 03:58:47,470 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-13 03:58:47,470 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-13 03:58:47,472 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-13 03:58:47,472 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-13 03:58:47,473 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-13 03:58:47,473 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-13 03:58:47,473 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-13 03:58:47,475 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-13 03:58:47,476 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-13 03:58:47,476 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:58:47,492 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-13 03:58:47,492 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-13 03:58:47,493 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-13 03:58:47,494 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-13 03:58:47,494 INFO L133 SettingsManager]: * Use SBE=true [2019-01-13 03:58:47,495 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-13 03:58:47,495 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-13 03:58:47,495 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-13 03:58:47,495 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-13 03:58:47,495 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-13 03:58:47,495 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-13 03:58:47,496 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-13 03:58:47,496 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-13 03:58:47,496 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-13 03:58:47,496 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-13 03:58:47,496 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-13 03:58:47,496 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-13 03:58:47,497 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-13 03:58:47,498 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-13 03:58:47,498 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-13 03:58:47,499 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-13 03:58:47,499 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-13 03:58:47,499 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-13 03:58:47,499 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-13 03:58:47,499 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-13 03:58:47,500 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-13 03:58:47,501 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-13 03:58:47,501 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-13 03:58:47,501 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 -> df6b0475df83f06f064c78d3a4d54c725d19829e [2019-01-13 03:58:47,540 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-13 03:58:47,556 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-13 03:58:47,560 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-13 03:58:47,561 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-13 03:58:47,562 INFO L276 PluginConnector]: CDTParser initialized [2019-01-13 03:58:47,563 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/pthread-wmm/rfi010_power.opt_false-unreach-call.i [2019-01-13 03:58:47,622 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ef9d662fd/db9691f45a604af9be81568ccd2bc6a0/FLAGd8caff75f [2019-01-13 03:58:48,207 INFO L307 CDTParser]: Found 1 translation units. [2019-01-13 03:58:48,209 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/pthread-wmm/rfi010_power.opt_false-unreach-call.i [2019-01-13 03:58:48,231 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ef9d662fd/db9691f45a604af9be81568ccd2bc6a0/FLAGd8caff75f [2019-01-13 03:58:48,419 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ef9d662fd/db9691f45a604af9be81568ccd2bc6a0 [2019-01-13 03:58:48,426 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-13 03:58:48,429 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-13 03:58:48,431 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-13 03:58:48,431 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-13 03:58:48,436 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-13 03:58:48,437 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.01 03:58:48" (1/1) ... [2019-01-13 03:58:48,440 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@37fb7911 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 03:58:48, skipping insertion in model container [2019-01-13 03:58:48,441 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.01 03:58:48" (1/1) ... [2019-01-13 03:58:48,451 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-13 03:58:48,523 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-13 03:58:48,976 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-13 03:58:48,991 INFO L191 MainTranslator]: Completed pre-run [2019-01-13 03:58:49,156 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-13 03:58:49,234 INFO L195 MainTranslator]: Completed translation [2019-01-13 03:58:49,235 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 03:58:49 WrapperNode [2019-01-13 03:58:49,235 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-13 03:58:49,236 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-13 03:58:49,236 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-13 03:58:49,236 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-13 03:58:49,246 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:58:49" (1/1) ... [2019-01-13 03:58:49,276 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:58:49" (1/1) ... [2019-01-13 03:58:49,315 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-13 03:58:49,316 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-13 03:58:49,316 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-13 03:58:49,316 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-13 03:58:49,325 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 03:58:49" (1/1) ... [2019-01-13 03:58:49,325 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 03:58:49" (1/1) ... [2019-01-13 03:58:49,331 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 03:58:49" (1/1) ... [2019-01-13 03:58:49,332 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 03:58:49" (1/1) ... [2019-01-13 03:58:49,347 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 03:58:49" (1/1) ... [2019-01-13 03:58:49,352 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 03:58:49" (1/1) ... [2019-01-13 03:58:49,356 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 03:58:49" (1/1) ... [2019-01-13 03:58:49,364 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-13 03:58:49,368 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-13 03:58:49,370 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-13 03:58:49,371 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-13 03:58:49,375 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 03:58:49" (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:58:49,440 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-13 03:58:49,441 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-01-13 03:58:49,441 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-13 03:58:49,441 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-13 03:58:49,441 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-01-13 03:58:49,441 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-01-13 03:58:49,442 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-01-13 03:58:49,443 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-01-13 03:58:49,443 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-01-13 03:58:49,443 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-13 03:58:49,443 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-13 03:58:49,446 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:58:50,901 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-13 03:58:50,902 INFO L286 CfgBuilder]: Removed 8 assue(true) statements. [2019-01-13 03:58:50,904 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.01 03:58:50 BoogieIcfgContainer [2019-01-13 03:58:50,904 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-13 03:58:50,905 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-13 03:58:50,905 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-13 03:58:50,909 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-13 03:58:50,909 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.01 03:58:48" (1/3) ... [2019-01-13 03:58:50,910 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@741b30bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.01 03:58:50, skipping insertion in model container [2019-01-13 03:58:50,910 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 03:58:49" (2/3) ... [2019-01-13 03:58:50,912 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@741b30bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.01 03:58:50, skipping insertion in model container [2019-01-13 03:58:50,912 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.01 03:58:50" (3/3) ... [2019-01-13 03:58:50,914 INFO L112 eAbstractionObserver]: Analyzing ICFG rfi010_power.opt_false-unreach-call.i [2019-01-13 03:58:50,968 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:58:50,968 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:58:50,968 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:58:50,969 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:58:50,969 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:58:50,969 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:58:50,972 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:58:50,972 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:58:50,973 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:58:50,974 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:58:50,974 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:58:50,974 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:58:50,974 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:58:50,975 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:58:50,975 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:58:50,975 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:58:50,977 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:58:50,977 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:58:50,978 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:58:50,978 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:58:50,978 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:58:50,978 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:58:50,979 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:58:50,980 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:58:50,980 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:58:50,981 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:58:50,982 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:58:50,983 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:58:50,983 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:58:50,983 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:58:50,983 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:58:50,983 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:58:50,985 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:58:50,985 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:58:50,985 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:58:50,986 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:58:50,986 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:58:50,986 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:58:50,986 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:58:50,987 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:58:50,987 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:58:50,987 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:58:50,987 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:58:50,987 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:58:50,988 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:58:50,988 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:58:50,988 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:58:50,989 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:58:50,989 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:58:50,989 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:58:50,989 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:58:50,990 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:58:50,990 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:58:50,990 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:58:50,990 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:58:50,990 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:58:50,993 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:58:50,993 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:58:50,993 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:58:50,993 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:58:50,994 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:58:50,994 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:58:50,994 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:58:50,994 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:58:50,994 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:58:50,994 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:58:50,995 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:58:50,995 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:58:50,995 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:58:50,995 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:58:50,996 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:58:50,996 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:58:50,996 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:58:50,996 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:58:50,996 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:58:50,997 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:58:50,997 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:58:50,997 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:58:50,997 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:58:50,997 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:58:50,998 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:58:50,998 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:58:50,998 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:58:50,998 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:58:50,999 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:58:50,999 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:58:50,999 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:58:50,999 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:58:50,999 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:58:51,000 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:58:51,004 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:58:51,004 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:58:51,005 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet26.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:58:51,005 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet26.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:58:51,005 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:58:51,005 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:58:51,005 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet26.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:58:51,006 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet26.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:58:51,007 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:58:51,007 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:58:51,007 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:58:51,007 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:58:51,008 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:58:51,009 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:58:51,010 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:58:51,010 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:58:51,012 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:58:51,012 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:58:51,012 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:58:51,012 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:58:51,013 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:58:51,015 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:58:51,015 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:58:51,016 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:58:51,016 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:58:51,016 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:58:51,016 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:58:51,016 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:58:51,017 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:58:51,017 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:58:51,017 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:58:51,017 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:58:51,017 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:58:51,018 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:58:51,019 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:58:51,019 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:58:51,019 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:58:51,020 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:58:51,020 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:58:51,020 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:58:51,020 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:58:51,020 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:58:51,021 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:58:51,021 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:58:51,021 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:58:51,021 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:58:51,021 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:58:51,022 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:58:51,022 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:58:51,022 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:58:51,022 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:58:51,022 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:58:51,023 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:58:51,023 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:58:51,023 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:58:51,023 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:58:51,023 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:58:51,024 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:58:51,025 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:58:51,025 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:58:51,025 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:58:51,025 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:58:51,026 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:58:51,026 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:58:51,026 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:58:51,026 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:58:51,026 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:58:51,026 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:58:51,027 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:58:51,027 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:58:51,027 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:58:51,027 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:58:51,027 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:58:51,028 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:58:51,028 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:58:51,028 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:58:51,028 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:58:51,028 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:58:51,029 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:58:51,029 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:58:51,029 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:58:51,029 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:58:51,029 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:58:51,030 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:58:51,030 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:58:51,030 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:58:51,031 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:58:51,031 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:58:51,031 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:58:51,031 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:58:51,031 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:58:51,031 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:58:51,032 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:58:51,032 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:58:51,032 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:58:51,032 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:58:51,033 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:58:51,033 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:58:51,034 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:58:51,034 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:58:51,034 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:58:51,034 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:58:51,034 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:58:51,035 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:58:51,036 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:58:51,036 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:58:51,036 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:58:51,036 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:58:51,036 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:58:51,037 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:58:51,037 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:58:51,037 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:58:51,037 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:58:51,037 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:58:51,038 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:58:51,038 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:58:51,038 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:58:51,038 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:58:51,038 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:58:51,039 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:58:51,039 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:58:51,039 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:58:51,039 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:58:51,039 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:58:51,039 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:58:51,040 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:58:51,040 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:58:51,040 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:58:51,040 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet56.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:58:51,040 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet56.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:58:51,041 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:58:51,041 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:58:51,041 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet56.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:58:51,041 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet56.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:58:51,072 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-01-13 03:58:51,072 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-13 03:58:51,085 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2019-01-13 03:58:51,100 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2019-01-13 03:58:51,126 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-13 03:58:51,126 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-13 03:58:51,126 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-13 03:58:51,126 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-13 03:58:51,127 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-13 03:58:51,127 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-13 03:58:51,127 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-13 03:58:51,127 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-13 03:58:51,127 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-13 03:58:51,143 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 173places, 226 transitions [2019-01-13 03:59:00,496 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 83127 states. [2019-01-13 03:59:00,498 INFO L276 IsEmpty]: Start isEmpty. Operand 83127 states. [2019-01-13 03:59:00,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-01-13 03:59:00,509 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:59:00,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] [2019-01-13 03:59:00,514 INFO L423 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:59:00,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:59:00,521 INFO L82 PathProgramCache]: Analyzing trace with hash -1645016021, now seen corresponding path program 1 times [2019-01-13 03:59:00,524 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:59:00,525 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:59:00,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:59:00,593 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 03:59:00,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:59:00,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:59:00,812 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:59:00,815 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:59:00,815 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-13 03:59:00,820 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-13 03:59:00,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-13 03:59:00,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-13 03:59:00,834 INFO L87 Difference]: Start difference. First operand 83127 states. Second operand 4 states. [2019-01-13 03:59:02,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:59:02,971 INFO L93 Difference]: Finished difference Result 150583 states and 603160 transitions. [2019-01-13 03:59:02,971 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-13 03:59:02,973 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 38 [2019-01-13 03:59:02,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:59:03,905 INFO L225 Difference]: With dead ends: 150583 [2019-01-13 03:59:03,906 INFO L226 Difference]: Without dead ends: 105839 [2019-01-13 03:59:03,909 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-13 03:59:05,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105839 states. [2019-01-13 03:59:07,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105839 to 61235. [2019-01-13 03:59:07,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61235 states. [2019-01-13 03:59:09,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61235 states to 61235 states and 248290 transitions. [2019-01-13 03:59:09,255 INFO L78 Accepts]: Start accepts. Automaton has 61235 states and 248290 transitions. Word has length 38 [2019-01-13 03:59:09,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:59:09,256 INFO L480 AbstractCegarLoop]: Abstraction has 61235 states and 248290 transitions. [2019-01-13 03:59:09,256 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-13 03:59:09,256 INFO L276 IsEmpty]: Start isEmpty. Operand 61235 states and 248290 transitions. [2019-01-13 03:59:09,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-01-13 03:59:09,279 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:59:09,279 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] [2019-01-13 03:59:09,280 INFO L423 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:59:09,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:59:09,280 INFO L82 PathProgramCache]: Analyzing trace with hash 1043746306, now seen corresponding path program 1 times [2019-01-13 03:59:09,280 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:59:09,280 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:59:09,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:59:09,296 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 03:59:09,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:59:09,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:59:09,628 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:59:09,628 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:59:09,628 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-13 03:59:09,631 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-13 03:59:09,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-13 03:59:09,635 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-13 03:59:09,635 INFO L87 Difference]: Start difference. First operand 61235 states and 248290 transitions. Second operand 5 states. [2019-01-13 03:59:12,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:59:12,574 INFO L93 Difference]: Finished difference Result 146039 states and 554300 transitions. [2019-01-13 03:59:12,575 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-13 03:59:12,575 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 46 [2019-01-13 03:59:12,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:59:13,273 INFO L225 Difference]: With dead ends: 146039 [2019-01-13 03:59:13,273 INFO L226 Difference]: Without dead ends: 145471 [2019-01-13 03:59:13,274 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-01-13 03:59:20,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145471 states. [2019-01-13 03:59:21,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145471 to 96613. [2019-01-13 03:59:21,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96613 states. [2019-01-13 03:59:22,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96613 states to 96613 states and 368455 transitions. [2019-01-13 03:59:22,297 INFO L78 Accepts]: Start accepts. Automaton has 96613 states and 368455 transitions. Word has length 46 [2019-01-13 03:59:22,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:59:22,298 INFO L480 AbstractCegarLoop]: Abstraction has 96613 states and 368455 transitions. [2019-01-13 03:59:22,299 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-13 03:59:22,299 INFO L276 IsEmpty]: Start isEmpty. Operand 96613 states and 368455 transitions. [2019-01-13 03:59:22,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-01-13 03:59:22,306 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:59:22,306 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] [2019-01-13 03:59:22,306 INFO L423 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:59:22,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:59:22,306 INFO L82 PathProgramCache]: Analyzing trace with hash -1415245602, now seen corresponding path program 1 times [2019-01-13 03:59:22,307 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:59:22,307 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:59:22,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:59:22,311 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 03:59:22,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:59:22,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:59:22,419 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:59:22,419 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:59:22,419 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-13 03:59:22,420 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-13 03:59:22,420 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-13 03:59:22,420 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-13 03:59:22,421 INFO L87 Difference]: Start difference. First operand 96613 states and 368455 transitions. Second operand 5 states. [2019-01-13 03:59:25,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:59:25,127 INFO L93 Difference]: Finished difference Result 199269 states and 748089 transitions. [2019-01-13 03:59:25,127 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-13 03:59:25,127 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 47 [2019-01-13 03:59:25,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:59:25,722 INFO L225 Difference]: With dead ends: 199269 [2019-01-13 03:59:25,722 INFO L226 Difference]: Without dead ends: 198805 [2019-01-13 03:59:25,723 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-01-13 03:59:27,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198805 states. [2019-01-13 03:59:30,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198805 to 108296. [2019-01-13 03:59:30,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108296 states. [2019-01-13 03:59:31,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108296 states to 108296 states and 408659 transitions. [2019-01-13 03:59:31,181 INFO L78 Accepts]: Start accepts. Automaton has 108296 states and 408659 transitions. Word has length 47 [2019-01-13 03:59:31,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:59:31,182 INFO L480 AbstractCegarLoop]: Abstraction has 108296 states and 408659 transitions. [2019-01-13 03:59:31,182 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-13 03:59:31,182 INFO L276 IsEmpty]: Start isEmpty. Operand 108296 states and 408659 transitions. [2019-01-13 03:59:31,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-01-13 03:59:31,193 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:59:31,193 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] [2019-01-13 03:59:31,193 INFO L423 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:59:31,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:59:31,194 INFO L82 PathProgramCache]: Analyzing trace with hash -1958778492, now seen corresponding path program 1 times [2019-01-13 03:59:31,194 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:59:31,194 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:59:31,199 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:59:31,199 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 03:59:31,199 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:59:31,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:59:31,298 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:59:31,298 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:59:31,298 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-13 03:59:31,298 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-13 03:59:31,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-13 03:59:31,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-13 03:59:31,299 INFO L87 Difference]: Start difference. First operand 108296 states and 408659 transitions. Second operand 3 states. [2019-01-13 03:59:32,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:59:32,248 INFO L93 Difference]: Finished difference Result 179115 states and 655174 transitions. [2019-01-13 03:59:32,249 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-13 03:59:32,249 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 49 [2019-01-13 03:59:32,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:59:32,756 INFO L225 Difference]: With dead ends: 179115 [2019-01-13 03:59:32,756 INFO L226 Difference]: Without dead ends: 179115 [2019-01-13 03:59:32,757 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-13 03:59:40,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179115 states. [2019-01-13 03:59:42,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179115 to 163646. [2019-01-13 03:59:42,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163646 states. [2019-01-13 03:59:42,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163646 states to 163646 states and 603625 transitions. [2019-01-13 03:59:42,991 INFO L78 Accepts]: Start accepts. Automaton has 163646 states and 603625 transitions. Word has length 49 [2019-01-13 03:59:42,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:59:42,992 INFO L480 AbstractCegarLoop]: Abstraction has 163646 states and 603625 transitions. [2019-01-13 03:59:42,992 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-13 03:59:42,992 INFO L276 IsEmpty]: Start isEmpty. Operand 163646 states and 603625 transitions. [2019-01-13 03:59:43,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-01-13 03:59:43,020 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:59:43,020 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] [2019-01-13 03:59:43,020 INFO L423 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:59:43,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:59:43,021 INFO L82 PathProgramCache]: Analyzing trace with hash 984479439, now seen corresponding path program 1 times [2019-01-13 03:59:43,021 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:59:43,021 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:59:43,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:59:43,026 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 03:59:43,026 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:59:43,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:59:43,445 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:59:43,445 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:59:43,446 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-13 03:59:43,446 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-13 03:59:43,446 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-13 03:59:43,446 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-01-13 03:59:43,447 INFO L87 Difference]: Start difference. First operand 163646 states and 603625 transitions. Second operand 6 states. [2019-01-13 03:59:47,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:59:47,686 INFO L93 Difference]: Finished difference Result 315523 states and 1139598 transitions. [2019-01-13 03:59:47,686 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-01-13 03:59:47,686 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 53 [2019-01-13 03:59:47,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:59:48,579 INFO L225 Difference]: With dead ends: 315523 [2019-01-13 03:59:48,579 INFO L226 Difference]: Without dead ends: 314987 [2019-01-13 03:59:48,580 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2019-01-13 03:59:51,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314987 states. [2019-01-13 03:59:56,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314987 to 164409. [2019-01-13 03:59:56,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164409 states. [2019-01-13 03:59:56,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164409 states to 164409 states and 606496 transitions. [2019-01-13 03:59:56,701 INFO L78 Accepts]: Start accepts. Automaton has 164409 states and 606496 transitions. Word has length 53 [2019-01-13 03:59:56,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:59:56,701 INFO L480 AbstractCegarLoop]: Abstraction has 164409 states and 606496 transitions. [2019-01-13 03:59:56,701 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-13 03:59:56,701 INFO L276 IsEmpty]: Start isEmpty. Operand 164409 states and 606496 transitions. [2019-01-13 03:59:56,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-01-13 03:59:56,723 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:59:56,724 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] [2019-01-13 03:59:56,725 INFO L423 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:59:56,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:59:56,725 INFO L82 PathProgramCache]: Analyzing trace with hash -721809298, now seen corresponding path program 1 times [2019-01-13 03:59:56,725 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:59:56,725 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:59:56,727 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:59:56,728 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 03:59:56,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:59:56,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:59:56,896 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:59:56,896 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:59:56,896 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-13 03:59:56,897 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-13 03:59:56,897 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-13 03:59:56,897 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-01-13 03:59:56,897 INFO L87 Difference]: Start difference. First operand 164409 states and 606496 transitions. Second operand 6 states. [2019-01-13 04:00:05,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 04:00:05,829 INFO L93 Difference]: Finished difference Result 215866 states and 792770 transitions. [2019-01-13 04:00:05,830 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-13 04:00:05,830 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 53 [2019-01-13 04:00:05,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 04:00:06,502 INFO L225 Difference]: With dead ends: 215866 [2019-01-13 04:00:06,503 INFO L226 Difference]: Without dead ends: 215866 [2019-01-13 04:00:06,503 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-01-13 04:00:08,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215866 states. [2019-01-13 04:00:11,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215866 to 201215. [2019-01-13 04:00:11,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201215 states. [2019-01-13 04:00:12,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201215 states to 201215 states and 739037 transitions. [2019-01-13 04:00:12,742 INFO L78 Accepts]: Start accepts. Automaton has 201215 states and 739037 transitions. Word has length 53 [2019-01-13 04:00:12,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 04:00:12,742 INFO L480 AbstractCegarLoop]: Abstraction has 201215 states and 739037 transitions. [2019-01-13 04:00:12,742 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-13 04:00:12,742 INFO L276 IsEmpty]: Start isEmpty. Operand 201215 states and 739037 transitions. [2019-01-13 04:00:12,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-01-13 04:00:12,771 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 04:00:12,771 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] [2019-01-13 04:00:12,772 INFO L423 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 04:00:12,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 04:00:12,772 INFO L82 PathProgramCache]: Analyzing trace with hash 1776206639, now seen corresponding path program 1 times [2019-01-13 04:00:12,772 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 04:00:12,772 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 04:00:12,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 04:00:12,774 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 04:00:12,775 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 04:00:12,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 04:00:13,037 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 04:00:13,038 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 04:00:13,038 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-13 04:00:13,038 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-13 04:00:13,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-13 04:00:13,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-01-13 04:00:13,040 INFO L87 Difference]: Start difference. First operand 201215 states and 739037 transitions. Second operand 7 states. [2019-01-13 04:00:16,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 04:00:16,183 INFO L93 Difference]: Finished difference Result 286186 states and 1016985 transitions. [2019-01-13 04:00:16,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-13 04:00:16,184 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 53 [2019-01-13 04:00:16,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 04:00:19,204 INFO L225 Difference]: With dead ends: 286186 [2019-01-13 04:00:19,204 INFO L226 Difference]: Without dead ends: 286186 [2019-01-13 04:00:19,205 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-01-13 04:00:21,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286186 states. [2019-01-13 04:00:32,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286186 to 229832. [2019-01-13 04:00:32,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 229832 states. [2019-01-13 04:00:34,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229832 states to 229832 states and 831774 transitions. [2019-01-13 04:00:34,933 INFO L78 Accepts]: Start accepts. Automaton has 229832 states and 831774 transitions. Word has length 53 [2019-01-13 04:00:34,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 04:00:34,933 INFO L480 AbstractCegarLoop]: Abstraction has 229832 states and 831774 transitions. [2019-01-13 04:00:34,933 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-13 04:00:34,934 INFO L276 IsEmpty]: Start isEmpty. Operand 229832 states and 831774 transitions. [2019-01-13 04:00:34,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-01-13 04:00:34,965 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 04:00:34,965 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] [2019-01-13 04:00:34,965 INFO L423 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 04:00:34,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 04:00:34,966 INFO L82 PathProgramCache]: Analyzing trace with hash -1631256976, now seen corresponding path program 1 times [2019-01-13 04:00:34,966 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 04:00:34,966 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 04:00:34,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 04:00:34,968 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 04:00:34,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 04:00:34,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 04:00:35,075 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 04:00:35,076 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 04:00:35,076 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-13 04:00:35,076 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-13 04:00:35,076 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-13 04:00:35,077 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-13 04:00:35,079 INFO L87 Difference]: Start difference. First operand 229832 states and 831774 transitions. Second operand 3 states. [2019-01-13 04:00:36,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 04:00:36,109 INFO L93 Difference]: Finished difference Result 183765 states and 654695 transitions. [2019-01-13 04:00:36,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-13 04:00:36,109 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2019-01-13 04:00:36,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 04:00:36,677 INFO L225 Difference]: With dead ends: 183765 [2019-01-13 04:00:36,677 INFO L226 Difference]: Without dead ends: 183765 [2019-01-13 04:00:36,677 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-13 04:00:38,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183765 states. [2019-01-13 04:00:42,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183765 to 178407. [2019-01-13 04:00:42,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178407 states. [2019-01-13 04:00:45,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178407 states to 178407 states and 637996 transitions. [2019-01-13 04:00:45,150 INFO L78 Accepts]: Start accepts. Automaton has 178407 states and 637996 transitions. Word has length 53 [2019-01-13 04:00:45,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 04:00:45,151 INFO L480 AbstractCegarLoop]: Abstraction has 178407 states and 637996 transitions. [2019-01-13 04:00:45,151 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-13 04:00:45,151 INFO L276 IsEmpty]: Start isEmpty. Operand 178407 states and 637996 transitions. [2019-01-13 04:00:45,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-01-13 04:00:45,173 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 04:00:45,174 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 04:00:45,174 INFO L423 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 04:00:45,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 04:00:45,174 INFO L82 PathProgramCache]: Analyzing trace with hash -1514606821, now seen corresponding path program 1 times [2019-01-13 04:00:45,174 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 04:00:45,174 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 04:00:45,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 04:00:45,176 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 04:00:45,177 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 04:00:45,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 04:00:45,363 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 04:00:45,363 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 04:00:45,363 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-13 04:00:45,363 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-13 04:00:45,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-13 04:00:45,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-01-13 04:00:45,364 INFO L87 Difference]: Start difference. First operand 178407 states and 637996 transitions. Second operand 6 states. [2019-01-13 04:00:47,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 04:00:47,315 INFO L93 Difference]: Finished difference Result 224186 states and 783823 transitions. [2019-01-13 04:00:47,316 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-13 04:00:47,316 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 54 [2019-01-13 04:00:47,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 04:00:47,944 INFO L225 Difference]: With dead ends: 224186 [2019-01-13 04:00:47,944 INFO L226 Difference]: Without dead ends: 224186 [2019-01-13 04:00:47,944 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-01-13 04:00:50,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224186 states. [2019-01-13 04:00:59,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224186 to 192266. [2019-01-13 04:00:59,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192266 states. [2019-01-13 04:01:01,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192266 states to 192266 states and 683049 transitions. [2019-01-13 04:01:01,478 INFO L78 Accepts]: Start accepts. Automaton has 192266 states and 683049 transitions. Word has length 54 [2019-01-13 04:01:01,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 04:01:01,478 INFO L480 AbstractCegarLoop]: Abstraction has 192266 states and 683049 transitions. [2019-01-13 04:01:01,478 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-13 04:01:01,478 INFO L276 IsEmpty]: Start isEmpty. Operand 192266 states and 683049 transitions. [2019-01-13 04:01:01,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-01-13 04:01:01,504 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 04:01:01,504 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] [2019-01-13 04:01:01,505 INFO L423 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 04:01:01,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 04:01:01,505 INFO L82 PathProgramCache]: Analyzing trace with hash -627103140, now seen corresponding path program 1 times [2019-01-13 04:01:01,505 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 04:01:01,505 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 04:01:01,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 04:01:01,508 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 04:01:01,508 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 04:01:01,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 04:01:01,656 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 04:01:01,656 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 04:01:01,656 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-13 04:01:01,656 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-13 04:01:01,657 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-13 04:01:01,657 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-13 04:01:01,657 INFO L87 Difference]: Start difference. First operand 192266 states and 683049 transitions. Second operand 4 states. [2019-01-13 04:01:01,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 04:01:01,857 INFO L93 Difference]: Finished difference Result 29127 states and 92139 transitions. [2019-01-13 04:01:01,857 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-13 04:01:01,857 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 54 [2019-01-13 04:01:01,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 04:01:01,902 INFO L225 Difference]: With dead ends: 29127 [2019-01-13 04:01:01,902 INFO L226 Difference]: Without dead ends: 22849 [2019-01-13 04:01:01,903 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 04:01:01,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22849 states. [2019-01-13 04:01:02,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22849 to 22602. [2019-01-13 04:01:02,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22602 states. [2019-01-13 04:01:02,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22602 states to 22602 states and 69780 transitions. [2019-01-13 04:01:02,253 INFO L78 Accepts]: Start accepts. Automaton has 22602 states and 69780 transitions. Word has length 54 [2019-01-13 04:01:02,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 04:01:02,253 INFO L480 AbstractCegarLoop]: Abstraction has 22602 states and 69780 transitions. [2019-01-13 04:01:02,253 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-13 04:01:02,253 INFO L276 IsEmpty]: Start isEmpty. Operand 22602 states and 69780 transitions. [2019-01-13 04:01:02,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-01-13 04:01:02,259 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 04:01:02,260 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] [2019-01-13 04:01:02,260 INFO L423 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 04:01:02,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 04:01:02,260 INFO L82 PathProgramCache]: Analyzing trace with hash -917178143, now seen corresponding path program 1 times [2019-01-13 04:01:02,260 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 04:01:02,260 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 04:01:02,262 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 04:01:02,262 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 04:01:02,262 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 04:01:02,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 04:01:02,351 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 04:01:02,351 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 04:01:02,351 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-13 04:01:02,352 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-13 04:01:02,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-13 04:01:02,352 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-13 04:01:02,352 INFO L87 Difference]: Start difference. First operand 22602 states and 69780 transitions. Second operand 4 states. [2019-01-13 04:01:02,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 04:01:02,738 INFO L93 Difference]: Finished difference Result 29366 states and 90886 transitions. [2019-01-13 04:01:02,738 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-13 04:01:02,738 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 63 [2019-01-13 04:01:02,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 04:01:02,789 INFO L225 Difference]: With dead ends: 29366 [2019-01-13 04:01:02,789 INFO L226 Difference]: Without dead ends: 29366 [2019-01-13 04:01:02,790 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 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 04:01:02,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29366 states. [2019-01-13 04:01:03,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29366 to 26238. [2019-01-13 04:01:03,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26238 states. [2019-01-13 04:01:03,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26238 states to 26238 states and 80860 transitions. [2019-01-13 04:01:03,213 INFO L78 Accepts]: Start accepts. Automaton has 26238 states and 80860 transitions. Word has length 63 [2019-01-13 04:01:03,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 04:01:03,213 INFO L480 AbstractCegarLoop]: Abstraction has 26238 states and 80860 transitions. [2019-01-13 04:01:03,213 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-13 04:01:03,214 INFO L276 IsEmpty]: Start isEmpty. Operand 26238 states and 80860 transitions. [2019-01-13 04:01:03,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-01-13 04:01:03,221 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 04:01:03,221 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] [2019-01-13 04:01:03,221 INFO L423 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 04:01:03,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 04:01:03,222 INFO L82 PathProgramCache]: Analyzing trace with hash 825632192, now seen corresponding path program 1 times [2019-01-13 04:01:03,222 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 04:01:03,222 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 04:01:03,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 04:01:03,224 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 04:01:03,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 04:01:03,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 04:01:03,405 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 04:01:03,405 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 04:01:03,405 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-13 04:01:03,406 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-13 04:01:03,406 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-13 04:01:03,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-01-13 04:01:03,406 INFO L87 Difference]: Start difference. First operand 26238 states and 80860 transitions. Second operand 6 states. [2019-01-13 04:01:04,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 04:01:04,254 INFO L93 Difference]: Finished difference Result 53431 states and 163786 transitions. [2019-01-13 04:01:04,255 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-13 04:01:04,255 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 63 [2019-01-13 04:01:04,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 04:01:04,353 INFO L225 Difference]: With dead ends: 53431 [2019-01-13 04:01:04,353 INFO L226 Difference]: Without dead ends: 53367 [2019-01-13 04:01:04,353 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-01-13 04:01:04,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53367 states. [2019-01-13 04:01:04,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53367 to 34364. [2019-01-13 04:01:04,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34364 states. [2019-01-13 04:01:05,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34364 states to 34364 states and 104270 transitions. [2019-01-13 04:01:05,009 INFO L78 Accepts]: Start accepts. Automaton has 34364 states and 104270 transitions. Word has length 63 [2019-01-13 04:01:05,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 04:01:05,009 INFO L480 AbstractCegarLoop]: Abstraction has 34364 states and 104270 transitions. [2019-01-13 04:01:05,009 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-13 04:01:05,009 INFO L276 IsEmpty]: Start isEmpty. Operand 34364 states and 104270 transitions. [2019-01-13 04:01:05,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-01-13 04:01:05,024 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 04:01:05,024 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] [2019-01-13 04:01:05,024 INFO L423 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 04:01:05,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 04:01:05,025 INFO L82 PathProgramCache]: Analyzing trace with hash -1816196687, now seen corresponding path program 1 times [2019-01-13 04:01:05,025 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 04:01:05,025 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 04:01:05,027 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 04:01:05,027 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 04:01:05,027 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 04:01:05,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 04:01:05,121 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 04:01:05,121 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 04:01:05,121 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-13 04:01:05,121 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-13 04:01:05,123 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-13 04:01:05,123 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-13 04:01:05,123 INFO L87 Difference]: Start difference. First operand 34364 states and 104270 transitions. Second operand 3 states. [2019-01-13 04:01:05,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 04:01:05,363 INFO L93 Difference]: Finished difference Result 37960 states and 113326 transitions. [2019-01-13 04:01:05,364 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-13 04:01:05,364 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 69 [2019-01-13 04:01:05,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 04:01:05,431 INFO L225 Difference]: With dead ends: 37960 [2019-01-13 04:01:05,431 INFO L226 Difference]: Without dead ends: 37960 [2019-01-13 04:01:05,431 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-13 04:01:05,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37960 states. [2019-01-13 04:01:07,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37960 to 33288. [2019-01-13 04:01:07,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33288 states. [2019-01-13 04:01:07,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33288 states to 33288 states and 98676 transitions. [2019-01-13 04:01:07,206 INFO L78 Accepts]: Start accepts. Automaton has 33288 states and 98676 transitions. Word has length 69 [2019-01-13 04:01:07,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 04:01:07,207 INFO L480 AbstractCegarLoop]: Abstraction has 33288 states and 98676 transitions. [2019-01-13 04:01:07,207 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-13 04:01:07,207 INFO L276 IsEmpty]: Start isEmpty. Operand 33288 states and 98676 transitions. [2019-01-13 04:01:07,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-01-13 04:01:07,223 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 04:01:07,223 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] [2019-01-13 04:01:07,224 INFO L423 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 04:01:07,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 04:01:07,224 INFO L82 PathProgramCache]: Analyzing trace with hash 927307833, now seen corresponding path program 1 times [2019-01-13 04:01:07,224 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 04:01:07,224 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 04:01:07,226 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 04:01:07,226 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 04:01:07,226 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 04:01:07,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 04:01:07,480 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 04:01:07,481 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 04:01:07,481 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-13 04:01:07,481 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-13 04:01:07,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-13 04:01:07,482 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-13 04:01:07,482 INFO L87 Difference]: Start difference. First operand 33288 states and 98676 transitions. Second operand 4 states. [2019-01-13 04:01:08,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 04:01:08,490 INFO L93 Difference]: Finished difference Result 44424 states and 131972 transitions. [2019-01-13 04:01:08,491 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-13 04:01:08,491 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 71 [2019-01-13 04:01:08,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 04:01:08,581 INFO L225 Difference]: With dead ends: 44424 [2019-01-13 04:01:08,582 INFO L226 Difference]: Without dead ends: 43848 [2019-01-13 04:01:08,582 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-13 04:01:08,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43848 states. [2019-01-13 04:01:09,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43848 to 41436. [2019-01-13 04:01:09,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41436 states. [2019-01-13 04:01:09,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41436 states to 41436 states and 122987 transitions. [2019-01-13 04:01:09,255 INFO L78 Accepts]: Start accepts. Automaton has 41436 states and 122987 transitions. Word has length 71 [2019-01-13 04:01:09,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 04:01:09,255 INFO L480 AbstractCegarLoop]: Abstraction has 41436 states and 122987 transitions. [2019-01-13 04:01:09,255 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-13 04:01:09,255 INFO L276 IsEmpty]: Start isEmpty. Operand 41436 states and 122987 transitions. [2019-01-13 04:01:09,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-01-13 04:01:09,275 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 04:01:09,275 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] [2019-01-13 04:01:09,276 INFO L423 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 04:01:09,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 04:01:09,276 INFO L82 PathProgramCache]: Analyzing trace with hash -869643526, now seen corresponding path program 1 times [2019-01-13 04:01:09,276 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 04:01:09,276 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 04:01:09,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 04:01:09,280 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 04:01:09,281 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 04:01:09,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 04:01:09,498 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 04:01:09,498 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 04:01:09,499 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-01-13 04:01:09,499 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-13 04:01:09,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-13 04:01:09,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-01-13 04:01:09,499 INFO L87 Difference]: Start difference. First operand 41436 states and 122987 transitions. Second operand 8 states. [2019-01-13 04:01:11,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 04:01:11,467 INFO L93 Difference]: Finished difference Result 48133 states and 141125 transitions. [2019-01-13 04:01:11,468 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-13 04:01:11,468 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 71 [2019-01-13 04:01:11,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 04:01:11,545 INFO L225 Difference]: With dead ends: 48133 [2019-01-13 04:01:11,545 INFO L226 Difference]: Without dead ends: 48133 [2019-01-13 04:01:11,546 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2019-01-13 04:01:11,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48133 states. [2019-01-13 04:01:12,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48133 to 44392. [2019-01-13 04:01:12,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44392 states. [2019-01-13 04:01:12,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44392 states to 44392 states and 130936 transitions. [2019-01-13 04:01:12,181 INFO L78 Accepts]: Start accepts. Automaton has 44392 states and 130936 transitions. Word has length 71 [2019-01-13 04:01:12,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 04:01:12,181 INFO L480 AbstractCegarLoop]: Abstraction has 44392 states and 130936 transitions. [2019-01-13 04:01:12,181 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-13 04:01:12,181 INFO L276 IsEmpty]: Start isEmpty. Operand 44392 states and 130936 transitions. [2019-01-13 04:01:12,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-01-13 04:01:12,202 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 04:01:12,202 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] [2019-01-13 04:01:12,202 INFO L423 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 04:01:12,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 04:01:12,202 INFO L82 PathProgramCache]: Analyzing trace with hash 17860155, now seen corresponding path program 1 times [2019-01-13 04:01:12,203 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 04:01:12,203 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 04:01:12,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 04:01:12,204 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 04:01:12,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 04:01:12,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 04:01:12,314 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 04:01:12,314 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 04:01:12,314 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-13 04:01:12,315 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-13 04:01:12,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-13 04:01:12,315 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-01-13 04:01:12,315 INFO L87 Difference]: Start difference. First operand 44392 states and 130936 transitions. Second operand 5 states. [2019-01-13 04:01:12,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 04:01:12,392 INFO L93 Difference]: Finished difference Result 11932 states and 29919 transitions. [2019-01-13 04:01:12,393 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-13 04:01:12,393 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 71 [2019-01-13 04:01:12,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 04:01:12,406 INFO L225 Difference]: With dead ends: 11932 [2019-01-13 04:01:12,406 INFO L226 Difference]: Without dead ends: 10080 [2019-01-13 04:01:12,406 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-01-13 04:01:12,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10080 states. [2019-01-13 04:01:12,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10080 to 7653. [2019-01-13 04:01:12,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7653 states. [2019-01-13 04:01:12,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7653 states to 7653 states and 19062 transitions. [2019-01-13 04:01:12,502 INFO L78 Accepts]: Start accepts. Automaton has 7653 states and 19062 transitions. Word has length 71 [2019-01-13 04:01:12,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 04:01:12,502 INFO L480 AbstractCegarLoop]: Abstraction has 7653 states and 19062 transitions. [2019-01-13 04:01:12,502 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-13 04:01:12,502 INFO L276 IsEmpty]: Start isEmpty. Operand 7653 states and 19062 transitions. [2019-01-13 04:01:12,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-01-13 04:01:12,510 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 04:01:12,511 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 04:01:12,511 INFO L423 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 04:01:12,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 04:01:12,511 INFO L82 PathProgramCache]: Analyzing trace with hash 1240556100, now seen corresponding path program 1 times [2019-01-13 04:01:12,511 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 04:01:12,512 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 04:01:12,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 04:01:12,513 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 04:01:12,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 04:01:12,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 04:01:12,626 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 04:01:12,627 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 04:01:12,627 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-13 04:01:12,627 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-13 04:01:12,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-13 04:01:12,627 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-13 04:01:12,628 INFO L87 Difference]: Start difference. First operand 7653 states and 19062 transitions. Second operand 4 states. [2019-01-13 04:01:12,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 04:01:12,929 INFO L93 Difference]: Finished difference Result 9032 states and 22112 transitions. [2019-01-13 04:01:12,930 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-13 04:01:12,930 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 100 [2019-01-13 04:01:12,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 04:01:12,941 INFO L225 Difference]: With dead ends: 9032 [2019-01-13 04:01:12,942 INFO L226 Difference]: Without dead ends: 9032 [2019-01-13 04:01:12,942 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-13 04:01:12,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9032 states. [2019-01-13 04:01:13,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9032 to 8326. [2019-01-13 04:01:13,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8326 states. [2019-01-13 04:01:13,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8326 states to 8326 states and 20517 transitions. [2019-01-13 04:01:13,036 INFO L78 Accepts]: Start accepts. Automaton has 8326 states and 20517 transitions. Word has length 100 [2019-01-13 04:01:13,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 04:01:13,037 INFO L480 AbstractCegarLoop]: Abstraction has 8326 states and 20517 transitions. [2019-01-13 04:01:13,037 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-13 04:01:13,037 INFO L276 IsEmpty]: Start isEmpty. Operand 8326 states and 20517 transitions. [2019-01-13 04:01:13,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-01-13 04:01:13,046 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 04:01:13,046 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 04:01:13,046 INFO L423 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 04:01:13,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 04:01:13,047 INFO L82 PathProgramCache]: Analyzing trace with hash -1809646715, now seen corresponding path program 1 times [2019-01-13 04:01:13,047 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 04:01:13,047 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 04:01:13,048 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 04:01:13,048 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 04:01:13,048 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 04:01:13,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 04:01:13,563 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 04:01:13,563 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 04:01:13,564 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-01-13 04:01:13,564 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-13 04:01:13,564 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-13 04:01:13,564 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-01-13 04:01:13,565 INFO L87 Difference]: Start difference. First operand 8326 states and 20517 transitions. Second operand 8 states. [2019-01-13 04:01:15,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 04:01:15,505 INFO L93 Difference]: Finished difference Result 18094 states and 43167 transitions. [2019-01-13 04:01:15,506 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-01-13 04:01:15,506 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 100 [2019-01-13 04:01:15,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 04:01:15,530 INFO L225 Difference]: With dead ends: 18094 [2019-01-13 04:01:15,530 INFO L226 Difference]: Without dead ends: 17999 [2019-01-13 04:01:15,530 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=81, Invalid=261, Unknown=0, NotChecked=0, Total=342 [2019-01-13 04:01:15,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17999 states. [2019-01-13 04:01:15,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17999 to 14189. [2019-01-13 04:01:15,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14189 states. [2019-01-13 04:01:15,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14189 states to 14189 states and 34364 transitions. [2019-01-13 04:01:15,712 INFO L78 Accepts]: Start accepts. Automaton has 14189 states and 34364 transitions. Word has length 100 [2019-01-13 04:01:15,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 04:01:15,712 INFO L480 AbstractCegarLoop]: Abstraction has 14189 states and 34364 transitions. [2019-01-13 04:01:15,712 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-13 04:01:15,712 INFO L276 IsEmpty]: Start isEmpty. Operand 14189 states and 34364 transitions. [2019-01-13 04:01:15,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-01-13 04:01:15,727 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 04:01:15,727 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 04:01:15,728 INFO L423 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 04:01:15,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 04:01:15,728 INFO L82 PathProgramCache]: Analyzing trace with hash 408111238, now seen corresponding path program 1 times [2019-01-13 04:01:15,728 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 04:01:15,728 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 04:01:15,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 04:01:15,730 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 04:01:15,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 04:01:15,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 04:01:16,069 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 04:01:16,069 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 04:01:16,069 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-13 04:01:16,070 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-13 04:01:16,070 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-13 04:01:16,070 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-01-13 04:01:16,070 INFO L87 Difference]: Start difference. First operand 14189 states and 34364 transitions. Second operand 7 states. [2019-01-13 04:01:16,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 04:01:16,753 INFO L93 Difference]: Finished difference Result 19352 states and 44884 transitions. [2019-01-13 04:01:16,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-13 04:01:16,754 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 100 [2019-01-13 04:01:16,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 04:01:16,778 INFO L225 Difference]: With dead ends: 19352 [2019-01-13 04:01:16,778 INFO L226 Difference]: Without dead ends: 19352 [2019-01-13 04:01:16,778 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2019-01-13 04:01:16,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19352 states. [2019-01-13 04:01:16,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19352 to 16465. [2019-01-13 04:01:16,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16465 states. [2019-01-13 04:01:16,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16465 states to 16465 states and 38763 transitions. [2019-01-13 04:01:16,999 INFO L78 Accepts]: Start accepts. Automaton has 16465 states and 38763 transitions. Word has length 100 [2019-01-13 04:01:16,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 04:01:16,999 INFO L480 AbstractCegarLoop]: Abstraction has 16465 states and 38763 transitions. [2019-01-13 04:01:16,999 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-13 04:01:16,999 INFO L276 IsEmpty]: Start isEmpty. Operand 16465 states and 38763 transitions. [2019-01-13 04:01:17,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-01-13 04:01:17,018 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 04:01:17,018 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 04:01:17,019 INFO L423 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 04:01:17,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 04:01:17,019 INFO L82 PathProgramCache]: Analyzing trace with hash 619462151, now seen corresponding path program 1 times [2019-01-13 04:01:17,019 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 04:01:17,019 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 04:01:17,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 04:01:17,021 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 04:01:17,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 04:01:17,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 04:01:17,666 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 04:01:17,667 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 04:01:17,667 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-13 04:01:17,668 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-13 04:01:17,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-13 04:01:17,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-01-13 04:01:17,668 INFO L87 Difference]: Start difference. First operand 16465 states and 38763 transitions. Second operand 7 states. [2019-01-13 04:01:19,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 04:01:19,136 INFO L93 Difference]: Finished difference Result 18474 states and 43255 transitions. [2019-01-13 04:01:19,137 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-01-13 04:01:19,138 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 100 [2019-01-13 04:01:19,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 04:01:19,165 INFO L225 Difference]: With dead ends: 18474 [2019-01-13 04:01:19,166 INFO L226 Difference]: Without dead ends: 18474 [2019-01-13 04:01:19,166 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2019-01-13 04:01:19,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18474 states. [2019-01-13 04:01:19,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18474 to 17057. [2019-01-13 04:01:19,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17057 states. [2019-01-13 04:01:19,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17057 states to 17057 states and 40062 transitions. [2019-01-13 04:01:19,385 INFO L78 Accepts]: Start accepts. Automaton has 17057 states and 40062 transitions. Word has length 100 [2019-01-13 04:01:19,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 04:01:19,385 INFO L480 AbstractCegarLoop]: Abstraction has 17057 states and 40062 transitions. [2019-01-13 04:01:19,385 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-13 04:01:19,385 INFO L276 IsEmpty]: Start isEmpty. Operand 17057 states and 40062 transitions. [2019-01-13 04:01:19,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-01-13 04:01:19,405 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 04:01:19,406 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 04:01:19,406 INFO L423 AbstractCegarLoop]: === Iteration 21 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 04:01:19,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 04:01:19,406 INFO L82 PathProgramCache]: Analyzing trace with hash -1688023385, now seen corresponding path program 1 times [2019-01-13 04:01:19,406 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 04:01:19,407 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 04:01:19,411 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 04:01:19,411 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 04:01:19,411 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 04:01:19,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 04:01:19,784 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 04:01:19,784 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 04:01:19,784 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-13 04:01:19,785 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-13 04:01:19,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-13 04:01:19,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-01-13 04:01:19,785 INFO L87 Difference]: Start difference. First operand 17057 states and 40062 transitions. Second operand 7 states. [2019-01-13 04:01:20,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 04:01:20,160 INFO L93 Difference]: Finished difference Result 17983 states and 42002 transitions. [2019-01-13 04:01:20,161 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-13 04:01:20,161 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 100 [2019-01-13 04:01:20,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 04:01:20,185 INFO L225 Difference]: With dead ends: 17983 [2019-01-13 04:01:20,185 INFO L226 Difference]: Without dead ends: 17983 [2019-01-13 04:01:20,186 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2019-01-13 04:01:20,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17983 states. [2019-01-13 04:01:20,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17983 to 16520. [2019-01-13 04:01:20,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16520 states. [2019-01-13 04:01:20,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16520 states to 16520 states and 38816 transitions. [2019-01-13 04:01:20,399 INFO L78 Accepts]: Start accepts. Automaton has 16520 states and 38816 transitions. Word has length 100 [2019-01-13 04:01:20,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 04:01:20,399 INFO L480 AbstractCegarLoop]: Abstraction has 16520 states and 38816 transitions. [2019-01-13 04:01:20,399 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-13 04:01:20,399 INFO L276 IsEmpty]: Start isEmpty. Operand 16520 states and 38816 transitions. [2019-01-13 04:01:20,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-01-13 04:01:20,419 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 04:01:20,419 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 04:01:20,420 INFO L423 AbstractCegarLoop]: === Iteration 22 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 04:01:20,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 04:01:20,420 INFO L82 PathProgramCache]: Analyzing trace with hash -800519704, now seen corresponding path program 1 times [2019-01-13 04:01:20,420 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 04:01:20,420 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 04:01:20,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 04:01:20,422 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 04:01:20,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 04:01:20,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 04:01:20,788 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 04:01:20,789 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 04:01:20,789 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-13 04:01:20,789 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-13 04:01:20,789 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-13 04:01:20,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-01-13 04:01:20,792 INFO L87 Difference]: Start difference. First operand 16520 states and 38816 transitions. Second operand 5 states. [2019-01-13 04:01:21,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 04:01:21,448 INFO L93 Difference]: Finished difference Result 19359 states and 45352 transitions. [2019-01-13 04:01:21,449 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-13 04:01:21,449 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 100 [2019-01-13 04:01:21,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 04:01:21,474 INFO L225 Difference]: With dead ends: 19359 [2019-01-13 04:01:21,474 INFO L226 Difference]: Without dead ends: 19359 [2019-01-13 04:01:21,475 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-01-13 04:01:21,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19359 states. [2019-01-13 04:01:21,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19359 to 15812. [2019-01-13 04:01:21,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15812 states. [2019-01-13 04:01:21,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15812 states to 15812 states and 37143 transitions. [2019-01-13 04:01:21,671 INFO L78 Accepts]: Start accepts. Automaton has 15812 states and 37143 transitions. Word has length 100 [2019-01-13 04:01:21,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 04:01:21,672 INFO L480 AbstractCegarLoop]: Abstraction has 15812 states and 37143 transitions. [2019-01-13 04:01:21,672 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-13 04:01:21,672 INFO L276 IsEmpty]: Start isEmpty. Operand 15812 states and 37143 transitions. [2019-01-13 04:01:21,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-01-13 04:01:21,688 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 04:01:21,689 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 04:01:21,689 INFO L423 AbstractCegarLoop]: === Iteration 23 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 04:01:21,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 04:01:21,689 INFO L82 PathProgramCache]: Analyzing trace with hash 845842068, now seen corresponding path program 2 times [2019-01-13 04:01:21,689 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 04:01:21,690 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 04:01:21,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 04:01:21,691 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 04:01:21,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 04:01:21,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 04:01:21,813 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 04:01:21,813 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 04:01:21,813 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-13 04:01:21,813 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-13 04:01:21,814 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-13 04:01:21,814 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-13 04:01:21,814 INFO L87 Difference]: Start difference. First operand 15812 states and 37143 transitions. Second operand 5 states. [2019-01-13 04:01:22,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 04:01:22,162 INFO L93 Difference]: Finished difference Result 17772 states and 41236 transitions. [2019-01-13 04:01:22,163 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-13 04:01:22,163 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 100 [2019-01-13 04:01:22,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 04:01:22,186 INFO L225 Difference]: With dead ends: 17772 [2019-01-13 04:01:22,186 INFO L226 Difference]: Without dead ends: 17772 [2019-01-13 04:01:22,187 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-01-13 04:01:22,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17772 states. [2019-01-13 04:01:22,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17772 to 15941. [2019-01-13 04:01:22,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15941 states. [2019-01-13 04:01:22,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15941 states to 15941 states and 37408 transitions. [2019-01-13 04:01:22,393 INFO L78 Accepts]: Start accepts. Automaton has 15941 states and 37408 transitions. Word has length 100 [2019-01-13 04:01:22,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 04:01:22,393 INFO L480 AbstractCegarLoop]: Abstraction has 15941 states and 37408 transitions. [2019-01-13 04:01:22,393 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-13 04:01:22,393 INFO L276 IsEmpty]: Start isEmpty. Operand 15941 states and 37408 transitions. [2019-01-13 04:01:22,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-01-13 04:01:22,411 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 04:01:22,412 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 04:01:22,412 INFO L423 AbstractCegarLoop]: === Iteration 24 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 04:01:22,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 04:01:22,412 INFO L82 PathProgramCache]: Analyzing trace with hash 1066033005, now seen corresponding path program 1 times [2019-01-13 04:01:22,412 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 04:01:22,412 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 04:01:22,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 04:01:22,414 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-13 04:01:22,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 04:01:22,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 04:01:22,591 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 04:01:22,592 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 04:01:22,592 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-13 04:01:22,592 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-13 04:01:22,592 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-13 04:01:22,593 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-01-13 04:01:22,593 INFO L87 Difference]: Start difference. First operand 15941 states and 37408 transitions. Second operand 7 states. [2019-01-13 04:01:22,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 04:01:22,734 INFO L93 Difference]: Finished difference Result 19424 states and 45800 transitions. [2019-01-13 04:01:22,736 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-13 04:01:22,736 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 102 [2019-01-13 04:01:22,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 04:01:22,742 INFO L225 Difference]: With dead ends: 19424 [2019-01-13 04:01:22,742 INFO L226 Difference]: Without dead ends: 3672 [2019-01-13 04:01:22,743 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-01-13 04:01:22,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3672 states. [2019-01-13 04:01:22,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3672 to 3670. [2019-01-13 04:01:22,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3670 states. [2019-01-13 04:01:22,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3670 states to 3670 states and 8692 transitions. [2019-01-13 04:01:22,784 INFO L78 Accepts]: Start accepts. Automaton has 3670 states and 8692 transitions. Word has length 102 [2019-01-13 04:01:22,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 04:01:22,784 INFO L480 AbstractCegarLoop]: Abstraction has 3670 states and 8692 transitions. [2019-01-13 04:01:22,784 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-13 04:01:22,784 INFO L276 IsEmpty]: Start isEmpty. Operand 3670 states and 8692 transitions. [2019-01-13 04:01:22,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-01-13 04:01:22,788 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 04:01:22,789 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 04:01:22,789 INFO L423 AbstractCegarLoop]: === Iteration 25 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 04:01:22,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 04:01:22,789 INFO L82 PathProgramCache]: Analyzing trace with hash -373689113, now seen corresponding path program 1 times [2019-01-13 04:01:22,790 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 04:01:22,790 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 04:01:22,791 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 04:01:22,792 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 04:01:22,792 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 04:01:22,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 04:01:23,148 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 04:01:23,149 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 04:01:23,149 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-13 04:01:23,150 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-13 04:01:23,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-13 04:01:23,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-13 04:01:23,151 INFO L87 Difference]: Start difference. First operand 3670 states and 8692 transitions. Second operand 5 states. [2019-01-13 04:01:24,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 04:01:24,063 INFO L93 Difference]: Finished difference Result 4083 states and 9603 transitions. [2019-01-13 04:01:24,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-13 04:01:24,065 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 102 [2019-01-13 04:01:24,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 04:01:24,070 INFO L225 Difference]: With dead ends: 4083 [2019-01-13 04:01:24,070 INFO L226 Difference]: Without dead ends: 4059 [2019-01-13 04:01:24,071 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-01-13 04:01:24,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4059 states. [2019-01-13 04:01:24,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4059 to 3726. [2019-01-13 04:01:24,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3726 states. [2019-01-13 04:01:24,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3726 states to 3726 states and 8817 transitions. [2019-01-13 04:01:24,108 INFO L78 Accepts]: Start accepts. Automaton has 3726 states and 8817 transitions. Word has length 102 [2019-01-13 04:01:24,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 04:01:24,108 INFO L480 AbstractCegarLoop]: Abstraction has 3726 states and 8817 transitions. [2019-01-13 04:01:24,108 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-13 04:01:24,108 INFO L276 IsEmpty]: Start isEmpty. Operand 3726 states and 8817 transitions. [2019-01-13 04:01:24,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-01-13 04:01:24,112 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 04:01:24,113 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 04:01:24,113 INFO L423 AbstractCegarLoop]: === Iteration 26 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 04:01:24,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 04:01:24,113 INFO L82 PathProgramCache]: Analyzing trace with hash -409676059, now seen corresponding path program 1 times [2019-01-13 04:01:24,113 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 04:01:24,113 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 04:01:24,115 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 04:01:24,115 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 04:01:24,115 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 04:01:24,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 04:01:24,285 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 04:01:24,286 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 04:01:24,286 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-13 04:01:24,286 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-13 04:01:24,286 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-13 04:01:24,286 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-01-13 04:01:24,287 INFO L87 Difference]: Start difference. First operand 3726 states and 8817 transitions. Second operand 7 states. [2019-01-13 04:01:24,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 04:01:24,615 INFO L93 Difference]: Finished difference Result 4173 states and 9758 transitions. [2019-01-13 04:01:24,615 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-13 04:01:24,616 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 102 [2019-01-13 04:01:24,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 04:01:24,621 INFO L225 Difference]: With dead ends: 4173 [2019-01-13 04:01:24,621 INFO L226 Difference]: Without dead ends: 4173 [2019-01-13 04:01:24,622 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-01-13 04:01:24,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4173 states. [2019-01-13 04:01:24,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4173 to 3668. [2019-01-13 04:01:24,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3668 states. [2019-01-13 04:01:24,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3668 states to 3668 states and 8699 transitions. [2019-01-13 04:01:24,659 INFO L78 Accepts]: Start accepts. Automaton has 3668 states and 8699 transitions. Word has length 102 [2019-01-13 04:01:24,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 04:01:24,660 INFO L480 AbstractCegarLoop]: Abstraction has 3668 states and 8699 transitions. [2019-01-13 04:01:24,660 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-13 04:01:24,660 INFO L276 IsEmpty]: Start isEmpty. Operand 3668 states and 8699 transitions. [2019-01-13 04:01:24,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-01-13 04:01:24,664 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 04:01:24,664 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 04:01:24,664 INFO L423 AbstractCegarLoop]: === Iteration 27 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 04:01:24,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 04:01:24,665 INFO L82 PathProgramCache]: Analyzing trace with hash -1904655584, now seen corresponding path program 1 times [2019-01-13 04:01:24,665 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 04:01:24,665 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 04:01:24,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 04:01:24,666 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 04:01:24,667 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 04:01:24,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 04:01:24,974 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 04:01:24,974 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 04:01:24,974 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-13 04:01:24,975 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-13 04:01:24,975 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-13 04:01:24,975 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-01-13 04:01:24,975 INFO L87 Difference]: Start difference. First operand 3668 states and 8699 transitions. Second operand 5 states. [2019-01-13 04:01:25,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 04:01:25,018 INFO L93 Difference]: Finished difference Result 3668 states and 8683 transitions. [2019-01-13 04:01:25,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-13 04:01:25,019 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 102 [2019-01-13 04:01:25,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 04:01:25,024 INFO L225 Difference]: With dead ends: 3668 [2019-01-13 04:01:25,024 INFO L226 Difference]: Without dead ends: 3668 [2019-01-13 04:01:25,025 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-01-13 04:01:25,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3668 states. [2019-01-13 04:01:25,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3668 to 3274. [2019-01-13 04:01:25,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3274 states. [2019-01-13 04:01:25,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3274 states to 3274 states and 7771 transitions. [2019-01-13 04:01:25,063 INFO L78 Accepts]: Start accepts. Automaton has 3274 states and 7771 transitions. Word has length 102 [2019-01-13 04:01:25,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 04:01:25,063 INFO L480 AbstractCegarLoop]: Abstraction has 3274 states and 7771 transitions. [2019-01-13 04:01:25,063 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-13 04:01:25,063 INFO L276 IsEmpty]: Start isEmpty. Operand 3274 states and 7771 transitions. [2019-01-13 04:01:25,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-01-13 04:01:25,068 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 04:01:25,068 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 04:01:25,068 INFO L423 AbstractCegarLoop]: === Iteration 28 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 04:01:25,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 04:01:25,068 INFO L82 PathProgramCache]: Analyzing trace with hash -1017151903, now seen corresponding path program 2 times [2019-01-13 04:01:25,069 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 04:01:25,069 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 04:01:25,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 04:01:25,070 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 04:01:25,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 04:01:25,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 04:01:25,394 WARN L181 SmtUtils]: Spent 228.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2019-01-13 04:01:25,563 WARN L181 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2019-01-13 04:01:25,863 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 04:01:25,863 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 04:01:25,863 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-01-13 04:01:25,864 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-01-13 04:01:25,864 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-01-13 04:01:25,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2019-01-13 04:01:25,864 INFO L87 Difference]: Start difference. First operand 3274 states and 7771 transitions. Second operand 13 states. [2019-01-13 04:01:26,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 04:01:26,774 INFO L93 Difference]: Finished difference Result 5160 states and 12024 transitions. [2019-01-13 04:01:26,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-01-13 04:01:26,775 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 102 [2019-01-13 04:01:26,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 04:01:26,781 INFO L225 Difference]: With dead ends: 5160 [2019-01-13 04:01:26,782 INFO L226 Difference]: Without dead ends: 3780 [2019-01-13 04:01:26,782 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=75, Invalid=387, Unknown=0, NotChecked=0, Total=462 [2019-01-13 04:01:26,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3780 states. [2019-01-13 04:01:26,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3780 to 3330. [2019-01-13 04:01:26,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3330 states. [2019-01-13 04:01:26,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3330 states to 3330 states and 7833 transitions. [2019-01-13 04:01:26,819 INFO L78 Accepts]: Start accepts. Automaton has 3330 states and 7833 transitions. Word has length 102 [2019-01-13 04:01:26,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 04:01:26,820 INFO L480 AbstractCegarLoop]: Abstraction has 3330 states and 7833 transitions. [2019-01-13 04:01:26,820 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-01-13 04:01:26,820 INFO L276 IsEmpty]: Start isEmpty. Operand 3330 states and 7833 transitions. [2019-01-13 04:01:26,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-01-13 04:01:26,825 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 04:01:26,825 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 04:01:26,825 INFO L423 AbstractCegarLoop]: === Iteration 29 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 04:01:26,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 04:01:26,825 INFO L82 PathProgramCache]: Analyzing trace with hash -604299489, now seen corresponding path program 3 times [2019-01-13 04:01:26,826 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 04:01:26,826 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 04:01:26,827 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 04:01:26,827 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-13 04:01:26,827 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 04:01:26,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-13 04:01:26,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-13 04:01:26,933 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-01-13 04:01:27,129 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2019-01-13 04:01:27,133 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.01 04:01:27 BasicIcfg [2019-01-13 04:01:27,133 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-13 04:01:27,134 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-13 04:01:27,134 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-13 04:01:27,134 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-13 04:01:27,137 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.01 03:58:50" (3/4) ... [2019-01-13 04:01:27,141 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2019-01-13 04:01:27,335 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-13 04:01:27,336 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-13 04:01:27,337 INFO L168 Benchmark]: Toolchain (without parser) took 158908.44 ms. Allocated memory was 1.0 GB in the beginning and 7.0 GB in the end (delta: 6.0 GB). Free memory was 952.7 MB in the beginning and 4.8 GB in the end (delta: -3.9 GB). Peak memory consumption was 2.1 GB. Max. memory is 11.5 GB. [2019-01-13 04:01:27,338 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 04:01:27,339 INFO L168 Benchmark]: CACSL2BoogieTranslator took 805.15 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 145.2 MB). Free memory was 947.3 MB in the beginning and 1.1 GB in the end (delta: -172.1 MB). Peak memory consumption was 32.9 MB. Max. memory is 11.5 GB. [2019-01-13 04:01:27,339 INFO L168 Benchmark]: Boogie Procedure Inliner took 79.26 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2019-01-13 04:01:27,339 INFO L168 Benchmark]: Boogie Preprocessor took 51.68 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-13 04:01:27,340 INFO L168 Benchmark]: RCFGBuilder took 1536.42 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 58.1 MB). Peak memory consumption was 58.1 MB. Max. memory is 11.5 GB. [2019-01-13 04:01:27,340 INFO L168 Benchmark]: TraceAbstraction took 156228.15 ms. Allocated memory was 1.2 GB in the beginning and 7.0 GB in the end (delta: 5.8 GB). Free memory was 1.1 GB in the beginning and 4.9 GB in the end (delta: -3.9 GB). Peak memory consumption was 2.0 GB. Max. memory is 11.5 GB. [2019-01-13 04:01:27,340 INFO L168 Benchmark]: Witness Printer took 201.96 ms. Allocated memory is still 7.0 GB. Free memory was 4.9 GB in the beginning and 4.8 GB in the end (delta: 82.9 MB). Peak memory consumption was 82.9 MB. Max. memory is 11.5 GB. [2019-01-13 04:01:27,346 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 805.15 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 145.2 MB). Free memory was 947.3 MB in the beginning and 1.1 GB in the end (delta: -172.1 MB). Peak memory consumption was 32.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 79.26 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 51.68 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 1536.42 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 58.1 MB). Peak memory consumption was 58.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 156228.15 ms. Allocated memory was 1.2 GB in the beginning and 7.0 GB in the end (delta: 5.8 GB). Free memory was 1.1 GB in the beginning and 4.9 GB in the end (delta: -3.9 GB). Peak memory consumption was 2.0 GB. Max. memory is 11.5 GB. * Witness Printer took 201.96 ms. Allocated memory is still 7.0 GB. Free memory was 4.9 GB in the beginning and 4.8 GB in the end (delta: 82.9 MB). Peak memory consumption was 82.9 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L672] -1 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L674] -1 int __unbuffered_p0_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0] [L676] -1 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0] [L678] -1 int __unbuffered_p1_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0] [L679] -1 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0] [L680] -1 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L682] -1 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L684] -1 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L685] -1 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L686] -1 int y$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L687] -1 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0] [L688] -1 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0] [L689] -1 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0] [L690] -1 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0] [L691] -1 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0] [L692] -1 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0] [L693] -1 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0] [L694] -1 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}] [L695] -1 int y$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0] [L696] -1 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0] [L697] -1 int y$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0] [L698] -1 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L699] -1 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L700] -1 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L786] -1 pthread_t t1765; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L787] FCALL, FORK -1 pthread_create(&t1765, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L788] -1 pthread_t t1766; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L789] FCALL, FORK -1 pthread_create(&t1766, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L734] 0 y$w_buff1 = y$w_buff0 [L735] 0 y$w_buff0 = 1 [L736] 0 y$w_buff1_used = y$w_buff0_used [L737] 0 y$w_buff0_used = (_Bool)1 [L5] COND FALSE 0 !(!expression) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L739] 0 y$r_buff1_thd0 = y$r_buff0_thd0 [L740] 0 y$r_buff1_thd1 = y$r_buff0_thd1 [L741] 0 y$r_buff1_thd2 = y$r_buff0_thd2 [L742] 0 y$r_buff0_thd2 = (_Bool)1 [L745] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L746] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L747] 0 y$flush_delayed = weak$$choice2 [L748] 0 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=3, x=0, y=0, y$flush_delayed=3, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L749] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=3, x=0, y=0, y$flush_delayed=3, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L749] EXPR 0 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=3, x=0, y=0, y$flush_delayed=3, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L749] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=3, x=0, y=0, y$flush_delayed=3, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L749] 0 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L750] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=3, x=0, y=1, y$flush_delayed=3, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L750] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L751] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=3, x=0, y=1, y$flush_delayed=3, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L751] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L752] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=3, x=0, y=1, y$flush_delayed=3, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L752] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L753] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=3, x=0, y=1, y$flush_delayed=3, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L753] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L754] EXPR 0 weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=3, x=0, y=1, y$flush_delayed=3, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L754] 0 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L755] EXPR 0 weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=3, x=0, y=1, y$flush_delayed=3, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L755] 0 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L756] 0 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=3, x=0, y=1, y$flush_delayed=3, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L757] EXPR 0 y$flush_delayed ? y$mem_tmp : y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=3, x=0, y=1, y$flush_delayed=3, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L757] 0 y = y$flush_delayed ? y$mem_tmp : y [L758] 0 y$flush_delayed = (_Bool)0 [L761] 0 __unbuffered_p1_EBX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=3, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L764] EXPR 0 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=3, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L704] 1 x = 1 [L709] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L710] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L711] 1 y$flush_delayed = weak$$choice2 [L712] 1 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=5, x=1, y=0, y$flush_delayed=5, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L713] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=5, x=1, y=0, y$flush_delayed=5, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L764] 0 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L765] EXPR 0 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used VAL [!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=5, x=1, y=1, y$flush_delayed=5, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L765] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L766] EXPR 0 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used VAL [!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=5, x=1, y=1, y$flush_delayed=5, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L766] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L713] 1 y = !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L714] EXPR 1 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=5, weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0))=1, x=1, y=0, y$flush_delayed=5, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L714] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L715] EXPR 1 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=5, weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1))=0, x=1, y=0, y$flush_delayed=5, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L715] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L767] EXPR 0 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=5, x=1, y=0, y$flush_delayed=5, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L767] 0 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L768] EXPR 0 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=5, x=1, y=0, y$flush_delayed=5, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L768] 0 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L771] 0 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=5, x=1, y=0, y$flush_delayed=5, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L716] EXPR 1 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=5, weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used))=0, x=1, y=0, y$flush_delayed=5, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L716] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L717] EXPR 1 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=5, weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=5, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L717] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L718] EXPR 1 weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=5, weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1))=0, x=1, y=0, y$flush_delayed=5, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L718] 1 y$r_buff0_thd1 = weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) [L719] EXPR 1 weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=5, weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=5, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L719] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L720] 1 __unbuffered_p0_EAX = y VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=5, x=1, y=0, y$flush_delayed=5, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L721] EXPR 1 y$flush_delayed ? y$mem_tmp : y VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=5, x=1, y=0, y$flush_delayed=5, y$flush_delayed ? y$mem_tmp : y=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L721] 1 y = y$flush_delayed ? y$mem_tmp : y [L722] 1 y$flush_delayed = (_Bool)0 [L727] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=5, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L791] -1 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=5, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L795] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=5, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L795] EXPR -1 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=5, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L795] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=5, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L795] -1 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L796] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=5, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L796] -1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L797] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=5, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L797] -1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L798] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=5, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L798] -1 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L799] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=5, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L799] -1 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L802] -1 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=5, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L5] COND TRUE -1 !expression VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=5, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L5] -1 __VERIFIER_error() VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=5, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 283 locations, 3 error locations. UNSAFE Result, 156.0s OverallTime, 29 OverallIterations, 1 TraceHistogramMax, 50.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 10270 SDtfs, 12241 SDslu, 25259 SDs, 0 SdLazy, 10067 SolverSat, 615 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 16.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 283 GetRequests, 70 SyntacticMatches, 27 SemanticMatches, 186 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 185 ImplicationChecksByTransitivity, 6.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=229832occurred in iteration=7, 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: 88.2s AutomataMinimizationTime, 28 MinimizatonAttempts, 511276 StatesRemovedByMinimization, 28 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 6.6s InterpolantComputationTime, 2220 NumberOfCodeBlocks, 2220 NumberOfCodeBlocksAsserted, 29 NumberOfCheckSat, 2090 ConstructedInterpolants, 0 QuantifiedInterpolants, 435891 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 28 InterpolantComputations, 28 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...