./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/pthread-wmm/mix000_pso.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/mix000_pso.opt_false-unreach-call.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash d7c66515d7f12ab40c889c3da9f41e1770d513a3 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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-12 22:27:57,533 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-12 22:27:57,535 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-12 22:27:57,550 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-12 22:27:57,550 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-12 22:27:57,551 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-12 22:27:57,553 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-12 22:27:57,555 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-12 22:27:57,557 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-12 22:27:57,557 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-12 22:27:57,559 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-12 22:27:57,559 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-12 22:27:57,560 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-12 22:27:57,561 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-12 22:27:57,562 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-12 22:27:57,563 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-12 22:27:57,564 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-12 22:27:57,566 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-12 22:27:57,568 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-12 22:27:57,570 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-12 22:27:57,571 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-12 22:27:57,572 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-12 22:27:57,575 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-12 22:27:57,575 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-12 22:27:57,575 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-12 22:27:57,576 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-12 22:27:57,577 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-12 22:27:57,579 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-12 22:27:57,579 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-12 22:27:57,580 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-12 22:27:57,581 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-12 22:27:57,582 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-12 22:27:57,582 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-12 22:27:57,582 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-12 22:27:57,583 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-12 22:27:57,584 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-12 22:27:57,584 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-01-12 22:27:57,598 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-12 22:27:57,599 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-12 22:27:57,600 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-12 22:27:57,600 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-12 22:27:57,600 INFO L133 SettingsManager]: * Use SBE=true [2019-01-12 22:27:57,601 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-12 22:27:57,601 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-12 22:27:57,601 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-12 22:27:57,601 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-12 22:27:57,601 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-12 22:27:57,602 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-12 22:27:57,602 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-12 22:27:57,602 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-12 22:27:57,602 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-12 22:27:57,602 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-12 22:27:57,602 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-12 22:27:57,602 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-12 22:27:57,604 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-12 22:27:57,604 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-12 22:27:57,604 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-12 22:27:57,605 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-12 22:27:57,605 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-12 22:27:57,605 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-12 22:27:57,606 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-12 22:27:57,606 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-12 22:27:57,606 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-12 22:27:57,606 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-12 22:27:57,607 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-12 22:27:57,607 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 -> d7c66515d7f12ab40c889c3da9f41e1770d513a3 [2019-01-12 22:27:57,641 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-12 22:27:57,653 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-12 22:27:57,656 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-12 22:27:57,658 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-12 22:27:57,658 INFO L276 PluginConnector]: CDTParser initialized [2019-01-12 22:27:57,659 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/pthread-wmm/mix000_pso.opt_false-unreach-call.i [2019-01-12 22:27:57,711 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ce4104280/0fcd37fa8ae4448e99f0923a6ee6acc8/FLAG0f9589bb3 [2019-01-12 22:27:58,236 INFO L307 CDTParser]: Found 1 translation units. [2019-01-12 22:27:58,238 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/pthread-wmm/mix000_pso.opt_false-unreach-call.i [2019-01-12 22:27:58,259 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ce4104280/0fcd37fa8ae4448e99f0923a6ee6acc8/FLAG0f9589bb3 [2019-01-12 22:27:58,464 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ce4104280/0fcd37fa8ae4448e99f0923a6ee6acc8 [2019-01-12 22:27:58,467 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-12 22:27:58,468 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-12 22:27:58,469 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-12 22:27:58,469 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-12 22:27:58,473 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-12 22:27:58,474 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 10:27:58" (1/1) ... [2019-01-12 22:27:58,477 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@13568bae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 10:27:58, skipping insertion in model container [2019-01-12 22:27:58,477 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 10:27:58" (1/1) ... [2019-01-12 22:27:58,487 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-12 22:27:58,555 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-12 22:27:58,989 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 22:27:59,010 INFO L191 MainTranslator]: Completed pre-run [2019-01-12 22:27:59,168 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 22:27:59,248 INFO L195 MainTranslator]: Completed translation [2019-01-12 22:27:59,248 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 10:27:59 WrapperNode [2019-01-12 22:27:59,249 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-12 22:27:59,250 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-12 22:27:59,250 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-12 22:27:59,250 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-12 22:27:59,260 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 10:27:59" (1/1) ... [2019-01-12 22:27:59,288 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 10:27:59" (1/1) ... [2019-01-12 22:27:59,329 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-12 22:27:59,330 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-12 22:27:59,330 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-12 22:27:59,330 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-12 22:27:59,340 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 10:27:59" (1/1) ... [2019-01-12 22:27:59,340 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 10:27:59" (1/1) ... [2019-01-12 22:27:59,346 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 10:27:59" (1/1) ... [2019-01-12 22:27:59,346 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 10:27:59" (1/1) ... [2019-01-12 22:27:59,357 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 10:27:59" (1/1) ... [2019-01-12 22:27:59,362 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 10:27:59" (1/1) ... [2019-01-12 22:27:59,366 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 10:27:59" (1/1) ... [2019-01-12 22:27:59,371 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-12 22:27:59,372 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-12 22:27:59,372 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-12 22:27:59,372 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-12 22:27:59,373 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 10:27:59" (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-12 22:27:59,458 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-12 22:27:59,460 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-01-12 22:27:59,461 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-12 22:27:59,461 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-12 22:27:59,461 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-01-12 22:27:59,461 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-01-12 22:27:59,462 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-01-12 22:27:59,462 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-01-12 22:27:59,462 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-01-12 22:27:59,462 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-12 22:27:59,462 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-12 22:27:59,466 WARN L204 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-01-12 22:28:00,897 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-12 22:28:00,897 INFO L286 CfgBuilder]: Removed 8 assue(true) statements. [2019-01-12 22:28:00,898 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 10:28:00 BoogieIcfgContainer [2019-01-12 22:28:00,899 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-12 22:28:00,900 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-12 22:28:00,900 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-12 22:28:00,903 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-12 22:28:00,903 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.01 10:27:58" (1/3) ... [2019-01-12 22:28:00,904 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d2c6e39 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 10:28:00, skipping insertion in model container [2019-01-12 22:28:00,904 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 10:27:59" (2/3) ... [2019-01-12 22:28:00,905 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d2c6e39 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 10:28:00, skipping insertion in model container [2019-01-12 22:28:00,905 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 10:28:00" (3/3) ... [2019-01-12 22:28:00,907 INFO L112 eAbstractionObserver]: Analyzing ICFG mix000_pso.opt_false-unreach-call.i [2019-01-12 22:28:00,962 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:00,962 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:00,963 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:00,963 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:00,964 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:00,964 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:00,964 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:00,965 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:00,965 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:00,966 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:00,966 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:00,966 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:00,966 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:00,966 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:00,967 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:00,967 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:00,967 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:00,967 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:00,968 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:00,968 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:00,968 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:00,968 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:00,969 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:00,969 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:00,969 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:00,969 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:00,970 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:00,971 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:00,971 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:00,971 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:00,971 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:00,972 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:00,972 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:00,972 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:00,972 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:00,973 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:00,973 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:00,974 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:00,974 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:00,974 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:00,974 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:00,974 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:00,975 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:00,975 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:00,976 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:00,976 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:00,976 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:00,976 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:00,976 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:00,977 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:00,978 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:00,978 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:00,978 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:00,979 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:00,979 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:00,979 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:00,980 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:00,980 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:00,980 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:00,980 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:00,980 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:00,981 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:00,981 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:00,982 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:00,982 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:00,982 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:00,982 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:00,982 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:00,982 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:00,983 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:00,983 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:00,983 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:00,983 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:00,984 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:00,984 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:00,984 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:00,984 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:00,984 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:00,984 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:00,985 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:00,985 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:00,985 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:00,985 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:00,986 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:00,986 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:00,986 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:00,986 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:00,986 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:00,989 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:00,989 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:00,989 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:00,990 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:00,990 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet26.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:00,990 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet26.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:00,990 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:00,990 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:00,991 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet26.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:00,991 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet26.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:00,993 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:00,994 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:00,994 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:00,995 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:00,995 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:00,995 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:00,995 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:00,996 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:00,998 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:00,998 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:00,998 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:00,998 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:00,999 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:00,999 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:00,999 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:01,000 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:01,001 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:01,001 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:01,001 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:01,001 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:01,002 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:01,002 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:01,002 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:01,002 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:01,002 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:01,002 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:01,003 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:01,004 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:01,004 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:01,004 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:01,004 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:01,004 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:01,005 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:01,005 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:01,005 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:01,005 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:01,005 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:01,006 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:01,006 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:01,006 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:01,006 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:01,006 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:01,007 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:01,007 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:01,007 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:01,007 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:01,007 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:01,007 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:01,008 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:01,008 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:01,008 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:01,008 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:01,008 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:01,009 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:01,009 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:01,009 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:01,009 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:01,009 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:01,010 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:01,010 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:01,010 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:01,010 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:01,010 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:01,011 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:01,011 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:01,011 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:01,011 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:01,011 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:01,012 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:01,012 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:01,012 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:01,012 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:01,012 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:01,012 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:01,013 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:01,013 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:01,013 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:01,013 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:01,013 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:01,014 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:01,014 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:01,014 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:01,014 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:01,014 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:01,015 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:01,018 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:01,018 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:01,018 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:01,018 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:01,019 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:01,019 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:01,019 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:01,019 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:01,019 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:01,019 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:01,020 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:01,020 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:01,020 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:01,020 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:01,020 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:01,021 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:01,022 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:01,023 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:01,023 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:01,023 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:01,023 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:01,023 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:01,024 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:01,024 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:01,024 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:01,024 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:01,024 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:01,024 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:01,025 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:01,025 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:01,025 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:01,025 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:01,025 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:01,026 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:01,026 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:01,026 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet56.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:01,026 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet56.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:01,026 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:01,026 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:01,027 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet56.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:01,027 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet56.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:01,049 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-01-12 22:28:01,050 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-12 22:28:01,064 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2019-01-12 22:28:01,083 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2019-01-12 22:28:01,108 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-12 22:28:01,108 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-12 22:28:01,109 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-12 22:28:01,109 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-12 22:28:01,109 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-12 22:28:01,109 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-12 22:28:01,109 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-12 22:28:01,109 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-12 22:28:01,110 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-12 22:28:01,125 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 174places, 227 transitions [2019-01-12 22:28:08,886 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 83128 states. [2019-01-12 22:28:08,888 INFO L276 IsEmpty]: Start isEmpty. Operand 83128 states. [2019-01-12 22:28:08,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-01-12 22:28:08,900 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 22:28:08,901 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] [2019-01-12 22:28:08,902 INFO L423 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 22:28:08,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 22:28:08,910 INFO L82 PathProgramCache]: Analyzing trace with hash 164866570, now seen corresponding path program 1 times [2019-01-12 22:28:08,917 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 22:28:08,920 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 22:28:08,986 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:28:08,986 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 22:28:08,986 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:28:09,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 22:28:09,284 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-12 22:28:09,287 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 22:28:09,288 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 22:28:09,292 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 22:28:09,306 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 22:28:09,306 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-12 22:28:09,308 INFO L87 Difference]: Start difference. First operand 83128 states. Second operand 4 states. [2019-01-12 22:28:11,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 22:28:11,397 INFO L93 Difference]: Finished difference Result 150584 states and 603161 transitions. [2019-01-12 22:28:11,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 22:28:11,400 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 39 [2019-01-12 22:28:11,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 22:28:12,157 INFO L225 Difference]: With dead ends: 150584 [2019-01-12 22:28:12,157 INFO L226 Difference]: Without dead ends: 105840 [2019-01-12 22:28:12,159 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-12 22:28:14,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105840 states. [2019-01-12 22:28:15,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105840 to 61236. [2019-01-12 22:28:15,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61236 states. [2019-01-12 22:28:16,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61236 states to 61236 states and 248291 transitions. [2019-01-12 22:28:16,929 INFO L78 Accepts]: Start accepts. Automaton has 61236 states and 248291 transitions. Word has length 39 [2019-01-12 22:28:16,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 22:28:16,930 INFO L480 AbstractCegarLoop]: Abstraction has 61236 states and 248291 transitions. [2019-01-12 22:28:16,930 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 22:28:16,930 INFO L276 IsEmpty]: Start isEmpty. Operand 61236 states and 248291 transitions. [2019-01-12 22:28:16,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-01-12 22:28:16,942 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 22:28:16,942 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-12 22:28:16,942 INFO L423 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 22:28:16,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 22:28:16,943 INFO L82 PathProgramCache]: Analyzing trace with hash 1121119524, now seen corresponding path program 1 times [2019-01-12 22:28:16,943 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 22:28:16,943 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 22:28:16,950 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:28:16,950 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 22:28:16,950 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:28:16,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 22:28:17,150 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-12 22:28:17,150 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 22:28:17,151 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-12 22:28:17,152 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 22:28:17,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 22:28:17,156 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-12 22:28:17,156 INFO L87 Difference]: Start difference. First operand 61236 states and 248291 transitions. Second operand 5 states. [2019-01-12 22:28:19,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 22:28:19,878 INFO L93 Difference]: Finished difference Result 146040 states and 554301 transitions. [2019-01-12 22:28:19,879 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-12 22:28:19,879 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 47 [2019-01-12 22:28:19,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 22:28:20,678 INFO L225 Difference]: With dead ends: 146040 [2019-01-12 22:28:20,678 INFO L226 Difference]: Without dead ends: 145472 [2019-01-12 22:28:20,679 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-12 22:28:27,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145472 states. [2019-01-12 22:28:29,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145472 to 96614. [2019-01-12 22:28:29,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96614 states. [2019-01-12 22:28:29,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96614 states to 96614 states and 368456 transitions. [2019-01-12 22:28:29,315 INFO L78 Accepts]: Start accepts. Automaton has 96614 states and 368456 transitions. Word has length 47 [2019-01-12 22:28:29,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 22:28:29,316 INFO L480 AbstractCegarLoop]: Abstraction has 96614 states and 368456 transitions. [2019-01-12 22:28:29,316 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 22:28:29,316 INFO L276 IsEmpty]: Start isEmpty. Operand 96614 states and 368456 transitions. [2019-01-12 22:28:29,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-01-12 22:28:29,321 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 22:28:29,321 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] [2019-01-12 22:28:29,322 INFO L423 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 22:28:29,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 22:28:29,323 INFO L82 PathProgramCache]: Analyzing trace with hash -1095203171, now seen corresponding path program 1 times [2019-01-12 22:28:29,323 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 22:28:29,323 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 22:28:29,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:28:29,329 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 22:28:29,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:28:29,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 22:28:29,462 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-12 22:28:29,462 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 22:28:29,463 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-12 22:28:29,463 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 22:28:29,463 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 22:28:29,463 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-12 22:28:29,464 INFO L87 Difference]: Start difference. First operand 96614 states and 368456 transitions. Second operand 5 states. [2019-01-12 22:28:32,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 22:28:32,051 INFO L93 Difference]: Finished difference Result 199270 states and 748090 transitions. [2019-01-12 22:28:32,052 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-12 22:28:32,052 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 48 [2019-01-12 22:28:32,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 22:28:32,662 INFO L225 Difference]: With dead ends: 199270 [2019-01-12 22:28:32,662 INFO L226 Difference]: Without dead ends: 198806 [2019-01-12 22:28:32,663 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-12 22:28:34,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198806 states. [2019-01-12 22:28:37,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198806 to 108297. [2019-01-12 22:28:37,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108297 states. [2019-01-12 22:28:37,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108297 states to 108297 states and 408660 transitions. [2019-01-12 22:28:37,749 INFO L78 Accepts]: Start accepts. Automaton has 108297 states and 408660 transitions. Word has length 48 [2019-01-12 22:28:37,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 22:28:37,749 INFO L480 AbstractCegarLoop]: Abstraction has 108297 states and 408660 transitions. [2019-01-12 22:28:37,749 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 22:28:37,749 INFO L276 IsEmpty]: Start isEmpty. Operand 108297 states and 408660 transitions. [2019-01-12 22:28:37,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-01-12 22:28:37,761 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 22:28:37,761 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] [2019-01-12 22:28:37,761 INFO L423 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 22:28:37,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 22:28:37,762 INFO L82 PathProgramCache]: Analyzing trace with hash 659319747, now seen corresponding path program 1 times [2019-01-12 22:28:37,762 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 22:28:37,762 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 22:28:37,767 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:28:37,767 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 22:28:37,767 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:28:37,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 22:28:37,887 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-12 22:28:37,887 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 22:28:37,887 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 22:28:37,888 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 22:28:37,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 22:28:37,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 22:28:37,888 INFO L87 Difference]: Start difference. First operand 108297 states and 408660 transitions. Second operand 3 states. [2019-01-12 22:28:38,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 22:28:38,725 INFO L93 Difference]: Finished difference Result 179116 states and 655175 transitions. [2019-01-12 22:28:38,725 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 22:28:38,726 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2019-01-12 22:28:38,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 22:28:39,177 INFO L225 Difference]: With dead ends: 179116 [2019-01-12 22:28:39,178 INFO L226 Difference]: Without dead ends: 179116 [2019-01-12 22:28:39,178 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-12 22:28:46,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179116 states. [2019-01-12 22:28:48,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179116 to 163647. [2019-01-12 22:28:48,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163647 states. [2019-01-12 22:28:49,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163647 states to 163647 states and 603626 transitions. [2019-01-12 22:28:49,549 INFO L78 Accepts]: Start accepts. Automaton has 163647 states and 603626 transitions. Word has length 50 [2019-01-12 22:28:49,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 22:28:49,550 INFO L480 AbstractCegarLoop]: Abstraction has 163647 states and 603626 transitions. [2019-01-12 22:28:49,550 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 22:28:49,550 INFO L276 IsEmpty]: Start isEmpty. Operand 163647 states and 603626 transitions. [2019-01-12 22:28:49,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-01-12 22:28:49,576 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 22:28:49,576 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-12 22:28:49,577 INFO L423 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 22:28:49,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 22:28:49,577 INFO L82 PathProgramCache]: Analyzing trace with hash 669168142, now seen corresponding path program 1 times [2019-01-12 22:28:49,577 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 22:28:49,577 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 22:28:49,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:28:49,581 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 22:28:49,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:28:49,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 22:28:49,706 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-12 22:28:49,706 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 22:28:49,706 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-12 22:28:49,706 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-12 22:28:49,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-12 22:28:49,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-01-12 22:28:49,707 INFO L87 Difference]: Start difference. First operand 163647 states and 603626 transitions. Second operand 6 states. [2019-01-12 22:28:52,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 22:28:52,437 INFO L93 Difference]: Finished difference Result 315524 states and 1139599 transitions. [2019-01-12 22:28:52,438 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-01-12 22:28:52,438 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 54 [2019-01-12 22:28:52,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 22:28:53,234 INFO L225 Difference]: With dead ends: 315524 [2019-01-12 22:28:53,234 INFO L226 Difference]: Without dead ends: 314988 [2019-01-12 22:28:53,235 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2019-01-12 22:28:55,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314988 states. [2019-01-12 22:29:00,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314988 to 164410. [2019-01-12 22:29:00,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164410 states. [2019-01-12 22:29:00,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164410 states to 164410 states and 606497 transitions. [2019-01-12 22:29:00,704 INFO L78 Accepts]: Start accepts. Automaton has 164410 states and 606497 transitions. Word has length 54 [2019-01-12 22:29:00,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 22:29:00,705 INFO L480 AbstractCegarLoop]: Abstraction has 164410 states and 606497 transitions. [2019-01-12 22:29:00,705 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-12 22:29:00,705 INFO L276 IsEmpty]: Start isEmpty. Operand 164410 states and 606497 transitions. [2019-01-12 22:29:00,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-01-12 22:29:00,724 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 22:29:00,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, 1] [2019-01-12 22:29:00,724 INFO L423 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 22:29:00,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 22:29:00,725 INFO L82 PathProgramCache]: Analyzing trace with hash -842462784, now seen corresponding path program 1 times [2019-01-12 22:29:00,726 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 22:29:00,726 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 22:29:00,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:29:00,728 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 22:29:00,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:29:00,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 22:29:01,124 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-12 22:29:01,125 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 22:29:01,125 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-12 22:29:01,125 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-12 22:29:01,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-12 22:29:01,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-01-12 22:29:01,126 INFO L87 Difference]: Start difference. First operand 164410 states and 606497 transitions. Second operand 6 states. [2019-01-12 22:29:04,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 22:29:04,661 INFO L93 Difference]: Finished difference Result 215867 states and 792771 transitions. [2019-01-12 22:29:04,661 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-12 22:29:04,661 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 54 [2019-01-12 22:29:04,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 22:29:05,223 INFO L225 Difference]: With dead ends: 215867 [2019-01-12 22:29:05,223 INFO L226 Difference]: Without dead ends: 215867 [2019-01-12 22:29:05,223 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-01-12 22:29:07,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215867 states. [2019-01-12 22:29:16,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215867 to 201216. [2019-01-12 22:29:16,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201216 states. [2019-01-12 22:29:17,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201216 states to 201216 states and 739038 transitions. [2019-01-12 22:29:17,070 INFO L78 Accepts]: Start accepts. Automaton has 201216 states and 739038 transitions. Word has length 54 [2019-01-12 22:29:17,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 22:29:17,070 INFO L480 AbstractCegarLoop]: Abstraction has 201216 states and 739038 transitions. [2019-01-12 22:29:17,071 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-12 22:29:17,071 INFO L276 IsEmpty]: Start isEmpty. Operand 201216 states and 739038 transitions. [2019-01-12 22:29:17,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-01-12 22:29:17,093 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 22:29:17,094 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-12 22:29:17,094 INFO L423 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 22:29:17,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 22:29:17,094 INFO L82 PathProgramCache]: Analyzing trace with hash 1655553153, now seen corresponding path program 1 times [2019-01-12 22:29:17,094 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 22:29:17,095 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 22:29:17,097 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:29:17,097 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 22:29:17,097 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:29:17,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 22:29:17,247 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-12 22:29:17,247 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 22:29:17,247 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 22:29:17,248 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 22:29:17,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 22:29:17,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-12 22:29:17,248 INFO L87 Difference]: Start difference. First operand 201216 states and 739038 transitions. Second operand 4 states. [2019-01-12 22:29:17,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 22:29:17,476 INFO L93 Difference]: Finished difference Result 38680 states and 122685 transitions. [2019-01-12 22:29:17,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-12 22:29:17,478 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 54 [2019-01-12 22:29:17,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 22:29:17,560 INFO L225 Difference]: With dead ends: 38680 [2019-01-12 22:29:17,560 INFO L226 Difference]: Without dead ends: 32084 [2019-01-12 22:29:17,561 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-12 22:29:17,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32084 states. [2019-01-12 22:29:17,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32084 to 31837. [2019-01-12 22:29:17,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31837 states. [2019-01-12 22:29:18,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31837 states to 31837 states and 99516 transitions. [2019-01-12 22:29:18,042 INFO L78 Accepts]: Start accepts. Automaton has 31837 states and 99516 transitions. Word has length 54 [2019-01-12 22:29:18,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 22:29:18,042 INFO L480 AbstractCegarLoop]: Abstraction has 31837 states and 99516 transitions. [2019-01-12 22:29:18,042 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 22:29:18,042 INFO L276 IsEmpty]: Start isEmpty. Operand 31837 states and 99516 transitions. [2019-01-12 22:29:18,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-01-12 22:29:18,050 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 22:29:18,050 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] [2019-01-12 22:29:18,050 INFO L423 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 22:29:18,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 22:29:18,051 INFO L82 PathProgramCache]: Analyzing trace with hash -494140957, now seen corresponding path program 1 times [2019-01-12 22:29:18,051 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 22:29:18,051 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 22:29:18,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:29:18,053 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 22:29:18,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:29:18,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 22:29:18,261 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-12 22:29:18,262 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 22:29:18,262 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 22:29:18,262 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 22:29:18,262 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 22:29:18,263 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-12 22:29:18,263 INFO L87 Difference]: Start difference. First operand 31837 states and 99516 transitions. Second operand 4 states. [2019-01-12 22:29:18,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 22:29:18,723 INFO L93 Difference]: Finished difference Result 41209 states and 129950 transitions. [2019-01-12 22:29:18,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-12 22:29:18,724 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 64 [2019-01-12 22:29:18,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 22:29:18,793 INFO L225 Difference]: With dead ends: 41209 [2019-01-12 22:29:18,793 INFO L226 Difference]: Without dead ends: 41209 [2019-01-12 22:29:18,794 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-12 22:29:18,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41209 states. [2019-01-12 22:29:20,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41209 to 35933. [2019-01-12 22:29:20,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35933 states. [2019-01-12 22:29:20,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35933 states to 35933 states and 112645 transitions. [2019-01-12 22:29:20,637 INFO L78 Accepts]: Start accepts. Automaton has 35933 states and 112645 transitions. Word has length 64 [2019-01-12 22:29:20,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 22:29:20,638 INFO L480 AbstractCegarLoop]: Abstraction has 35933 states and 112645 transitions. [2019-01-12 22:29:20,638 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 22:29:20,638 INFO L276 IsEmpty]: Start isEmpty. Operand 35933 states and 112645 transitions. [2019-01-12 22:29:20,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-01-12 22:29:20,647 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 22:29:20,647 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] [2019-01-12 22:29:20,647 INFO L423 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 22:29:20,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 22:29:20,647 INFO L82 PathProgramCache]: Analyzing trace with hash 1248669378, now seen corresponding path program 1 times [2019-01-12 22:29:20,647 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 22:29:20,648 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 22:29:20,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:29:20,650 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 22:29:20,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:29:20,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 22:29:20,997 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-12 22:29:20,998 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 22:29:20,998 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-12 22:29:20,998 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-12 22:29:20,998 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-12 22:29:20,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-01-12 22:29:20,999 INFO L87 Difference]: Start difference. First operand 35933 states and 112645 transitions. Second operand 6 states. [2019-01-12 22:29:22,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 22:29:22,183 INFO L93 Difference]: Finished difference Result 72510 states and 225561 transitions. [2019-01-12 22:29:22,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-01-12 22:29:22,184 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 64 [2019-01-12 22:29:22,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 22:29:22,322 INFO L225 Difference]: With dead ends: 72510 [2019-01-12 22:29:22,322 INFO L226 Difference]: Without dead ends: 72446 [2019-01-12 22:29:22,322 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2019-01-12 22:29:22,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72446 states. [2019-01-12 22:29:23,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72446 to 40893. [2019-01-12 22:29:23,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40893 states. [2019-01-12 22:29:23,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40893 states to 40893 states and 126623 transitions. [2019-01-12 22:29:23,103 INFO L78 Accepts]: Start accepts. Automaton has 40893 states and 126623 transitions. Word has length 64 [2019-01-12 22:29:23,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 22:29:23,103 INFO L480 AbstractCegarLoop]: Abstraction has 40893 states and 126623 transitions. [2019-01-12 22:29:23,103 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-12 22:29:23,103 INFO L276 IsEmpty]: Start isEmpty. Operand 40893 states and 126623 transitions. [2019-01-12 22:29:23,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-01-12 22:29:23,119 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 22:29:23,119 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] [2019-01-12 22:29:23,119 INFO L423 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 22:29:23,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 22:29:23,119 INFO L82 PathProgramCache]: Analyzing trace with hash 1121736755, now seen corresponding path program 1 times [2019-01-12 22:29:23,120 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 22:29:23,120 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 22:29:23,121 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:29:23,122 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 22:29:23,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:29:23,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 22:29:23,203 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-12 22:29:23,203 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 22:29:23,203 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 22:29:23,203 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 22:29:23,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 22:29:23,204 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 22:29:23,204 INFO L87 Difference]: Start difference. First operand 40893 states and 126623 transitions. Second operand 3 states. [2019-01-12 22:29:23,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 22:29:23,577 INFO L93 Difference]: Finished difference Result 46898 states and 143100 transitions. [2019-01-12 22:29:23,577 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 22:29:23,578 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 70 [2019-01-12 22:29:23,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 22:29:23,646 INFO L225 Difference]: With dead ends: 46898 [2019-01-12 22:29:23,646 INFO L226 Difference]: Without dead ends: 46898 [2019-01-12 22:29:23,646 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-12 22:29:23,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46898 states. [2019-01-12 22:29:24,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46898 to 40581. [2019-01-12 22:29:24,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40581 states. [2019-01-12 22:29:24,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40581 states to 40581 states and 123025 transitions. [2019-01-12 22:29:24,235 INFO L78 Accepts]: Start accepts. Automaton has 40581 states and 123025 transitions. Word has length 70 [2019-01-12 22:29:24,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 22:29:24,236 INFO L480 AbstractCegarLoop]: Abstraction has 40581 states and 123025 transitions. [2019-01-12 22:29:24,236 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 22:29:24,236 INFO L276 IsEmpty]: Start isEmpty. Operand 40581 states and 123025 transitions. [2019-01-12 22:29:24,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-01-12 22:29:24,252 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 22:29:24,252 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-12 22:29:24,252 INFO L423 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 22:29:24,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 22:29:24,252 INFO L82 PathProgramCache]: Analyzing trace with hash 1638307191, now seen corresponding path program 1 times [2019-01-12 22:29:24,253 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 22:29:24,253 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 22:29:24,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:29:24,254 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 22:29:24,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:29:24,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 22:29:24,659 WARN L181 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 10 [2019-01-12 22:29:24,677 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-12 22:29:24,678 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 22:29:24,678 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-12 22:29:24,678 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-12 22:29:24,678 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-12 22:29:24,678 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-01-12 22:29:24,679 INFO L87 Difference]: Start difference. First operand 40581 states and 123025 transitions. Second operand 6 states. [2019-01-12 22:29:25,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 22:29:25,918 INFO L93 Difference]: Finished difference Result 50181 states and 152193 transitions. [2019-01-12 22:29:25,918 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-12 22:29:25,918 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 71 [2019-01-12 22:29:25,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 22:29:25,997 INFO L225 Difference]: With dead ends: 50181 [2019-01-12 22:29:25,997 INFO L226 Difference]: Without dead ends: 49877 [2019-01-12 22:29:25,997 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2019-01-12 22:29:26,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49877 states. [2019-01-12 22:29:27,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49877 to 45421. [2019-01-12 22:29:27,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45421 states. [2019-01-12 22:29:27,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45421 states to 45421 states and 138099 transitions. [2019-01-12 22:29:27,727 INFO L78 Accepts]: Start accepts. Automaton has 45421 states and 138099 transitions. Word has length 71 [2019-01-12 22:29:27,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 22:29:27,727 INFO L480 AbstractCegarLoop]: Abstraction has 45421 states and 138099 transitions. [2019-01-12 22:29:27,727 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-12 22:29:27,727 INFO L276 IsEmpty]: Start isEmpty. Operand 45421 states and 138099 transitions. [2019-01-12 22:29:27,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-01-12 22:29:27,742 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 22:29:27,742 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-12 22:29:27,743 INFO L423 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 22:29:27,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 22:29:27,743 INFO L82 PathProgramCache]: Analyzing trace with hash -158644168, now seen corresponding path program 1 times [2019-01-12 22:29:27,743 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 22:29:27,743 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 22:29:27,745 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:29:27,745 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 22:29:27,745 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:29:27,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 22:29:27,937 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-12 22:29:27,937 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 22:29:27,937 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-12 22:29:27,937 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 22:29:27,938 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 22:29:27,938 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-01-12 22:29:27,938 INFO L87 Difference]: Start difference. First operand 45421 states and 138099 transitions. Second operand 5 states. [2019-01-12 22:29:28,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 22:29:28,016 INFO L93 Difference]: Finished difference Result 12413 states and 31271 transitions. [2019-01-12 22:29:28,017 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-12 22:29:28,017 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 71 [2019-01-12 22:29:28,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 22:29:28,029 INFO L225 Difference]: With dead ends: 12413 [2019-01-12 22:29:28,029 INFO L226 Difference]: Without dead ends: 10477 [2019-01-12 22:29:28,030 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-01-12 22:29:28,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10477 states. [2019-01-12 22:29:28,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10477 to 8356. [2019-01-12 22:29:28,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8356 states. [2019-01-12 22:29:28,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8356 states to 8356 states and 20870 transitions. [2019-01-12 22:29:28,135 INFO L78 Accepts]: Start accepts. Automaton has 8356 states and 20870 transitions. Word has length 71 [2019-01-12 22:29:28,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 22:29:28,135 INFO L480 AbstractCegarLoop]: Abstraction has 8356 states and 20870 transitions. [2019-01-12 22:29:28,135 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 22:29:28,135 INFO L276 IsEmpty]: Start isEmpty. Operand 8356 states and 20870 transitions. [2019-01-12 22:29:28,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-01-12 22:29:28,143 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 22:29:28,144 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] [2019-01-12 22:29:28,144 INFO L423 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 22:29:28,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 22:29:28,144 INFO L82 PathProgramCache]: Analyzing trace with hash -1659897239, now seen corresponding path program 1 times [2019-01-12 22:29:28,144 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 22:29:28,145 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 22:29:28,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:29:28,146 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 22:29:28,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:29:28,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 22:29:28,310 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-12 22:29:28,310 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 22:29:28,310 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 22:29:28,310 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 22:29:28,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 22:29:28,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-12 22:29:28,311 INFO L87 Difference]: Start difference. First operand 8356 states and 20870 transitions. Second operand 4 states. [2019-01-12 22:29:28,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 22:29:28,601 INFO L93 Difference]: Finished difference Result 9771 states and 23994 transitions. [2019-01-12 22:29:28,602 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 22:29:28,602 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 99 [2019-01-12 22:29:28,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 22:29:28,615 INFO L225 Difference]: With dead ends: 9771 [2019-01-12 22:29:28,616 INFO L226 Difference]: Without dead ends: 9771 [2019-01-12 22:29:28,616 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-12 22:29:28,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9771 states. [2019-01-12 22:29:28,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9771 to 9252. [2019-01-12 22:29:28,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9252 states. [2019-01-12 22:29:28,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9252 states to 9252 states and 22837 transitions. [2019-01-12 22:29:28,716 INFO L78 Accepts]: Start accepts. Automaton has 9252 states and 22837 transitions. Word has length 99 [2019-01-12 22:29:28,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 22:29:28,716 INFO L480 AbstractCegarLoop]: Abstraction has 9252 states and 22837 transitions. [2019-01-12 22:29:28,717 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 22:29:28,717 INFO L276 IsEmpty]: Start isEmpty. Operand 9252 states and 22837 transitions. [2019-01-12 22:29:28,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-01-12 22:29:28,726 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 22:29:28,726 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] [2019-01-12 22:29:28,726 INFO L423 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 22:29:28,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 22:29:28,727 INFO L82 PathProgramCache]: Analyzing trace with hash 624966216, now seen corresponding path program 1 times [2019-01-12 22:29:28,727 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 22:29:28,727 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 22:29:28,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:29:28,728 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 22:29:28,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:29:28,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 22:29:28,855 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-12 22:29:28,855 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 22:29:28,855 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 22:29:28,856 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 22:29:28,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 22:29:28,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 22:29:28,856 INFO L87 Difference]: Start difference. First operand 9252 states and 22837 transitions. Second operand 3 states. [2019-01-12 22:29:29,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 22:29:29,469 INFO L93 Difference]: Finished difference Result 12503 states and 30346 transitions. [2019-01-12 22:29:29,470 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 22:29:29,470 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 99 [2019-01-12 22:29:29,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 22:29:29,484 INFO L225 Difference]: With dead ends: 12503 [2019-01-12 22:29:29,485 INFO L226 Difference]: Without dead ends: 12503 [2019-01-12 22:29:29,485 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-12 22:29:29,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12503 states. [2019-01-12 22:29:29,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12503 to 11332. [2019-01-12 22:29:29,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11332 states. [2019-01-12 22:29:29,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11332 states to 11332 states and 27737 transitions. [2019-01-12 22:29:29,618 INFO L78 Accepts]: Start accepts. Automaton has 11332 states and 27737 transitions. Word has length 99 [2019-01-12 22:29:29,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 22:29:29,618 INFO L480 AbstractCegarLoop]: Abstraction has 11332 states and 27737 transitions. [2019-01-12 22:29:29,618 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 22:29:29,618 INFO L276 IsEmpty]: Start isEmpty. Operand 11332 states and 27737 transitions. [2019-01-12 22:29:29,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-01-12 22:29:29,630 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 22:29:29,631 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] [2019-01-12 22:29:29,631 INFO L423 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 22:29:29,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 22:29:29,631 INFO L82 PathProgramCache]: Analyzing trace with hash 547986639, now seen corresponding path program 1 times [2019-01-12 22:29:29,631 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 22:29:29,631 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 22:29:29,636 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:29:29,636 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 22:29:29,636 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:29:29,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 22:29:29,801 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 22:29:29,802 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 22:29:29,802 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-12 22:29:29,802 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 22:29:29,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 22:29:29,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-12 22:29:29,804 INFO L87 Difference]: Start difference. First operand 11332 states and 27737 transitions. Second operand 5 states. [2019-01-12 22:29:30,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 22:29:30,249 INFO L93 Difference]: Finished difference Result 13415 states and 32203 transitions. [2019-01-12 22:29:30,250 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-12 22:29:30,250 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 99 [2019-01-12 22:29:30,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 22:29:30,266 INFO L225 Difference]: With dead ends: 13415 [2019-01-12 22:29:30,266 INFO L226 Difference]: Without dead ends: 13415 [2019-01-12 22:29:30,266 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-01-12 22:29:30,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13415 states. [2019-01-12 22:29:30,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13415 to 11959. [2019-01-12 22:29:30,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11959 states. [2019-01-12 22:29:30,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11959 states to 11959 states and 29037 transitions. [2019-01-12 22:29:30,408 INFO L78 Accepts]: Start accepts. Automaton has 11959 states and 29037 transitions. Word has length 99 [2019-01-12 22:29:30,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 22:29:30,408 INFO L480 AbstractCegarLoop]: Abstraction has 11959 states and 29037 transitions. [2019-01-12 22:29:30,408 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 22:29:30,408 INFO L276 IsEmpty]: Start isEmpty. Operand 11959 states and 29037 transitions. [2019-01-12 22:29:30,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-01-12 22:29:30,425 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 22:29:30,426 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] [2019-01-12 22:29:30,426 INFO L423 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 22:29:30,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 22:29:30,426 INFO L82 PathProgramCache]: Analyzing trace with hash -974295661, now seen corresponding path program 2 times [2019-01-12 22:29:30,426 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 22:29:30,427 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 22:29:30,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:29:30,431 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 22:29:30,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:29:30,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 22:29:30,570 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-12 22:29:30,570 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 22:29:30,570 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-12 22:29:30,570 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-12 22:29:30,571 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-12 22:29:30,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-01-12 22:29:30,571 INFO L87 Difference]: Start difference. First operand 11959 states and 29037 transitions. Second operand 6 states. [2019-01-12 22:29:31,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 22:29:31,298 INFO L93 Difference]: Finished difference Result 14604 states and 34854 transitions. [2019-01-12 22:29:31,299 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-12 22:29:31,300 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 99 [2019-01-12 22:29:31,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 22:29:31,317 INFO L225 Difference]: With dead ends: 14604 [2019-01-12 22:29:31,317 INFO L226 Difference]: Without dead ends: 14604 [2019-01-12 22:29:31,318 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-01-12 22:29:31,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14604 states. [2019-01-12 22:29:31,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14604 to 11757. [2019-01-12 22:29:31,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11757 states. [2019-01-12 22:29:31,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11757 states to 11757 states and 28093 transitions. [2019-01-12 22:29:31,454 INFO L78 Accepts]: Start accepts. Automaton has 11757 states and 28093 transitions. Word has length 99 [2019-01-12 22:29:31,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 22:29:31,455 INFO L480 AbstractCegarLoop]: Abstraction has 11757 states and 28093 transitions. [2019-01-12 22:29:31,455 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-12 22:29:31,455 INFO L276 IsEmpty]: Start isEmpty. Operand 11757 states and 28093 transitions. [2019-01-12 22:29:31,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-01-12 22:29:31,465 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 22:29:31,466 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] [2019-01-12 22:29:31,466 INFO L423 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 22:29:31,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 22:29:31,466 INFO L82 PathProgramCache]: Analyzing trace with hash 1261837236, now seen corresponding path program 1 times [2019-01-12 22:29:31,466 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 22:29:31,466 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 22:29:31,468 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:29:31,468 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 22:29:31,468 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:29:31,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 22:29:31,756 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-12 22:29:31,757 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 22:29:31,757 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-12 22:29:31,757 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 22:29:31,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 22:29:31,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-12 22:29:31,758 INFO L87 Difference]: Start difference. First operand 11757 states and 28093 transitions. Second operand 5 states. [2019-01-12 22:29:32,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 22:29:32,084 INFO L93 Difference]: Finished difference Result 12580 states and 29794 transitions. [2019-01-12 22:29:32,085 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-12 22:29:32,085 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 101 [2019-01-12 22:29:32,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 22:29:32,099 INFO L225 Difference]: With dead ends: 12580 [2019-01-12 22:29:32,099 INFO L226 Difference]: Without dead ends: 12580 [2019-01-12 22:29:32,100 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-01-12 22:29:32,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12580 states. [2019-01-12 22:29:32,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12580 to 11924. [2019-01-12 22:29:32,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11924 states. [2019-01-12 22:29:32,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11924 states to 11924 states and 28450 transitions. [2019-01-12 22:29:32,233 INFO L78 Accepts]: Start accepts. Automaton has 11924 states and 28450 transitions. Word has length 101 [2019-01-12 22:29:32,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 22:29:32,233 INFO L480 AbstractCegarLoop]: Abstraction has 11924 states and 28450 transitions. [2019-01-12 22:29:32,233 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 22:29:32,233 INFO L276 IsEmpty]: Start isEmpty. Operand 11924 states and 28450 transitions. [2019-01-12 22:29:32,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-01-12 22:29:32,246 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 22:29:32,246 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] [2019-01-12 22:29:32,246 INFO L423 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 22:29:32,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 22:29:32,247 INFO L82 PathProgramCache]: Analyzing trace with hash -1958113082, now seen corresponding path program 1 times [2019-01-12 22:29:32,247 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 22:29:32,247 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 22:29:32,248 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:29:32,249 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 22:29:32,249 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:29:32,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 22:29:32,578 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-12 22:29:32,578 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 22:29:32,578 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-12 22:29:32,578 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 22:29:32,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 22:29:32,579 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-12 22:29:32,579 INFO L87 Difference]: Start difference. First operand 11924 states and 28450 transitions. Second operand 5 states. [2019-01-12 22:29:34,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 22:29:34,448 INFO L93 Difference]: Finished difference Result 14484 states and 34837 transitions. [2019-01-12 22:29:34,449 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-12 22:29:34,449 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 101 [2019-01-12 22:29:34,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 22:29:34,468 INFO L225 Difference]: With dead ends: 14484 [2019-01-12 22:29:34,468 INFO L226 Difference]: Without dead ends: 14484 [2019-01-12 22:29:34,468 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-01-12 22:29:34,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14484 states. [2019-01-12 22:29:34,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14484 to 12981. [2019-01-12 22:29:34,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12981 states. [2019-01-12 22:29:34,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12981 states to 12981 states and 31114 transitions. [2019-01-12 22:29:34,624 INFO L78 Accepts]: Start accepts. Automaton has 12981 states and 31114 transitions. Word has length 101 [2019-01-12 22:29:34,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 22:29:34,624 INFO L480 AbstractCegarLoop]: Abstraction has 12981 states and 31114 transitions. [2019-01-12 22:29:34,624 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 22:29:34,624 INFO L276 IsEmpty]: Start isEmpty. Operand 12981 states and 31114 transitions. [2019-01-12 22:29:34,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-01-12 22:29:34,637 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 22:29:34,637 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] [2019-01-12 22:29:34,637 INFO L423 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 22:29:34,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 22:29:34,638 INFO L82 PathProgramCache]: Analyzing trace with hash -232632185, now seen corresponding path program 1 times [2019-01-12 22:29:34,638 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 22:29:34,638 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 22:29:34,639 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:29:34,639 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 22:29:34,639 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:29:34,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 22:29:35,074 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-12 22:29:35,074 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 22:29:35,075 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-12 22:29:35,075 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-12 22:29:35,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-12 22:29:35,075 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-01-12 22:29:35,076 INFO L87 Difference]: Start difference. First operand 12981 states and 31114 transitions. Second operand 6 states. [2019-01-12 22:29:35,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 22:29:35,551 INFO L93 Difference]: Finished difference Result 14407 states and 34218 transitions. [2019-01-12 22:29:35,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-12 22:29:35,552 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 101 [2019-01-12 22:29:35,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 22:29:35,569 INFO L225 Difference]: With dead ends: 14407 [2019-01-12 22:29:35,569 INFO L226 Difference]: Without dead ends: 14407 [2019-01-12 22:29:35,569 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2019-01-12 22:29:35,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14407 states. [2019-01-12 22:29:35,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14407 to 12981. [2019-01-12 22:29:35,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12981 states. [2019-01-12 22:29:35,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12981 states to 12981 states and 31114 transitions. [2019-01-12 22:29:35,844 INFO L78 Accepts]: Start accepts. Automaton has 12981 states and 31114 transitions. Word has length 101 [2019-01-12 22:29:35,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 22:29:35,845 INFO L480 AbstractCegarLoop]: Abstraction has 12981 states and 31114 transitions. [2019-01-12 22:29:35,845 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-12 22:29:35,845 INFO L276 IsEmpty]: Start isEmpty. Operand 12981 states and 31114 transitions. [2019-01-12 22:29:35,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-01-12 22:29:35,858 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 22:29:35,858 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] [2019-01-12 22:29:35,858 INFO L423 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 22:29:35,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 22:29:35,859 INFO L82 PathProgramCache]: Analyzing trace with hash -661382321, now seen corresponding path program 1 times [2019-01-12 22:29:35,859 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 22:29:35,859 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 22:29:35,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:29:35,860 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 22:29:35,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:29:35,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 22:29:36,028 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-12 22:29:36,028 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 22:29:36,028 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-01-12 22:29:36,029 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-12 22:29:36,029 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-12 22:29:36,029 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-01-12 22:29:36,029 INFO L87 Difference]: Start difference. First operand 12981 states and 31114 transitions. Second operand 8 states. [2019-01-12 22:29:36,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 22:29:36,957 INFO L93 Difference]: Finished difference Result 16736 states and 40038 transitions. [2019-01-12 22:29:36,958 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-01-12 22:29:36,958 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 101 [2019-01-12 22:29:36,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 22:29:36,977 INFO L225 Difference]: With dead ends: 16736 [2019-01-12 22:29:36,977 INFO L226 Difference]: Without dead ends: 16704 [2019-01-12 22:29:36,978 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2019-01-12 22:29:37,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16704 states. [2019-01-12 22:29:37,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16704 to 13492. [2019-01-12 22:29:37,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13492 states. [2019-01-12 22:29:37,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13492 states to 13492 states and 32328 transitions. [2019-01-12 22:29:37,143 INFO L78 Accepts]: Start accepts. Automaton has 13492 states and 32328 transitions. Word has length 101 [2019-01-12 22:29:37,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 22:29:37,143 INFO L480 AbstractCegarLoop]: Abstraction has 13492 states and 32328 transitions. [2019-01-12 22:29:37,143 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-12 22:29:37,143 INFO L276 IsEmpty]: Start isEmpty. Operand 13492 states and 32328 transitions. [2019-01-12 22:29:37,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-01-12 22:29:37,157 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 22:29:37,157 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] [2019-01-12 22:29:37,157 INFO L423 AbstractCegarLoop]: === Iteration 21 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 22:29:37,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 22:29:37,158 INFO L82 PathProgramCache]: Analyzing trace with hash 1836633616, now seen corresponding path program 1 times [2019-01-12 22:29:37,158 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 22:29:37,158 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 22:29:37,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:29:37,160 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 22:29:37,160 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:29:37,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 22:29:37,288 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-12 22:29:37,289 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 22:29:37,289 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-12 22:29:37,289 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-12 22:29:37,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-12 22:29:37,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-01-12 22:29:37,290 INFO L87 Difference]: Start difference. First operand 13492 states and 32328 transitions. Second operand 6 states. [2019-01-12 22:29:37,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 22:29:37,722 INFO L93 Difference]: Finished difference Result 16820 states and 39975 transitions. [2019-01-12 22:29:37,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-12 22:29:37,723 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 101 [2019-01-12 22:29:37,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 22:29:37,742 INFO L225 Difference]: With dead ends: 16820 [2019-01-12 22:29:37,742 INFO L226 Difference]: Without dead ends: 16820 [2019-01-12 22:29:37,742 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-01-12 22:29:37,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16820 states. [2019-01-12 22:29:37,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16820 to 14800. [2019-01-12 22:29:37,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14800 states. [2019-01-12 22:29:37,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14800 states to 14800 states and 35353 transitions. [2019-01-12 22:29:37,916 INFO L78 Accepts]: Start accepts. Automaton has 14800 states and 35353 transitions. Word has length 101 [2019-01-12 22:29:37,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 22:29:37,916 INFO L480 AbstractCegarLoop]: Abstraction has 14800 states and 35353 transitions. [2019-01-12 22:29:37,916 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-12 22:29:37,916 INFO L276 IsEmpty]: Start isEmpty. Operand 14800 states and 35353 transitions. [2019-01-12 22:29:37,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-01-12 22:29:37,930 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 22:29:37,930 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] [2019-01-12 22:29:37,931 INFO L423 AbstractCegarLoop]: === Iteration 22 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 22:29:37,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 22:29:37,931 INFO L82 PathProgramCache]: Analyzing trace with hash 1867653423, now seen corresponding path program 1 times [2019-01-12 22:29:37,931 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 22:29:37,931 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 22:29:37,933 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:29:37,933 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 22:29:37,933 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:29:37,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 22:29:38,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-12 22:29:38,037 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 22:29:38,037 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 22:29:38,038 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 22:29:38,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 22:29:38,038 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 22:29:38,038 INFO L87 Difference]: Start difference. First operand 14800 states and 35353 transitions. Second operand 3 states. [2019-01-12 22:29:38,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 22:29:38,147 INFO L93 Difference]: Finished difference Result 14736 states and 35081 transitions. [2019-01-12 22:29:38,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 22:29:38,148 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 101 [2019-01-12 22:29:38,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 22:29:38,164 INFO L225 Difference]: With dead ends: 14736 [2019-01-12 22:29:38,164 INFO L226 Difference]: Without dead ends: 14704 [2019-01-12 22:29:38,165 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-12 22:29:38,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14704 states. [2019-01-12 22:29:38,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14704 to 13192. [2019-01-12 22:29:38,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13192 states. [2019-01-12 22:29:38,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13192 states to 13192 states and 31514 transitions. [2019-01-12 22:29:38,311 INFO L78 Accepts]: Start accepts. Automaton has 13192 states and 31514 transitions. Word has length 101 [2019-01-12 22:29:38,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 22:29:38,311 INFO L480 AbstractCegarLoop]: Abstraction has 13192 states and 31514 transitions. [2019-01-12 22:29:38,311 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 22:29:38,311 INFO L276 IsEmpty]: Start isEmpty. Operand 13192 states and 31514 transitions. [2019-01-12 22:29:38,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-01-12 22:29:38,324 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 22:29:38,324 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 22:29:38,325 INFO L423 AbstractCegarLoop]: === Iteration 23 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 22:29:38,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 22:29:38,325 INFO L82 PathProgramCache]: Analyzing trace with hash 1015704748, now seen corresponding path program 1 times [2019-01-12 22:29:38,325 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 22:29:38,325 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 22:29:38,327 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:29:38,327 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 22:29:38,327 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:29:38,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 22:29:38,919 WARN L181 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 10 [2019-01-12 22:29:39,439 WARN L181 SmtUtils]: Spent 393.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 16 [2019-01-12 22:29:39,462 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-12 22:29:39,463 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 22:29:39,463 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-12 22:29:39,463 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-12 22:29:39,463 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-12 22:29:39,464 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-01-12 22:29:39,464 INFO L87 Difference]: Start difference. First operand 13192 states and 31514 transitions. Second operand 7 states. [2019-01-12 22:29:40,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 22:29:40,064 INFO L93 Difference]: Finished difference Result 18412 states and 42960 transitions. [2019-01-12 22:29:40,065 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-12 22:29:40,065 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 103 [2019-01-12 22:29:40,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 22:29:40,084 INFO L225 Difference]: With dead ends: 18412 [2019-01-12 22:29:40,084 INFO L226 Difference]: Without dead ends: 18308 [2019-01-12 22:29:40,085 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-01-12 22:29:40,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18308 states. [2019-01-12 22:29:40,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18308 to 13636. [2019-01-12 22:29:40,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13636 states. [2019-01-12 22:29:40,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13636 states to 13636 states and 32317 transitions. [2019-01-12 22:29:40,253 INFO L78 Accepts]: Start accepts. Automaton has 13636 states and 32317 transitions. Word has length 103 [2019-01-12 22:29:40,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 22:29:40,254 INFO L480 AbstractCegarLoop]: Abstraction has 13636 states and 32317 transitions. [2019-01-12 22:29:40,254 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-12 22:29:40,254 INFO L276 IsEmpty]: Start isEmpty. Operand 13636 states and 32317 transitions. [2019-01-12 22:29:40,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-01-12 22:29:40,267 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 22:29:40,267 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 22:29:40,267 INFO L423 AbstractCegarLoop]: === Iteration 24 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 22:29:40,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 22:29:40,268 INFO L82 PathProgramCache]: Analyzing trace with hash -994399093, now seen corresponding path program 1 times [2019-01-12 22:29:40,268 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 22:29:40,268 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 22:29:40,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:29:40,270 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 22:29:40,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:29:40,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 22:29:40,780 WARN L181 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 10 [2019-01-12 22:29:40,818 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-12 22:29:40,819 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 22:29:40,819 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-12 22:29:40,819 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-12 22:29:40,819 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-12 22:29:40,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-01-12 22:29:40,820 INFO L87 Difference]: Start difference. First operand 13636 states and 32317 transitions. Second operand 7 states. [2019-01-12 22:29:41,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 22:29:41,490 INFO L93 Difference]: Finished difference Result 17742 states and 40788 transitions. [2019-01-12 22:29:41,491 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-12 22:29:41,491 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 103 [2019-01-12 22:29:41,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 22:29:41,510 INFO L225 Difference]: With dead ends: 17742 [2019-01-12 22:29:41,511 INFO L226 Difference]: Without dead ends: 17742 [2019-01-12 22:29:41,511 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2019-01-12 22:29:41,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17742 states. [2019-01-12 22:29:41,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17742 to 14943. [2019-01-12 22:29:41,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14943 states. [2019-01-12 22:29:41,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14943 states to 14943 states and 34814 transitions. [2019-01-12 22:29:41,680 INFO L78 Accepts]: Start accepts. Automaton has 14943 states and 34814 transitions. Word has length 103 [2019-01-12 22:29:41,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 22:29:41,680 INFO L480 AbstractCegarLoop]: Abstraction has 14943 states and 34814 transitions. [2019-01-12 22:29:41,680 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-12 22:29:41,681 INFO L276 IsEmpty]: Start isEmpty. Operand 14943 states and 34814 transitions. [2019-01-12 22:29:41,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-01-12 22:29:41,695 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 22:29:41,695 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 22:29:41,695 INFO L423 AbstractCegarLoop]: === Iteration 25 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 22:29:41,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 22:29:41,695 INFO L82 PathProgramCache]: Analyzing trace with hash -1249135638, now seen corresponding path program 1 times [2019-01-12 22:29:41,695 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 22:29:41,696 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 22:29:41,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:29:41,698 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 22:29:41,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:29:41,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 22:29:41,789 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-12 22:29:41,790 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 22:29:41,790 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 22:29:41,790 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 22:29:41,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 22:29:41,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 22:29:41,791 INFO L87 Difference]: Start difference. First operand 14943 states and 34814 transitions. Second operand 3 states. [2019-01-12 22:29:41,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 22:29:41,961 INFO L93 Difference]: Finished difference Result 18562 states and 43166 transitions. [2019-01-12 22:29:41,961 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 22:29:41,962 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 103 [2019-01-12 22:29:41,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 22:29:41,980 INFO L225 Difference]: With dead ends: 18562 [2019-01-12 22:29:41,980 INFO L226 Difference]: Without dead ends: 18562 [2019-01-12 22:29:41,981 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-12 22:29:42,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18562 states. [2019-01-12 22:29:42,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18562 to 18468. [2019-01-12 22:29:42,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18468 states. [2019-01-12 22:29:42,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18468 states to 18468 states and 42966 transitions. [2019-01-12 22:29:42,170 INFO L78 Accepts]: Start accepts. Automaton has 18468 states and 42966 transitions. Word has length 103 [2019-01-12 22:29:42,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 22:29:42,170 INFO L480 AbstractCegarLoop]: Abstraction has 18468 states and 42966 transitions. [2019-01-12 22:29:42,171 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 22:29:42,171 INFO L276 IsEmpty]: Start isEmpty. Operand 18468 states and 42966 transitions. [2019-01-12 22:29:42,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-01-12 22:29:42,187 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 22:29:42,188 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 22:29:42,188 INFO L423 AbstractCegarLoop]: === Iteration 26 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 22:29:42,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 22:29:42,188 INFO L82 PathProgramCache]: Analyzing trace with hash -1037784725, now seen corresponding path program 1 times [2019-01-12 22:29:42,188 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 22:29:42,188 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 22:29:42,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:29:42,190 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 22:29:42,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:29:42,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 22:29:42,390 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-12 22:29:42,391 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 22:29:42,391 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-01-12 22:29:42,391 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-12 22:29:42,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-12 22:29:42,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-01-12 22:29:42,392 INFO L87 Difference]: Start difference. First operand 18468 states and 42966 transitions. Second operand 10 states. [2019-01-12 22:29:43,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 22:29:43,099 INFO L93 Difference]: Finished difference Result 21062 states and 48972 transitions. [2019-01-12 22:29:43,100 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-12 22:29:43,100 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 103 [2019-01-12 22:29:43,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 22:29:43,106 INFO L225 Difference]: With dead ends: 21062 [2019-01-12 22:29:43,106 INFO L226 Difference]: Without dead ends: 4191 [2019-01-12 22:29:43,106 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2019-01-12 22:29:43,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4191 states. [2019-01-12 22:29:43,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4191 to 4189. [2019-01-12 22:29:43,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4189 states. [2019-01-12 22:29:43,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4189 states to 4189 states and 9904 transitions. [2019-01-12 22:29:43,146 INFO L78 Accepts]: Start accepts. Automaton has 4189 states and 9904 transitions. Word has length 103 [2019-01-12 22:29:43,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 22:29:43,146 INFO L480 AbstractCegarLoop]: Abstraction has 4189 states and 9904 transitions. [2019-01-12 22:29:43,146 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-12 22:29:43,146 INFO L276 IsEmpty]: Start isEmpty. Operand 4189 states and 9904 transitions. [2019-01-12 22:29:43,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-01-12 22:29:43,150 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 22:29:43,151 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 22:29:43,151 INFO L423 AbstractCegarLoop]: === Iteration 27 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 22:29:43,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 22:29:43,151 INFO L82 PathProgramCache]: Analyzing trace with hash 1037348813, now seen corresponding path program 1 times [2019-01-12 22:29:43,151 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 22:29:43,152 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 22:29:43,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:29:43,153 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 22:29:43,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:29:43,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 22:29:43,729 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-12 22:29:43,729 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 22:29:43,729 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-12 22:29:43,730 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-12 22:29:43,730 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-12 22:29:43,730 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-01-12 22:29:43,730 INFO L87 Difference]: Start difference. First operand 4189 states and 9904 transitions. Second operand 7 states. [2019-01-12 22:29:44,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 22:29:44,066 INFO L93 Difference]: Finished difference Result 4681 states and 11107 transitions. [2019-01-12 22:29:44,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-12 22:29:44,067 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 103 [2019-01-12 22:29:44,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 22:29:44,072 INFO L225 Difference]: With dead ends: 4681 [2019-01-12 22:29:44,072 INFO L226 Difference]: Without dead ends: 4681 [2019-01-12 22:29:44,073 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 4 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2019-01-12 22:29:44,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4681 states. [2019-01-12 22:29:44,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4681 to 4109. [2019-01-12 22:29:44,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4109 states. [2019-01-12 22:29:44,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4109 states to 4109 states and 9742 transitions. [2019-01-12 22:29:44,115 INFO L78 Accepts]: Start accepts. Automaton has 4109 states and 9742 transitions. Word has length 103 [2019-01-12 22:29:44,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 22:29:44,115 INFO L480 AbstractCegarLoop]: Abstraction has 4109 states and 9742 transitions. [2019-01-12 22:29:44,115 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-12 22:29:44,115 INFO L276 IsEmpty]: Start isEmpty. Operand 4109 states and 9742 transitions. [2019-01-12 22:29:44,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-01-12 22:29:44,120 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 22:29:44,121 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 22:29:44,121 INFO L423 AbstractCegarLoop]: === Iteration 28 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 22:29:44,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 22:29:44,121 INFO L82 PathProgramCache]: Analyzing trace with hash 2075258252, now seen corresponding path program 2 times [2019-01-12 22:29:44,121 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 22:29:44,121 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 22:29:44,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:29:44,123 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 22:29:44,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:29:44,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 22:29:44,317 WARN L181 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2019-01-12 22:29:44,415 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-12 22:29:44,416 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 22:29:44,416 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-01-12 22:29:44,416 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-01-12 22:29:44,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-01-12 22:29:44,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2019-01-12 22:29:44,417 INFO L87 Difference]: Start difference. First operand 4109 states and 9742 transitions. Second operand 13 states. [2019-01-12 22:29:45,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 22:29:45,307 INFO L93 Difference]: Finished difference Result 6479 states and 15133 transitions. [2019-01-12 22:29:45,308 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-01-12 22:29:45,308 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 103 [2019-01-12 22:29:45,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 22:29:45,315 INFO L225 Difference]: With dead ends: 6479 [2019-01-12 22:29:45,315 INFO L226 Difference]: Without dead ends: 4657 [2019-01-12 22:29:45,315 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=75, Invalid=387, Unknown=0, NotChecked=0, Total=462 [2019-01-12 22:29:45,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4657 states. [2019-01-12 22:29:45,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4657 to 4160. [2019-01-12 22:29:45,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4160 states. [2019-01-12 22:29:45,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4160 states to 4160 states and 9797 transitions. [2019-01-12 22:29:45,404 INFO L78 Accepts]: Start accepts. Automaton has 4160 states and 9797 transitions. Word has length 103 [2019-01-12 22:29:45,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 22:29:45,404 INFO L480 AbstractCegarLoop]: Abstraction has 4160 states and 9797 transitions. [2019-01-12 22:29:45,405 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-01-12 22:29:45,405 INFO L276 IsEmpty]: Start isEmpty. Operand 4160 states and 9797 transitions. [2019-01-12 22:29:45,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-01-12 22:29:45,409 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 22:29:45,409 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 22:29:45,409 INFO L423 AbstractCegarLoop]: === Iteration 29 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 22:29:45,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 22:29:45,410 INFO L82 PathProgramCache]: Analyzing trace with hash -932371670, now seen corresponding path program 3 times [2019-01-12 22:29:45,410 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 22:29:45,410 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 22:29:45,411 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:29:45,411 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 22:29:45,411 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:29:45,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-12 22:29:45,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-12 22:29:45,487 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-01-12 22:29:45,674 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2019-01-12 22:29:45,675 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.01 10:29:45 BasicIcfg [2019-01-12 22:29:45,676 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-12 22:29:45,676 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-12 22:29:45,676 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-12 22:29:45,676 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-12 22:29:45,677 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 10:28:00" (3/4) ... [2019-01-12 22:29:45,679 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2019-01-12 22:29:45,869 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-12 22:29:45,872 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-12 22:29:45,873 INFO L168 Benchmark]: Toolchain (without parser) took 107405.59 ms. Allocated memory was 1.0 GB in the beginning and 6.4 GB in the end (delta: 5.4 GB). Free memory was 947.3 MB in the beginning and 4.3 GB in the end (delta: -3.4 GB). Peak memory consumption was 2.0 GB. Max. memory is 11.5 GB. [2019-01-12 22:29:45,874 INFO L168 Benchmark]: CDTParser took 0.15 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-12 22:29:45,875 INFO L168 Benchmark]: CACSL2BoogieTranslator took 779.78 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.0 MB). Free memory was 947.3 MB in the beginning and 1.1 GB in the end (delta: -166.3 MB). Peak memory consumption was 31.5 MB. Max. memory is 11.5 GB. [2019-01-12 22:29:45,875 INFO L168 Benchmark]: Boogie Procedure Inliner took 79.75 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2019-01-12 22:29:45,875 INFO L168 Benchmark]: Boogie Preprocessor took 41.64 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-12 22:29:45,876 INFO L168 Benchmark]: RCFGBuilder took 1527.15 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 58.0 MB). Peak memory consumption was 58.0 MB. Max. memory is 11.5 GB. [2019-01-12 22:29:45,876 INFO L168 Benchmark]: TraceAbstraction took 104776.04 ms. Allocated memory was 1.2 GB in the beginning and 6.4 GB in the end (delta: 5.3 GB). Free memory was 1.0 GB in the beginning and 4.4 GB in the end (delta: -3.3 GB). Peak memory consumption was 1.9 GB. Max. memory is 11.5 GB. [2019-01-12 22:29:45,876 INFO L168 Benchmark]: Witness Printer took 196.31 ms. Allocated memory is still 6.4 GB. Free memory was 4.4 GB in the beginning and 4.3 GB in the end (delta: 40.8 MB). Peak memory consumption was 40.8 MB. Max. memory is 11.5 GB. [2019-01-12 22:29:45,882 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.15 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 779.78 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.0 MB). Free memory was 947.3 MB in the beginning and 1.1 GB in the end (delta: -166.3 MB). Peak memory consumption was 31.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 79.75 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 41.64 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 1527.15 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 58.0 MB). Peak memory consumption was 58.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 104776.04 ms. Allocated memory was 1.2 GB in the beginning and 6.4 GB in the end (delta: 5.3 GB). Free memory was 1.0 GB in the beginning and 4.4 GB in the end (delta: -3.3 GB). Peak memory consumption was 1.9 GB. Max. memory is 11.5 GB. * Witness Printer took 196.31 ms. Allocated memory is still 6.4 GB. Free memory was 4.4 GB in the beginning and 4.3 GB in the end (delta: 40.8 MB). Peak memory consumption was 40.8 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_p0_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0] [L678] -1 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0] [L680] -1 int __unbuffered_p1_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0] [L681] -1 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0] [L682] -1 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L684] -1 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L685] -1 _Bool x$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0] [L686] -1 int x$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0] [L687] -1 _Bool x$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0] [L688] -1 _Bool x$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0] [L689] -1 _Bool x$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0] [L690] -1 _Bool x$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0] [L691] -1 _Bool x$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0] [L692] -1 _Bool x$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0] [L693] -1 _Bool x$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0] [L694] -1 int *x$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}] [L695] -1 int x$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0] [L696] -1 _Bool x$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0] [L697] -1 int x$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0] [L698] -1 _Bool x$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0] [L700] -1 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L701] -1 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L702] -1 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L789] -1 pthread_t t6; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L790] FCALL, FORK -1 pthread_create(&t6, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L791] -1 pthread_t t7; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L792] FCALL, FORK -1 pthread_create(&t7, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L737] 0 x$w_buff1 = x$w_buff0 [L738] 0 x$w_buff0 = 1 [L739] 0 x$w_buff1_used = x$w_buff0_used [L740] 0 x$w_buff0_used = (_Bool)1 [L5] COND FALSE 0 !(!expression) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L742] 0 x$r_buff1_thd0 = x$r_buff0_thd0 [L743] 0 x$r_buff1_thd1 = x$r_buff0_thd1 [L744] 0 x$r_buff1_thd2 = x$r_buff0_thd2 [L745] 0 x$r_buff0_thd2 = (_Bool)1 [L748] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L749] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L750] 0 x$flush_delayed = weak$$choice2 [L751] 0 x$mem_tmp = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L752] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L752] EXPR 0 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L752] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L752] 0 x = !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L753] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L753] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) [L754] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L754] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) [L755] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L755] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) [L756] EXPR 0 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L756] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L757] EXPR 0 weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L757] 0 x$r_buff0_thd2 = weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2)) [L758] EXPR 0 weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L758] 0 x$r_buff1_thd2 = weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L759] 0 __unbuffered_p1_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L760] EXPR 0 x$flush_delayed ? x$mem_tmp : x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L760] 0 x = x$flush_delayed ? x$mem_tmp : x [L761] 0 x$flush_delayed = (_Bool)0 [L764] 0 __unbuffered_p1_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L767] EXPR 0 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L706] 1 y = 1 [L709] 1 __unbuffered_p0_EAX = y [L712] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L713] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L714] 1 x$flush_delayed = weak$$choice2 [L715] 1 x$mem_tmp = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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=5, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L716] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) VAL [!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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=5, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L767] 0 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L768] EXPR 0 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used VAL [!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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=5, weak$$choice2=1, x=1, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L768] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L769] EXPR 0 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used VAL [!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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=5, weak$$choice2=1, x=1, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L716] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L717] EXPR 1 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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=5, weak$$choice2=1, weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0))=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L717] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L718] EXPR 1 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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=5, weak$$choice2=1, weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L718] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L719] EXPR 1 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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=5, weak$$choice2=1, weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L719] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L720] EXPR 1 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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=5, weak$$choice2=1, weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L769] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L770] EXPR 0 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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=5, weak$$choice2=1, weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L770] 0 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L771] EXPR 0 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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=5, weak$$choice2=1, weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L771] 0 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L774] 0 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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=5, weak$$choice2=1, weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L720] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L721] EXPR 1 weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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=5, weak$$choice2=1, weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L721] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L722] EXPR 1 weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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=5, weak$$choice2=1, weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L722] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L723] 1 __unbuffered_p0_EBX = x VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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=5, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L724] EXPR 1 x$flush_delayed ? x$mem_tmp : x VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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=5, weak$$choice2=1, x=0, x$flush_delayed=1, x$flush_delayed ? x$mem_tmp : x=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L724] 1 x = x$flush_delayed ? x$mem_tmp : x [L725] 1 x$flush_delayed = (_Bool)0 [L730] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L794] -1 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L798] EXPR -1 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L798] EXPR -1 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L798] EXPR -1 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L798] -1 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L799] EXPR -1 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L799] -1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L800] EXPR -1 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L800] -1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L801] EXPR -1 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L801] -1 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L802] EXPR -1 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L802] -1 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L805] -1 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L5] COND TRUE -1 !expression VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L5] -1 __VERIFIER_error() VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 284 locations, 3 error locations. UNSAFE Result, 104.5s OverallTime, 29 OverallIterations, 1 TraceHistogramMax, 32.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 10447 SDtfs, 11646 SDslu, 25337 SDs, 0 SdLazy, 8791 SolverSat, 527 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 14.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 263 GetRequests, 68 SyntacticMatches, 23 SemanticMatches, 172 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 152 ImplicationChecksByTransitivity, 7.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=201216occurred in iteration=6, 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: 55.9s AutomataMinimizationTime, 28 MinimizatonAttempts, 439597 StatesRemovedByMinimization, 28 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 6.9s InterpolantComputationTime, 2409 NumberOfCodeBlocks, 2409 NumberOfCodeBlocksAsserted, 29 NumberOfCheckSat, 2278 ConstructedInterpolants, 0 QuantifiedInterpolants, 444840 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...