./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/pthread-wmm/mix009_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/mix009_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 0f4fbc2bece5d54b4ce5c1cb1fb66b04199ec20a ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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 23:18:52,552 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-12 23:18:52,554 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-12 23:18:52,566 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-12 23:18:52,566 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-12 23:18:52,568 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-12 23:18:52,569 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-12 23:18:52,571 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-12 23:18:52,573 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-12 23:18:52,574 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-12 23:18:52,575 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-12 23:18:52,575 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-12 23:18:52,576 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-12 23:18:52,578 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-12 23:18:52,579 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-12 23:18:52,580 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-12 23:18:52,581 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-12 23:18:52,584 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-12 23:18:52,586 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-12 23:18:52,588 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-12 23:18:52,590 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-12 23:18:52,591 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-12 23:18:52,594 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-12 23:18:52,595 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-12 23:18:52,595 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-12 23:18:52,596 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-12 23:18:52,598 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-12 23:18:52,598 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-12 23:18:52,600 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-12 23:18:52,601 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-12 23:18:52,601 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-12 23:18:52,603 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-12 23:18:52,603 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-12 23:18:52,603 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-12 23:18:52,605 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-12 23:18:52,606 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-12 23:18:52,606 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-01-12 23:18:52,634 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-12 23:18:52,634 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-12 23:18:52,636 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-12 23:18:52,636 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-12 23:18:52,637 INFO L133 SettingsManager]: * Use SBE=true [2019-01-12 23:18:52,637 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-12 23:18:52,637 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-12 23:18:52,637 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-12 23:18:52,638 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-12 23:18:52,640 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-12 23:18:52,640 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-12 23:18:52,640 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-12 23:18:52,641 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-12 23:18:52,641 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-12 23:18:52,641 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-12 23:18:52,641 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-12 23:18:52,641 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-12 23:18:52,641 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-12 23:18:52,642 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-12 23:18:52,642 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-12 23:18:52,642 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-12 23:18:52,642 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-12 23:18:52,643 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-12 23:18:52,643 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-12 23:18:52,643 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-12 23:18:52,643 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-12 23:18:52,643 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-12 23:18:52,643 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-12 23:18:52,644 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 -> 0f4fbc2bece5d54b4ce5c1cb1fb66b04199ec20a [2019-01-12 23:18:52,711 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-12 23:18:52,727 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-12 23:18:52,733 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-12 23:18:52,735 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-12 23:18:52,735 INFO L276 PluginConnector]: CDTParser initialized [2019-01-12 23:18:52,737 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/pthread-wmm/mix009_pso.opt_false-unreach-call.i [2019-01-12 23:18:52,789 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/44eff742f/ebc78e4a1d7d404491d1ffe0bd8f16f8/FLAG051a50be8 [2019-01-12 23:18:53,413 INFO L307 CDTParser]: Found 1 translation units. [2019-01-12 23:18:53,414 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/pthread-wmm/mix009_pso.opt_false-unreach-call.i [2019-01-12 23:18:53,429 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/44eff742f/ebc78e4a1d7d404491d1ffe0bd8f16f8/FLAG051a50be8 [2019-01-12 23:18:53,653 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/44eff742f/ebc78e4a1d7d404491d1ffe0bd8f16f8 [2019-01-12 23:18:53,658 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-12 23:18:53,659 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-12 23:18:53,661 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-12 23:18:53,661 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-12 23:18:53,666 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-12 23:18:53,667 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 11:18:53" (1/1) ... [2019-01-12 23:18:53,670 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@28202cca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 11:18:53, skipping insertion in model container [2019-01-12 23:18:53,671 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 11:18:53" (1/1) ... [2019-01-12 23:18:53,680 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-12 23:18:53,732 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-12 23:18:54,283 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 23:18:54,307 INFO L191 MainTranslator]: Completed pre-run [2019-01-12 23:18:54,471 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 23:18:54,559 INFO L195 MainTranslator]: Completed translation [2019-01-12 23:18:54,560 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 11:18:54 WrapperNode [2019-01-12 23:18:54,560 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-12 23:18:54,561 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-12 23:18:54,561 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-12 23:18:54,561 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-12 23:18:54,571 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 11:18:54" (1/1) ... [2019-01-12 23:18:54,602 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 11:18:54" (1/1) ... [2019-01-12 23:18:54,661 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-12 23:18:54,662 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-12 23:18:54,662 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-12 23:18:54,663 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-12 23:18:54,674 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 11:18:54" (1/1) ... [2019-01-12 23:18:54,675 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 11:18:54" (1/1) ... [2019-01-12 23:18:54,690 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 11:18:54" (1/1) ... [2019-01-12 23:18:54,692 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 11:18:54" (1/1) ... [2019-01-12 23:18:54,721 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 11:18:54" (1/1) ... [2019-01-12 23:18:54,730 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 11:18:54" (1/1) ... [2019-01-12 23:18:54,739 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 11:18:54" (1/1) ... [2019-01-12 23:18:54,745 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-12 23:18:54,746 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-12 23:18:54,746 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-12 23:18:54,746 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-12 23:18:54,748 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 11:18:54" (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 23:18:54,830 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-12 23:18:54,831 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-01-12 23:18:54,831 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-12 23:18:54,831 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-12 23:18:54,834 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-01-12 23:18:54,835 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-01-12 23:18:54,835 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-01-12 23:18:54,835 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-01-12 23:18:54,835 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-01-12 23:18:54,835 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-12 23:18:54,835 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-12 23:18:54,840 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 23:18:56,243 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-12 23:18:56,243 INFO L286 CfgBuilder]: Removed 8 assue(true) statements. [2019-01-12 23:18:56,244 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 11:18:56 BoogieIcfgContainer [2019-01-12 23:18:56,245 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-12 23:18:56,246 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-12 23:18:56,246 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-12 23:18:56,249 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-12 23:18:56,250 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.01 11:18:53" (1/3) ... [2019-01-12 23:18:56,250 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b8a91b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 11:18:56, skipping insertion in model container [2019-01-12 23:18:56,251 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 11:18:54" (2/3) ... [2019-01-12 23:18:56,251 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b8a91b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 11:18:56, skipping insertion in model container [2019-01-12 23:18:56,251 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 11:18:56" (3/3) ... [2019-01-12 23:18:56,256 INFO L112 eAbstractionObserver]: Analyzing ICFG mix009_pso.opt_false-unreach-call.i [2019-01-12 23:18:56,326 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:18:56,326 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:18:56,326 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:18:56,326 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:18:56,327 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:18:56,327 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:18:56,327 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:18:56,327 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:18:56,328 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:18:56,328 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:18:56,329 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:18:56,329 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:18:56,329 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:18:56,329 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:18:56,330 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:18:56,330 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:18:56,330 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:18:56,330 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:18:56,330 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:18:56,330 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:18:56,339 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:18:56,339 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:18:56,340 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:18:56,340 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:18:56,340 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:18:56,340 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:18:56,341 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:18:56,341 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:18:56,341 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:18:56,341 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:18:56,341 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:18:56,342 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:18:56,344 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:18:56,344 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:18:56,344 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:18:56,344 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:18:56,344 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:18:56,345 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:18:56,345 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:18:56,345 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:18:56,345 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:18:56,346 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:18:56,346 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:18:56,346 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:18:56,346 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:18:56,346 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:18:56,348 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:18:56,348 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:18:56,349 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:18:56,349 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:18:56,349 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:18:56,349 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:18:56,349 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:18:56,350 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:18:56,350 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:18:56,350 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:18:56,350 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:18:56,351 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:18:56,351 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:18:56,351 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:18:56,351 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:18:56,351 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:18:56,352 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:18:56,352 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:18:56,352 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:18:56,352 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:18:56,352 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:18:56,352 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:18:56,353 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:18:56,353 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:18:56,353 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:18:56,353 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:18:56,354 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:18:56,354 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:18:56,354 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:18:56,354 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:18:56,354 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:18:56,355 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:18:56,355 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:18:56,355 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:18:56,355 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:18:56,355 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:18:56,356 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:18:56,357 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:18:56,357 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:18:56,357 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:18:56,358 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:18:56,362 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:18:56,362 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:18:56,362 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:18:56,362 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:18:56,363 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:18:56,364 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet26.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:18:56,364 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet26.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:18:56,364 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:18:56,364 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:18:56,365 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet26.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:18:56,367 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet26.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:18:56,370 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:18:56,371 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:18:56,371 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:18:56,372 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:18:56,372 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:18:56,372 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:18:56,372 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:18:56,372 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:18:56,377 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:18:56,378 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:18:56,378 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:18:56,379 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:18:56,379 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:18:56,379 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:18:56,379 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:18:56,380 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:18:56,381 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:18:56,381 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:18:56,381 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:18:56,382 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:18:56,385 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:18:56,386 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:18:56,386 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:18:56,386 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:18:56,386 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:18:56,386 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:18:56,387 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:18:56,387 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:18:56,387 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:18:56,387 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:18:56,387 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:18:56,388 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:18:56,390 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:18:56,390 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:18:56,390 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:18:56,390 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:18:56,391 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:18:56,392 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:18:56,392 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:18:56,392 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:18:56,392 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:18:56,392 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:18:56,393 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:18:56,393 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:18:56,393 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:18:56,393 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:18:56,393 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:18:56,393 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:18:56,396 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:18:56,396 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:18:56,396 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:18:56,397 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:18:56,397 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:18:56,397 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:18:56,397 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:18:56,397 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:18:56,398 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:18:56,399 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:18:56,399 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:18:56,400 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:18:56,400 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:18:56,400 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:18:56,400 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:18:56,401 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:18:56,401 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:18:56,401 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:18:56,401 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:18:56,401 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:18:56,401 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:18:56,402 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:18:56,402 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:18:56,402 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:18:56,402 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:18:56,402 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:18:56,403 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:18:56,403 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:18:56,403 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:18:56,403 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:18:56,403 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:18:56,404 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:18:56,404 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:18:56,405 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:18:56,405 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:18:56,405 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:18:56,407 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:18:56,407 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:18:56,407 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:18:56,407 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:18:56,408 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:18:56,409 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:18:56,409 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:18:56,409 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:18:56,410 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:18:56,410 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:18:56,410 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:18:56,410 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:18:56,410 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:18:56,415 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:18:56,415 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:18:56,416 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:18:56,416 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:18:56,416 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:18:56,416 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:18:56,417 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:18:56,417 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:18:56,417 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:18:56,417 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:18:56,417 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:18:56,418 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:18:56,418 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:18:56,418 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:18:56,418 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:18:56,418 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:18:56,419 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:18:56,419 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:18:56,419 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:18:56,419 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:18:56,419 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:18:56,420 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:18:56,420 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:18:56,421 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet56.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:18:56,421 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet56.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:18:56,421 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:18:56,421 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:18:56,421 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet56.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:18:56,421 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet56.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:18:56,449 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-01-12 23:18:56,449 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-12 23:18:56,457 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2019-01-12 23:18:56,474 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2019-01-12 23:18:56,499 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-12 23:18:56,500 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-12 23:18:56,500 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-12 23:18:56,500 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-12 23:18:56,500 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-12 23:18:56,501 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-12 23:18:56,501 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-12 23:18:56,501 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-12 23:18:56,501 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-12 23:18:56,516 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 175places, 228 transitions [2019-01-12 23:19:05,640 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 83129 states. [2019-01-12 23:19:05,642 INFO L276 IsEmpty]: Start isEmpty. Operand 83129 states. [2019-01-12 23:19:05,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-01-12 23:19:05,653 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 23:19:05,655 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] [2019-01-12 23:19:05,657 INFO L423 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 23:19:05,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 23:19:05,663 INFO L82 PathProgramCache]: Analyzing trace with hash 459405505, now seen corresponding path program 1 times [2019-01-12 23:19:05,666 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 23:19:05,666 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 23:19:05,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:19:05,739 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 23:19:05,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:19:05,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 23:19:06,029 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 23:19:06,033 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 23:19:06,033 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 23:19:06,038 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 23:19:06,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 23:19:06,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-12 23:19:06,059 INFO L87 Difference]: Start difference. First operand 83129 states. Second operand 4 states. [2019-01-12 23:19:09,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 23:19:09,203 INFO L93 Difference]: Finished difference Result 150585 states and 603162 transitions. [2019-01-12 23:19:09,205 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 23:19:09,206 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 40 [2019-01-12 23:19:09,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 23:19:10,025 INFO L225 Difference]: With dead ends: 150585 [2019-01-12 23:19:10,025 INFO L226 Difference]: Without dead ends: 105841 [2019-01-12 23:19:10,028 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 23:19:12,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105841 states. [2019-01-12 23:19:14,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105841 to 61237. [2019-01-12 23:19:14,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61237 states. [2019-01-12 23:19:14,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61237 states to 61237 states and 248292 transitions. [2019-01-12 23:19:14,619 INFO L78 Accepts]: Start accepts. Automaton has 61237 states and 248292 transitions. Word has length 40 [2019-01-12 23:19:14,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 23:19:14,620 INFO L480 AbstractCegarLoop]: Abstraction has 61237 states and 248292 transitions. [2019-01-12 23:19:14,620 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 23:19:14,620 INFO L276 IsEmpty]: Start isEmpty. Operand 61237 states and 248292 transitions. [2019-01-12 23:19:14,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-01-12 23:19:14,634 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 23:19:14,634 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 23:19:14,635 INFO L423 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 23:19:14,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 23:19:14,635 INFO L82 PathProgramCache]: Analyzing trace with hash -465402434, now seen corresponding path program 1 times [2019-01-12 23:19:14,635 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 23:19:14,635 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 23:19:14,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:19:14,641 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 23:19:14,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:19:14,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 23:19:15,942 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 23:19:15,942 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 23:19:15,942 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-12 23:19:15,948 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 23:19:15,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 23:19:15,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-12 23:19:15,950 INFO L87 Difference]: Start difference. First operand 61237 states and 248292 transitions. Second operand 5 states. [2019-01-12 23:19:18,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 23:19:18,671 INFO L93 Difference]: Finished difference Result 146041 states and 554302 transitions. [2019-01-12 23:19:18,671 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-12 23:19:18,671 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 48 [2019-01-12 23:19:18,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 23:19:19,235 INFO L225 Difference]: With dead ends: 146041 [2019-01-12 23:19:19,236 INFO L226 Difference]: Without dead ends: 145473 [2019-01-12 23:19:19,237 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 23:19:26,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145473 states. [2019-01-12 23:19:28,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145473 to 96615. [2019-01-12 23:19:28,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96615 states. [2019-01-12 23:19:28,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96615 states to 96615 states and 368457 transitions. [2019-01-12 23:19:28,384 INFO L78 Accepts]: Start accepts. Automaton has 96615 states and 368457 transitions. Word has length 48 [2019-01-12 23:19:28,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 23:19:28,385 INFO L480 AbstractCegarLoop]: Abstraction has 96615 states and 368457 transitions. [2019-01-12 23:19:28,385 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 23:19:28,385 INFO L276 IsEmpty]: Start isEmpty. Operand 96615 states and 368457 transitions. [2019-01-12 23:19:28,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-01-12 23:19:28,391 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 23:19:28,391 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 23:19:28,392 INFO L423 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 23:19:28,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 23:19:28,392 INFO L82 PathProgramCache]: Analyzing trace with hash 1761930056, now seen corresponding path program 1 times [2019-01-12 23:19:28,392 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 23:19:28,392 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 23:19:28,397 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:19:28,398 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 23:19:28,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:19:28,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 23:19:28,536 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 23:19:28,537 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 23:19:28,537 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-12 23:19:28,538 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 23:19:28,538 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 23:19:28,538 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-12 23:19:28,538 INFO L87 Difference]: Start difference. First operand 96615 states and 368457 transitions. Second operand 5 states. [2019-01-12 23:19:31,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 23:19:31,408 INFO L93 Difference]: Finished difference Result 199271 states and 748091 transitions. [2019-01-12 23:19:31,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-12 23:19:31,409 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 49 [2019-01-12 23:19:31,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 23:19:32,252 INFO L225 Difference]: With dead ends: 199271 [2019-01-12 23:19:32,252 INFO L226 Difference]: Without dead ends: 198807 [2019-01-12 23:19:32,253 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 23:19:34,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198807 states. [2019-01-12 23:19:37,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198807 to 108298. [2019-01-12 23:19:37,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108298 states. [2019-01-12 23:19:37,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108298 states to 108298 states and 408661 transitions. [2019-01-12 23:19:37,774 INFO L78 Accepts]: Start accepts. Automaton has 108298 states and 408661 transitions. Word has length 49 [2019-01-12 23:19:37,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 23:19:37,774 INFO L480 AbstractCegarLoop]: Abstraction has 108298 states and 408661 transitions. [2019-01-12 23:19:37,774 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 23:19:37,774 INFO L276 IsEmpty]: Start isEmpty. Operand 108298 states and 408661 transitions. [2019-01-12 23:19:37,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-01-12 23:19:37,787 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 23:19:37,788 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] [2019-01-12 23:19:37,788 INFO L423 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 23:19:37,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 23:19:37,788 INFO L82 PathProgramCache]: Analyzing trace with hash 1880248814, now seen corresponding path program 1 times [2019-01-12 23:19:37,788 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 23:19:37,789 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 23:19:37,793 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:19:37,794 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 23:19:37,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:19:37,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 23:19:37,899 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 23:19:37,900 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 23:19:37,900 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 23:19:37,900 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 23:19:37,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 23:19:37,901 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 23:19:37,901 INFO L87 Difference]: Start difference. First operand 108298 states and 408661 transitions. Second operand 3 states. [2019-01-12 23:19:38,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 23:19:38,915 INFO L93 Difference]: Finished difference Result 179117 states and 655176 transitions. [2019-01-12 23:19:38,916 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 23:19:38,916 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2019-01-12 23:19:38,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 23:19:39,520 INFO L225 Difference]: With dead ends: 179117 [2019-01-12 23:19:39,520 INFO L226 Difference]: Without dead ends: 179117 [2019-01-12 23:19:39,521 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 23:19:47,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179117 states. [2019-01-12 23:19:49,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179117 to 163648. [2019-01-12 23:19:49,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163648 states. [2019-01-12 23:19:49,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163648 states to 163648 states and 603627 transitions. [2019-01-12 23:19:49,978 INFO L78 Accepts]: Start accepts. Automaton has 163648 states and 603627 transitions. Word has length 51 [2019-01-12 23:19:49,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 23:19:49,978 INFO L480 AbstractCegarLoop]: Abstraction has 163648 states and 603627 transitions. [2019-01-12 23:19:49,978 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 23:19:49,978 INFO L276 IsEmpty]: Start isEmpty. Operand 163648 states and 603627 transitions. [2019-01-12 23:19:50,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-01-12 23:19:50,007 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 23:19:50,007 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] [2019-01-12 23:19:50,008 INFO L423 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 23:19:50,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 23:19:50,008 INFO L82 PathProgramCache]: Analyzing trace with hash 1419721436, now seen corresponding path program 1 times [2019-01-12 23:19:50,008 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 23:19:50,008 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 23:19:50,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:19:50,010 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 23:19:50,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:19:50,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 23:19:50,711 WARN L181 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 9 [2019-01-12 23:19:50,716 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 23:19:50,716 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 23:19:50,716 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-12 23:19:50,717 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-12 23:19:50,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-12 23:19:50,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-01-12 23:19:50,717 INFO L87 Difference]: Start difference. First operand 163648 states and 603627 transitions. Second operand 7 states. [2019-01-12 23:19:55,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 23:19:55,353 INFO L93 Difference]: Finished difference Result 270455 states and 961661 transitions. [2019-01-12 23:19:55,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-12 23:19:55,354 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 55 [2019-01-12 23:19:55,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 23:19:56,147 INFO L225 Difference]: With dead ends: 270455 [2019-01-12 23:19:56,147 INFO L226 Difference]: Without dead ends: 270455 [2019-01-12 23:19:56,148 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-01-12 23:19:58,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270455 states. [2019-01-12 23:20:03,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270455 to 202764. [2019-01-12 23:20:03,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202764 states. [2019-01-12 23:20:04,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202764 states to 202764 states and 737465 transitions. [2019-01-12 23:20:04,078 INFO L78 Accepts]: Start accepts. Automaton has 202764 states and 737465 transitions. Word has length 55 [2019-01-12 23:20:04,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 23:20:04,078 INFO L480 AbstractCegarLoop]: Abstraction has 202764 states and 737465 transitions. [2019-01-12 23:20:04,078 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-12 23:20:04,078 INFO L276 IsEmpty]: Start isEmpty. Operand 202764 states and 737465 transitions. [2019-01-12 23:20:04,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-01-12 23:20:04,107 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 23:20:04,107 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] [2019-01-12 23:20:04,107 INFO L423 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 23:20:04,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 23:20:04,108 INFO L82 PathProgramCache]: Analyzing trace with hash -1987742179, now seen corresponding path program 1 times [2019-01-12 23:20:04,108 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 23:20:04,108 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 23:20:04,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:20:04,110 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 23:20:04,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:20:04,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 23:20:04,270 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 23:20:04,270 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 23:20:04,270 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 23:20:04,271 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 23:20:04,271 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 23:20:04,271 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-12 23:20:04,271 INFO L87 Difference]: Start difference. First operand 202764 states and 737465 transitions. Second operand 4 states. [2019-01-12 23:20:04,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 23:20:04,451 INFO L93 Difference]: Finished difference Result 37397 states and 118609 transitions. [2019-01-12 23:20:04,452 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-12 23:20:04,452 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 55 [2019-01-12 23:20:04,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 23:20:04,511 INFO L225 Difference]: With dead ends: 37397 [2019-01-12 23:20:04,511 INFO L226 Difference]: Without dead ends: 30946 [2019-01-12 23:20:04,511 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 23:20:04,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30946 states. [2019-01-12 23:20:04,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30946 to 30705. [2019-01-12 23:20:04,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30705 states. [2019-01-12 23:20:04,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30705 states to 30705 states and 95883 transitions. [2019-01-12 23:20:04,964 INFO L78 Accepts]: Start accepts. Automaton has 30705 states and 95883 transitions. Word has length 55 [2019-01-12 23:20:04,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 23:20:04,964 INFO L480 AbstractCegarLoop]: Abstraction has 30705 states and 95883 transitions. [2019-01-12 23:20:04,964 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 23:20:04,964 INFO L276 IsEmpty]: Start isEmpty. Operand 30705 states and 95883 transitions. [2019-01-12 23:20:04,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-01-12 23:20:04,968 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 23:20:04,968 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] [2019-01-12 23:20:04,968 INFO L423 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 23:20:04,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 23:20:04,969 INFO L82 PathProgramCache]: Analyzing trace with hash 832863033, now seen corresponding path program 1 times [2019-01-12 23:20:04,969 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 23:20:04,969 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 23:20:04,971 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:20:04,971 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 23:20:04,971 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:20:04,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 23:20:05,147 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 23:20:05,147 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 23:20:05,147 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-12 23:20:05,148 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-12 23:20:05,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-12 23:20:05,148 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-01-12 23:20:05,148 INFO L87 Difference]: Start difference. First operand 30705 states and 95883 transitions. Second operand 6 states. [2019-01-12 23:20:06,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 23:20:06,363 INFO L93 Difference]: Finished difference Result 41099 states and 127044 transitions. [2019-01-12 23:20:06,363 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-12 23:20:06,363 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 55 [2019-01-12 23:20:06,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 23:20:06,445 INFO L225 Difference]: With dead ends: 41099 [2019-01-12 23:20:06,445 INFO L226 Difference]: Without dead ends: 41002 [2019-01-12 23:20:06,446 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2019-01-12 23:20:06,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41002 states. [2019-01-12 23:20:08,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41002 to 30422. [2019-01-12 23:20:08,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30422 states. [2019-01-12 23:20:08,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30422 states to 30422 states and 95055 transitions. [2019-01-12 23:20:08,879 INFO L78 Accepts]: Start accepts. Automaton has 30422 states and 95055 transitions. Word has length 55 [2019-01-12 23:20:08,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 23:20:08,879 INFO L480 AbstractCegarLoop]: Abstraction has 30422 states and 95055 transitions. [2019-01-12 23:20:08,879 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-12 23:20:08,879 INFO L276 IsEmpty]: Start isEmpty. Operand 30422 states and 95055 transitions. [2019-01-12 23:20:08,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-01-12 23:20:08,888 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 23:20:08,888 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] [2019-01-12 23:20:08,888 INFO L423 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 23:20:08,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 23:20:08,889 INFO L82 PathProgramCache]: Analyzing trace with hash 974144113, now seen corresponding path program 1 times [2019-01-12 23:20:08,889 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 23:20:08,889 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 23:20:08,891 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:20:08,891 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 23:20:08,891 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:20:08,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 23:20:09,063 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 23:20:09,063 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 23:20:09,064 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 23:20:09,064 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 23:20:09,064 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 23:20:09,064 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-12 23:20:09,065 INFO L87 Difference]: Start difference. First operand 30422 states and 95055 transitions. Second operand 4 states. [2019-01-12 23:20:09,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 23:20:09,719 INFO L93 Difference]: Finished difference Result 38882 states and 122629 transitions. [2019-01-12 23:20:09,720 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-12 23:20:09,720 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2019-01-12 23:20:09,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 23:20:09,793 INFO L225 Difference]: With dead ends: 38882 [2019-01-12 23:20:09,794 INFO L226 Difference]: Without dead ends: 38882 [2019-01-12 23:20:09,794 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-12 23:20:09,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38882 states. [2019-01-12 23:20:10,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38882 to 34334. [2019-01-12 23:20:10,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34334 states. [2019-01-12 23:20:10,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34334 states to 34334 states and 107598 transitions. [2019-01-12 23:20:10,340 INFO L78 Accepts]: Start accepts. Automaton has 34334 states and 107598 transitions. Word has length 65 [2019-01-12 23:20:10,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 23:20:10,340 INFO L480 AbstractCegarLoop]: Abstraction has 34334 states and 107598 transitions. [2019-01-12 23:20:10,340 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 23:20:10,340 INFO L276 IsEmpty]: Start isEmpty. Operand 34334 states and 107598 transitions. [2019-01-12 23:20:10,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-01-12 23:20:10,349 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 23:20:10,350 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] [2019-01-12 23:20:10,350 INFO L423 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 23:20:10,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 23:20:10,350 INFO L82 PathProgramCache]: Analyzing trace with hash -1578012848, now seen corresponding path program 1 times [2019-01-12 23:20:10,350 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 23:20:10,351 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 23:20:10,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:20:10,352 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 23:20:10,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:20:10,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 23:20:10,704 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 23:20:10,705 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 23:20:10,705 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-12 23:20:10,705 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-12 23:20:10,705 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-12 23:20:10,706 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-01-12 23:20:10,707 INFO L87 Difference]: Start difference. First operand 34334 states and 107598 transitions. Second operand 6 states. [2019-01-12 23:20:12,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 23:20:12,034 INFO L93 Difference]: Finished difference Result 69687 states and 216652 transitions. [2019-01-12 23:20:12,035 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-01-12 23:20:12,035 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 65 [2019-01-12 23:20:12,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 23:20:12,175 INFO L225 Difference]: With dead ends: 69687 [2019-01-12 23:20:12,176 INFO L226 Difference]: Without dead ends: 69623 [2019-01-12 23:20:12,176 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2019-01-12 23:20:12,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69623 states. [2019-01-12 23:20:12,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69623 to 39278. [2019-01-12 23:20:12,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39278 states. [2019-01-12 23:20:12,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39278 states to 39278 states and 121532 transitions. [2019-01-12 23:20:12,966 INFO L78 Accepts]: Start accepts. Automaton has 39278 states and 121532 transitions. Word has length 65 [2019-01-12 23:20:12,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 23:20:12,967 INFO L480 AbstractCegarLoop]: Abstraction has 39278 states and 121532 transitions. [2019-01-12 23:20:12,967 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-12 23:20:12,967 INFO L276 IsEmpty]: Start isEmpty. Operand 39278 states and 121532 transitions. [2019-01-12 23:20:12,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-01-12 23:20:12,986 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 23:20:12,986 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 23:20:12,986 INFO L423 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 23:20:12,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 23:20:12,987 INFO L82 PathProgramCache]: Analyzing trace with hash 528284993, now seen corresponding path program 1 times [2019-01-12 23:20:12,987 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 23:20:12,987 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 23:20:12,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:20:12,989 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 23:20:12,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:20:12,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 23:20:13,071 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 23:20:13,071 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 23:20:13,071 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 23:20:13,072 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 23:20:13,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 23:20:13,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 23:20:13,072 INFO L87 Difference]: Start difference. First operand 39278 states and 121532 transitions. Second operand 3 states. [2019-01-12 23:20:13,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 23:20:13,538 INFO L93 Difference]: Finished difference Result 44931 states and 137017 transitions. [2019-01-12 23:20:13,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 23:20:13,539 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 71 [2019-01-12 23:20:13,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 23:20:13,618 INFO L225 Difference]: With dead ends: 44931 [2019-01-12 23:20:13,618 INFO L226 Difference]: Without dead ends: 44931 [2019-01-12 23:20:13,618 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 23:20:13,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44931 states. [2019-01-12 23:20:14,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44931 to 38918. [2019-01-12 23:20:14,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38918 states. [2019-01-12 23:20:14,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38918 states to 38918 states and 117882 transitions. [2019-01-12 23:20:14,225 INFO L78 Accepts]: Start accepts. Automaton has 38918 states and 117882 transitions. Word has length 71 [2019-01-12 23:20:14,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 23:20:14,225 INFO L480 AbstractCegarLoop]: Abstraction has 38918 states and 117882 transitions. [2019-01-12 23:20:14,225 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 23:20:14,225 INFO L276 IsEmpty]: Start isEmpty. Operand 38918 states and 117882 transitions. [2019-01-12 23:20:14,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-01-12 23:20:14,243 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 23:20:14,244 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 23:20:14,244 INFO L423 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 23:20:14,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 23:20:14,244 INFO L82 PathProgramCache]: Analyzing trace with hash -1549015799, now seen corresponding path program 1 times [2019-01-12 23:20:14,244 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 23:20:14,245 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 23:20:14,246 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:20:14,246 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 23:20:14,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:20:14,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 23:20:15,101 WARN L181 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 9 [2019-01-12 23:20:15,106 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 23:20:15,106 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 23:20:15,106 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-01-12 23:20:15,107 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-12 23:20:15,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-12 23:20:15,107 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-01-12 23:20:15,107 INFO L87 Difference]: Start difference. First operand 38918 states and 117882 transitions. Second operand 8 states. [2019-01-12 23:20:17,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 23:20:17,464 INFO L93 Difference]: Finished difference Result 62859 states and 188232 transitions. [2019-01-12 23:20:17,465 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-12 23:20:17,465 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 72 [2019-01-12 23:20:17,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 23:20:17,591 INFO L225 Difference]: With dead ends: 62859 [2019-01-12 23:20:17,591 INFO L226 Difference]: Without dead ends: 62859 [2019-01-12 23:20:17,592 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2019-01-12 23:20:17,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62859 states. [2019-01-12 23:20:18,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62859 to 47150. [2019-01-12 23:20:18,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47150 states. [2019-01-12 23:20:18,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47150 states to 47150 states and 142644 transitions. [2019-01-12 23:20:18,461 INFO L78 Accepts]: Start accepts. Automaton has 47150 states and 142644 transitions. Word has length 72 [2019-01-12 23:20:18,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 23:20:18,462 INFO L480 AbstractCegarLoop]: Abstraction has 47150 states and 142644 transitions. [2019-01-12 23:20:18,462 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-12 23:20:18,462 INFO L276 IsEmpty]: Start isEmpty. Operand 47150 states and 142644 transitions. [2019-01-12 23:20:18,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-01-12 23:20:18,484 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 23:20:18,484 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 23:20:18,484 INFO L423 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 23:20:18,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 23:20:18,485 INFO L82 PathProgramCache]: Analyzing trace with hash -661512118, now seen corresponding path program 1 times [2019-01-12 23:20:18,485 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 23:20:18,485 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 23:20:18,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:20:18,487 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 23:20:18,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:20:18,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 23:20:18,583 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 23:20:18,583 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 23:20:18,583 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-12 23:20:18,584 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 23:20:18,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 23:20:18,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-01-12 23:20:18,584 INFO L87 Difference]: Start difference. First operand 47150 states and 142644 transitions. Second operand 5 states. [2019-01-12 23:20:18,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 23:20:18,679 INFO L93 Difference]: Finished difference Result 13174 states and 33006 transitions. [2019-01-12 23:20:18,680 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-12 23:20:18,680 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 72 [2019-01-12 23:20:18,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 23:20:18,695 INFO L225 Difference]: With dead ends: 13174 [2019-01-12 23:20:18,695 INFO L226 Difference]: Without dead ends: 11054 [2019-01-12 23:20:18,696 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-01-12 23:20:18,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11054 states. [2019-01-12 23:20:18,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11054 to 8483. [2019-01-12 23:20:18,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8483 states. [2019-01-12 23:20:18,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8483 states to 8483 states and 21178 transitions. [2019-01-12 23:20:18,810 INFO L78 Accepts]: Start accepts. Automaton has 8483 states and 21178 transitions. Word has length 72 [2019-01-12 23:20:18,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 23:20:18,810 INFO L480 AbstractCegarLoop]: Abstraction has 8483 states and 21178 transitions. [2019-01-12 23:20:18,810 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 23:20:18,810 INFO L276 IsEmpty]: Start isEmpty. Operand 8483 states and 21178 transitions. [2019-01-12 23:20:18,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-01-12 23:20:18,823 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 23:20:18,824 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 23:20:18,824 INFO L423 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 23:20:18,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 23:20:18,824 INFO L82 PathProgramCache]: Analyzing trace with hash 413155182, now seen corresponding path program 1 times [2019-01-12 23:20:18,824 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 23:20:18,825 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 23:20:18,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:20:18,826 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 23:20:18,827 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:20:18,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 23:20:19,044 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 23:20:19,045 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 23:20:19,045 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 23:20:19,045 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 23:20:19,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 23:20:19,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 23:20:19,046 INFO L87 Difference]: Start difference. First operand 8483 states and 21178 transitions. Second operand 4 states. [2019-01-12 23:20:19,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 23:20:19,404 INFO L93 Difference]: Finished difference Result 13649 states and 32650 transitions. [2019-01-12 23:20:19,405 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 23:20:19,405 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 100 [2019-01-12 23:20:19,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 23:20:19,423 INFO L225 Difference]: With dead ends: 13649 [2019-01-12 23:20:19,423 INFO L226 Difference]: Without dead ends: 13649 [2019-01-12 23:20:19,424 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 23:20:19,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13649 states. [2019-01-12 23:20:19,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13649 to 11479. [2019-01-12 23:20:19,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11479 states. [2019-01-12 23:20:19,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11479 states to 11479 states and 28114 transitions. [2019-01-12 23:20:19,572 INFO L78 Accepts]: Start accepts. Automaton has 11479 states and 28114 transitions. Word has length 100 [2019-01-12 23:20:19,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 23:20:19,573 INFO L480 AbstractCegarLoop]: Abstraction has 11479 states and 28114 transitions. [2019-01-12 23:20:19,573 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 23:20:19,573 INFO L276 IsEmpty]: Start isEmpty. Operand 11479 states and 28114 transitions. [2019-01-12 23:20:19,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-01-12 23:20:19,585 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 23:20:19,585 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 23:20:19,585 INFO L423 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 23:20:19,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 23:20:19,586 INFO L82 PathProgramCache]: Analyzing trace with hash 624506095, now seen corresponding path program 1 times [2019-01-12 23:20:19,586 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 23:20:19,586 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 23:20:19,587 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:20:19,587 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 23:20:19,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:20:19,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 23:20:19,906 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 23:20:19,906 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 23:20:19,907 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-12 23:20:19,907 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 23:20:19,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 23:20:19,907 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-12 23:20:19,908 INFO L87 Difference]: Start difference. First operand 11479 states and 28114 transitions. Second operand 5 states. [2019-01-12 23:20:20,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 23:20:20,631 INFO L93 Difference]: Finished difference Result 15815 states and 37478 transitions. [2019-01-12 23:20:20,632 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-12 23:20:20,632 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 100 [2019-01-12 23:20:20,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 23:20:20,652 INFO L225 Difference]: With dead ends: 15815 [2019-01-12 23:20:20,652 INFO L226 Difference]: Without dead ends: 15815 [2019-01-12 23:20:20,652 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-12 23:20:20,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15815 states. [2019-01-12 23:20:20,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15815 to 12639. [2019-01-12 23:20:20,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12639 states. [2019-01-12 23:20:20,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12639 states to 12639 states and 30645 transitions. [2019-01-12 23:20:20,825 INFO L78 Accepts]: Start accepts. Automaton has 12639 states and 30645 transitions. Word has length 100 [2019-01-12 23:20:20,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 23:20:20,826 INFO L480 AbstractCegarLoop]: Abstraction has 12639 states and 30645 transitions. [2019-01-12 23:20:20,826 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 23:20:20,826 INFO L276 IsEmpty]: Start isEmpty. Operand 12639 states and 30645 transitions. [2019-01-12 23:20:20,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-01-12 23:20:20,845 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 23:20:20,845 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 23:20:20,845 INFO L423 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 23:20:20,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 23:20:20,845 INFO L82 PathProgramCache]: Analyzing trace with hash -831609299, now seen corresponding path program 1 times [2019-01-12 23:20:20,846 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 23:20:20,846 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 23:20:20,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:20:20,848 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 23:20:20,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:20:20,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 23:20:20,960 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 23:20:20,961 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 23:20:20,961 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 23:20:20,961 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 23:20:20,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 23:20:20,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-12 23:20:20,962 INFO L87 Difference]: Start difference. First operand 12639 states and 30645 transitions. Second operand 4 states. [2019-01-12 23:20:21,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 23:20:21,369 INFO L93 Difference]: Finished difference Result 14159 states and 33926 transitions. [2019-01-12 23:20:21,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 23:20:21,370 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 100 [2019-01-12 23:20:21,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 23:20:21,392 INFO L225 Difference]: With dead ends: 14159 [2019-01-12 23:20:21,392 INFO L226 Difference]: Without dead ends: 14159 [2019-01-12 23:20:21,393 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-12 23:20:21,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14159 states. [2019-01-12 23:20:21,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14159 to 12778. [2019-01-12 23:20:21,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12778 states. [2019-01-12 23:20:21,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12778 states to 12778 states and 31002 transitions. [2019-01-12 23:20:21,562 INFO L78 Accepts]: Start accepts. Automaton has 12778 states and 31002 transitions. Word has length 100 [2019-01-12 23:20:21,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 23:20:21,562 INFO L480 AbstractCegarLoop]: Abstraction has 12778 states and 31002 transitions. [2019-01-12 23:20:21,562 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 23:20:21,562 INFO L276 IsEmpty]: Start isEmpty. Operand 12778 states and 31002 transitions. [2019-01-12 23:20:21,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-01-12 23:20:21,583 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 23:20:21,584 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 23:20:21,584 INFO L423 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 23:20:21,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 23:20:21,584 INFO L82 PathProgramCache]: Analyzing trace with hash 1386148654, now seen corresponding path program 1 times [2019-01-12 23:20:21,584 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 23:20:21,585 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 23:20:21,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:20:21,586 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 23:20:21,587 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:20:21,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 23:20:21,699 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 23:20:21,699 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 23:20:21,699 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 23:20:21,700 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 23:20:21,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 23:20:21,700 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 23:20:21,700 INFO L87 Difference]: Start difference. First operand 12778 states and 31002 transitions. Second operand 3 states. [2019-01-12 23:20:21,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 23:20:21,972 INFO L93 Difference]: Finished difference Result 13703 states and 32464 transitions. [2019-01-12 23:20:21,973 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 23:20:21,973 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 100 [2019-01-12 23:20:21,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 23:20:21,992 INFO L225 Difference]: With dead ends: 13703 [2019-01-12 23:20:21,992 INFO L226 Difference]: Without dead ends: 13703 [2019-01-12 23:20:21,993 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 23:20:22,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13703 states. [2019-01-12 23:20:22,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13703 to 12820. [2019-01-12 23:20:22,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12820 states. [2019-01-12 23:20:22,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12820 states to 12820 states and 30570 transitions. [2019-01-12 23:20:22,148 INFO L78 Accepts]: Start accepts. Automaton has 12820 states and 30570 transitions. Word has length 100 [2019-01-12 23:20:22,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 23:20:22,148 INFO L480 AbstractCegarLoop]: Abstraction has 12820 states and 30570 transitions. [2019-01-12 23:20:22,148 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 23:20:22,148 INFO L276 IsEmpty]: Start isEmpty. Operand 12820 states and 30570 transitions. [2019-01-12 23:20:22,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-01-12 23:20:22,163 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 23:20:22,163 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 23:20:22,163 INFO L423 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 23:20:22,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 23:20:22,164 INFO L82 PathProgramCache]: Analyzing trace with hash 547720326, now seen corresponding path program 2 times [2019-01-12 23:20:22,164 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 23:20:22,164 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 23:20:22,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:20:22,167 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 23:20:22,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:20:22,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 23:20:22,337 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 23:20:22,338 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 23:20:22,338 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-12 23:20:22,338 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-12 23:20:22,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-12 23:20:22,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-01-12 23:20:22,339 INFO L87 Difference]: Start difference. First operand 12820 states and 30570 transitions. Second operand 6 states. [2019-01-12 23:20:24,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 23:20:24,196 INFO L93 Difference]: Finished difference Result 15657 states and 37183 transitions. [2019-01-12 23:20:24,197 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-12 23:20:24,197 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 100 [2019-01-12 23:20:24,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 23:20:24,217 INFO L225 Difference]: With dead ends: 15657 [2019-01-12 23:20:24,217 INFO L226 Difference]: Without dead ends: 15657 [2019-01-12 23:20:24,218 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-01-12 23:20:24,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15657 states. [2019-01-12 23:20:24,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15657 to 12729. [2019-01-12 23:20:24,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12729 states. [2019-01-12 23:20:24,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12729 states to 12729 states and 30250 transitions. [2019-01-12 23:20:24,385 INFO L78 Accepts]: Start accepts. Automaton has 12729 states and 30250 transitions. Word has length 100 [2019-01-12 23:20:24,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 23:20:24,385 INFO L480 AbstractCegarLoop]: Abstraction has 12729 states and 30250 transitions. [2019-01-12 23:20:24,385 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-12 23:20:24,385 INFO L276 IsEmpty]: Start isEmpty. Operand 12729 states and 30250 transitions. [2019-01-12 23:20:24,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-01-12 23:20:24,399 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 23:20:24,399 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 23:20:24,400 INFO L423 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 23:20:24,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 23:20:24,400 INFO L82 PathProgramCache]: Analyzing trace with hash -737354110, now seen corresponding path program 1 times [2019-01-12 23:20:24,400 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 23:20:24,400 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 23:20:24,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:20:24,402 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 23:20:24,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:20:24,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 23:20:24,969 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 23:20:24,970 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 23:20:24,970 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-12 23:20:24,970 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-12 23:20:24,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-12 23:20:24,971 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-01-12 23:20:24,971 INFO L87 Difference]: Start difference. First operand 12729 states and 30250 transitions. Second operand 7 states. [2019-01-12 23:20:25,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 23:20:25,721 INFO L93 Difference]: Finished difference Result 16874 states and 39604 transitions. [2019-01-12 23:20:25,722 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-12 23:20:25,722 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 102 [2019-01-12 23:20:25,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 23:20:25,743 INFO L225 Difference]: With dead ends: 16874 [2019-01-12 23:20:25,744 INFO L226 Difference]: Without dead ends: 16874 [2019-01-12 23:20:25,744 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 23:20:25,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16874 states. [2019-01-12 23:20:25,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16874 to 14579. [2019-01-12 23:20:25,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14579 states. [2019-01-12 23:20:25,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14579 states to 14579 states and 34666 transitions. [2019-01-12 23:20:25,931 INFO L78 Accepts]: Start accepts. Automaton has 14579 states and 34666 transitions. Word has length 102 [2019-01-12 23:20:25,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 23:20:25,932 INFO L480 AbstractCegarLoop]: Abstraction has 14579 states and 34666 transitions. [2019-01-12 23:20:25,932 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-12 23:20:25,932 INFO L276 IsEmpty]: Start isEmpty. Operand 14579 states and 34666 transitions. [2019-01-12 23:20:25,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-01-12 23:20:25,947 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 23:20:25,948 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 23:20:25,948 INFO L423 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 23:20:25,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 23:20:25,948 INFO L82 PathProgramCache]: Analyzing trace with hash -992090655, now seen corresponding path program 1 times [2019-01-12 23:20:25,948 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 23:20:25,949 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 23:20:25,950 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:20:25,950 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 23:20:25,950 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:20:25,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 23:20:26,324 WARN L181 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 10 [2019-01-12 23:20:26,404 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 23:20:26,404 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 23:20:26,404 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-12 23:20:26,405 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-12 23:20:26,405 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-12 23:20:26,405 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-01-12 23:20:26,405 INFO L87 Difference]: Start difference. First operand 14579 states and 34666 transitions. Second operand 6 states. [2019-01-12 23:20:26,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 23:20:26,645 INFO L93 Difference]: Finished difference Result 14435 states and 34098 transitions. [2019-01-12 23:20:26,646 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-12 23:20:26,646 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 102 [2019-01-12 23:20:26,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 23:20:26,666 INFO L225 Difference]: With dead ends: 14435 [2019-01-12 23:20:26,666 INFO L226 Difference]: Without dead ends: 14435 [2019-01-12 23:20:26,666 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-01-12 23:20:26,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14435 states. [2019-01-12 23:20:26,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14435 to 12901. [2019-01-12 23:20:26,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12901 states. [2019-01-12 23:20:27,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12901 states to 12901 states and 30592 transitions. [2019-01-12 23:20:27,021 INFO L78 Accepts]: Start accepts. Automaton has 12901 states and 30592 transitions. Word has length 102 [2019-01-12 23:20:27,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 23:20:27,021 INFO L480 AbstractCegarLoop]: Abstraction has 12901 states and 30592 transitions. [2019-01-12 23:20:27,021 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-12 23:20:27,021 INFO L276 IsEmpty]: Start isEmpty. Operand 12901 states and 30592 transitions. [2019-01-12 23:20:27,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-01-12 23:20:27,036 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 23:20:27,036 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 23:20:27,036 INFO L423 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 23:20:27,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 23:20:27,036 INFO L82 PathProgramCache]: Analyzing trace with hash 1178525344, now seen corresponding path program 1 times [2019-01-12 23:20:27,037 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 23:20:27,037 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 23:20:27,038 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:20:27,038 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 23:20:27,038 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:20:27,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 23:20:27,349 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 23:20:27,350 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 23:20:27,350 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-12 23:20:27,351 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 23:20:27,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 23:20:27,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-12 23:20:27,351 INFO L87 Difference]: Start difference. First operand 12901 states and 30592 transitions. Second operand 5 states. [2019-01-12 23:20:27,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 23:20:27,724 INFO L93 Difference]: Finished difference Result 15095 states and 35234 transitions. [2019-01-12 23:20:27,725 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-12 23:20:27,725 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 102 [2019-01-12 23:20:27,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 23:20:27,744 INFO L225 Difference]: With dead ends: 15095 [2019-01-12 23:20:27,744 INFO L226 Difference]: Without dead ends: 15095 [2019-01-12 23:20:27,745 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 1 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 23:20:27,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15095 states. [2019-01-12 23:20:27,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15095 to 13074. [2019-01-12 23:20:27,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13074 states. [2019-01-12 23:20:27,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13074 states to 13074 states and 30961 transitions. [2019-01-12 23:20:27,909 INFO L78 Accepts]: Start accepts. Automaton has 13074 states and 30961 transitions. Word has length 102 [2019-01-12 23:20:27,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 23:20:27,909 INFO L480 AbstractCegarLoop]: Abstraction has 13074 states and 30961 transitions. [2019-01-12 23:20:27,909 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 23:20:27,909 INFO L276 IsEmpty]: Start isEmpty. Operand 13074 states and 30961 transitions. [2019-01-12 23:20:27,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-01-12 23:20:27,924 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 23:20:27,924 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, 1] [2019-01-12 23:20:27,924 INFO L423 AbstractCegarLoop]: === Iteration 21 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 23:20:27,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 23:20:27,925 INFO L82 PathProgramCache]: Analyzing trace with hash -877577123, now seen corresponding path program 1 times [2019-01-12 23:20:27,925 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 23:20:27,925 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 23:20:27,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:20:27,926 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 23:20:27,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:20:27,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 23:20:28,172 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 23:20:28,173 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 23:20:28,173 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-12 23:20:28,173 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-12 23:20:28,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-12 23:20:28,174 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-01-12 23:20:28,174 INFO L87 Difference]: Start difference. First operand 13074 states and 30961 transitions. Second operand 7 states. [2019-01-12 23:20:28,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 23:20:28,538 INFO L93 Difference]: Finished difference Result 13866 states and 32682 transitions. [2019-01-12 23:20:28,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-12 23:20:28,539 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 104 [2019-01-12 23:20:28,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 23:20:28,557 INFO L225 Difference]: With dead ends: 13866 [2019-01-12 23:20:28,557 INFO L226 Difference]: Without dead ends: 13866 [2019-01-12 23:20:28,557 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2019-01-12 23:20:28,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13866 states. [2019-01-12 23:20:28,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13866 to 13701. [2019-01-12 23:20:28,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13701 states. [2019-01-12 23:20:28,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13701 states to 13701 states and 32353 transitions. [2019-01-12 23:20:28,713 INFO L78 Accepts]: Start accepts. Automaton has 13701 states and 32353 transitions. Word has length 104 [2019-01-12 23:20:28,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 23:20:28,713 INFO L480 AbstractCegarLoop]: Abstraction has 13701 states and 32353 transitions. [2019-01-12 23:20:28,713 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-12 23:20:28,713 INFO L276 IsEmpty]: Start isEmpty. Operand 13701 states and 32353 transitions. [2019-01-12 23:20:28,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-01-12 23:20:28,727 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 23:20:28,728 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, 1] [2019-01-12 23:20:28,728 INFO L423 AbstractCegarLoop]: === Iteration 22 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 23:20:28,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 23:20:28,728 INFO L82 PathProgramCache]: Analyzing trace with hash 9926558, now seen corresponding path program 1 times [2019-01-12 23:20:28,728 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 23:20:28,728 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 23:20:28,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:20:28,731 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 23:20:28,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:20:28,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 23:20:29,015 WARN L181 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2019-01-12 23:20:29,096 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 23:20:29,096 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 23:20:29,096 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-01-12 23:20:29,096 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-12 23:20:29,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-12 23:20:29,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2019-01-12 23:20:29,097 INFO L87 Difference]: Start difference. First operand 13701 states and 32353 transitions. Second operand 12 states. [2019-01-12 23:20:30,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 23:20:30,654 INFO L93 Difference]: Finished difference Result 24994 states and 58304 transitions. [2019-01-12 23:20:30,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-01-12 23:20:30,655 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 104 [2019-01-12 23:20:30,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 23:20:30,682 INFO L225 Difference]: With dead ends: 24994 [2019-01-12 23:20:30,683 INFO L226 Difference]: Without dead ends: 22770 [2019-01-12 23:20:30,683 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 138 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=144, Invalid=612, Unknown=0, NotChecked=0, Total=756 [2019-01-12 23:20:30,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22770 states. [2019-01-12 23:20:30,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22770 to 17208. [2019-01-12 23:20:30,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17208 states. [2019-01-12 23:20:30,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17208 states to 17208 states and 40512 transitions. [2019-01-12 23:20:30,935 INFO L78 Accepts]: Start accepts. Automaton has 17208 states and 40512 transitions. Word has length 104 [2019-01-12 23:20:30,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 23:20:30,935 INFO L480 AbstractCegarLoop]: Abstraction has 17208 states and 40512 transitions. [2019-01-12 23:20:30,935 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-12 23:20:30,936 INFO L276 IsEmpty]: Start isEmpty. Operand 17208 states and 40512 transitions. [2019-01-12 23:20:30,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-01-12 23:20:30,953 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 23:20:30,953 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, 1] [2019-01-12 23:20:30,954 INFO L423 AbstractCegarLoop]: === Iteration 23 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 23:20:30,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 23:20:30,954 INFO L82 PathProgramCache]: Analyzing trace with hash -1162077692, now seen corresponding path program 2 times [2019-01-12 23:20:30,954 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 23:20:30,954 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 23:20:30,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:20:30,956 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 23:20:30,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:20:30,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 23:20:31,057 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 23:20:31,058 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 23:20:31,058 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 23:20:31,059 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 23:20:31,060 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 23:20:31,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 23:20:31,060 INFO L87 Difference]: Start difference. First operand 17208 states and 40512 transitions. Second operand 3 states. [2019-01-12 23:20:31,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 23:20:31,319 INFO L93 Difference]: Finished difference Result 17958 states and 42059 transitions. [2019-01-12 23:20:31,321 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 23:20:31,321 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 104 [2019-01-12 23:20:31,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 23:20:31,357 INFO L225 Difference]: With dead ends: 17958 [2019-01-12 23:20:31,358 INFO L226 Difference]: Without dead ends: 17958 [2019-01-12 23:20:31,358 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 23:20:31,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17958 states. [2019-01-12 23:20:31,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17958 to 17820. [2019-01-12 23:20:31,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17820 states. [2019-01-12 23:20:31,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17820 states to 17820 states and 41770 transitions. [2019-01-12 23:20:31,688 INFO L78 Accepts]: Start accepts. Automaton has 17820 states and 41770 transitions. Word has length 104 [2019-01-12 23:20:31,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 23:20:31,689 INFO L480 AbstractCegarLoop]: Abstraction has 17820 states and 41770 transitions. [2019-01-12 23:20:31,690 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 23:20:31,690 INFO L276 IsEmpty]: Start isEmpty. Operand 17820 states and 41770 transitions. [2019-01-12 23:20:31,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-01-12 23:20:31,719 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 23:20:31,720 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, 1] [2019-01-12 23:20:31,720 INFO L423 AbstractCegarLoop]: === Iteration 24 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 23:20:31,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 23:20:31,720 INFO L82 PathProgramCache]: Analyzing trace with hash -1008732426, now seen corresponding path program 3 times [2019-01-12 23:20:31,721 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 23:20:31,724 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 23:20:31,725 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:20:31,725 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 23:20:31,726 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:20:31,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 23:20:31,981 WARN L181 SmtUtils]: Spent 175.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-01-12 23:20:32,696 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 23:20:32,696 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 23:20:32,697 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-01-12 23:20:32,697 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-12 23:20:32,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-12 23:20:32,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-01-12 23:20:32,700 INFO L87 Difference]: Start difference. First operand 17820 states and 41770 transitions. Second operand 8 states. [2019-01-12 23:20:33,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 23:20:33,616 INFO L93 Difference]: Finished difference Result 22686 states and 53384 transitions. [2019-01-12 23:20:33,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-12 23:20:33,617 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 104 [2019-01-12 23:20:33,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 23:20:33,623 INFO L225 Difference]: With dead ends: 22686 [2019-01-12 23:20:33,623 INFO L226 Difference]: Without dead ends: 4139 [2019-01-12 23:20:33,623 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2019-01-12 23:20:33,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4139 states. [2019-01-12 23:20:33,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4139 to 4137. [2019-01-12 23:20:33,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4137 states. [2019-01-12 23:20:33,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4137 states to 4137 states and 9865 transitions. [2019-01-12 23:20:33,666 INFO L78 Accepts]: Start accepts. Automaton has 4137 states and 9865 transitions. Word has length 104 [2019-01-12 23:20:33,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 23:20:33,666 INFO L480 AbstractCegarLoop]: Abstraction has 4137 states and 9865 transitions. [2019-01-12 23:20:33,666 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-12 23:20:33,666 INFO L276 IsEmpty]: Start isEmpty. Operand 4137 states and 9865 transitions. [2019-01-12 23:20:33,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-01-12 23:20:33,671 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 23:20:33,671 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, 1] [2019-01-12 23:20:33,671 INFO L423 AbstractCegarLoop]: === Iteration 25 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 23:20:33,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 23:20:33,672 INFO L82 PathProgramCache]: Analyzing trace with hash 1995678679, now seen corresponding path program 2 times [2019-01-12 23:20:33,672 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 23:20:33,672 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 23:20:33,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:20:33,674 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 23:20:33,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:20:33,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 23:20:34,026 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 23:20:34,027 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 23:20:34,027 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-01-12 23:20:34,027 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-12 23:20:34,028 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-12 23:20:34,028 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2019-01-12 23:20:34,028 INFO L87 Difference]: Start difference. First operand 4137 states and 9865 transitions. Second operand 12 states. [2019-01-12 23:20:34,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 23:20:34,899 INFO L93 Difference]: Finished difference Result 5618 states and 13094 transitions. [2019-01-12 23:20:34,900 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-01-12 23:20:34,900 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 104 [2019-01-12 23:20:34,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 23:20:34,907 INFO L225 Difference]: With dead ends: 5618 [2019-01-12 23:20:34,907 INFO L226 Difference]: Without dead ends: 5618 [2019-01-12 23:20:34,908 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=81, Invalid=299, Unknown=0, NotChecked=0, Total=380 [2019-01-12 23:20:34,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5618 states. [2019-01-12 23:20:34,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5618 to 4216. [2019-01-12 23:20:34,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4216 states. [2019-01-12 23:20:34,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4216 states to 4216 states and 9981 transitions. [2019-01-12 23:20:34,957 INFO L78 Accepts]: Start accepts. Automaton has 4216 states and 9981 transitions. Word has length 104 [2019-01-12 23:20:34,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 23:20:34,957 INFO L480 AbstractCegarLoop]: Abstraction has 4216 states and 9981 transitions. [2019-01-12 23:20:34,957 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-12 23:20:34,957 INFO L276 IsEmpty]: Start isEmpty. Operand 4216 states and 9981 transitions. [2019-01-12 23:20:34,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-01-12 23:20:34,962 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 23:20:34,962 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, 1] [2019-01-12 23:20:34,962 INFO L423 AbstractCegarLoop]: === Iteration 26 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 23:20:34,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 23:20:34,963 INFO L82 PathProgramCache]: Analyzing trace with hash -1411784936, now seen corresponding path program 4 times [2019-01-12 23:20:34,963 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 23:20:34,963 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 23:20:34,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:20:34,964 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 23:20:34,965 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:20:34,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 23:20:35,246 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 23:20:35,247 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 23:20:35,247 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-01-12 23:20:35,247 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-01-12 23:20:35,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-01-12 23:20:35,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2019-01-12 23:20:35,248 INFO L87 Difference]: Start difference. First operand 4216 states and 9981 transitions. Second operand 13 states. [2019-01-12 23:20:36,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 23:20:36,205 INFO L93 Difference]: Finished difference Result 6402 states and 14941 transitions. [2019-01-12 23:20:36,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-01-12 23:20:36,206 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 104 [2019-01-12 23:20:36,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 23:20:36,213 INFO L225 Difference]: With dead ends: 6402 [2019-01-12 23:20:36,214 INFO L226 Difference]: Without dead ends: 4751 [2019-01-12 23:20:36,214 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 23:20:36,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4751 states. [2019-01-12 23:20:36,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4751 to 4257. [2019-01-12 23:20:36,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4257 states. [2019-01-12 23:20:36,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4257 states to 4257 states and 10024 transitions. [2019-01-12 23:20:36,260 INFO L78 Accepts]: Start accepts. Automaton has 4257 states and 10024 transitions. Word has length 104 [2019-01-12 23:20:36,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 23:20:36,261 INFO L480 AbstractCegarLoop]: Abstraction has 4257 states and 10024 transitions. [2019-01-12 23:20:36,261 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-01-12 23:20:36,261 INFO L276 IsEmpty]: Start isEmpty. Operand 4257 states and 10024 transitions. [2019-01-12 23:20:36,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-01-12 23:20:36,265 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 23:20:36,266 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, 1] [2019-01-12 23:20:36,266 INFO L423 AbstractCegarLoop]: === Iteration 27 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 23:20:36,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 23:20:36,266 INFO L82 PathProgramCache]: Analyzing trace with hash 248602942, now seen corresponding path program 5 times [2019-01-12 23:20:36,266 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 23:20:36,267 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 23:20:36,268 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:20:36,268 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 23:20:36,268 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:20:36,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 23:20:36,525 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 23:20:36,525 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 23:20:36,525 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-01-12 23:20:36,526 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-01-12 23:20:36,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-01-12 23:20:36,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=156, Unknown=0, NotChecked=0, Total=182 [2019-01-12 23:20:36,526 INFO L87 Difference]: Start difference. First operand 4257 states and 10024 transitions. Second operand 14 states. [2019-01-12 23:20:37,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 23:20:37,333 INFO L93 Difference]: Finished difference Result 8225 states and 19552 transitions. [2019-01-12 23:20:37,333 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-01-12 23:20:37,334 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 104 [2019-01-12 23:20:37,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 23:20:37,341 INFO L225 Difference]: With dead ends: 8225 [2019-01-12 23:20:37,341 INFO L226 Difference]: Without dead ends: 5020 [2019-01-12 23:20:37,342 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=84, Invalid=468, Unknown=0, NotChecked=0, Total=552 [2019-01-12 23:20:37,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5020 states. [2019-01-12 23:20:37,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5020 to 4987. [2019-01-12 23:20:37,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4987 states. [2019-01-12 23:20:37,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4987 states to 4987 states and 11831 transitions. [2019-01-12 23:20:37,392 INFO L78 Accepts]: Start accepts. Automaton has 4987 states and 11831 transitions. Word has length 104 [2019-01-12 23:20:37,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 23:20:37,393 INFO L480 AbstractCegarLoop]: Abstraction has 4987 states and 11831 transitions. [2019-01-12 23:20:37,393 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-01-12 23:20:37,393 INFO L276 IsEmpty]: Start isEmpty. Operand 4987 states and 11831 transitions. [2019-01-12 23:20:37,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-01-12 23:20:37,398 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 23:20:37,398 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, 1] [2019-01-12 23:20:37,399 INFO L423 AbstractCegarLoop]: === Iteration 28 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 23:20:37,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 23:20:37,399 INFO L82 PathProgramCache]: Analyzing trace with hash 1469195098, now seen corresponding path program 6 times [2019-01-12 23:20:37,399 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 23:20:37,399 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 23:20:37,401 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:20:37,401 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 23:20:37,401 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:20:37,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 23:20:37,626 WARN L181 SmtUtils]: Spent 157.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2019-01-12 23:20:37,731 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 23:20:37,731 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 23:20:37,731 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-01-12 23:20:37,732 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-01-12 23:20:37,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-01-12 23:20:37,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2019-01-12 23:20:37,732 INFO L87 Difference]: Start difference. First operand 4987 states and 11831 transitions. Second operand 13 states. [2019-01-12 23:20:38,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 23:20:38,656 INFO L93 Difference]: Finished difference Result 7552 states and 17890 transitions. [2019-01-12 23:20:38,657 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-01-12 23:20:38,657 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 104 [2019-01-12 23:20:38,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 23:20:38,666 INFO L225 Difference]: With dead ends: 7552 [2019-01-12 23:20:38,666 INFO L226 Difference]: Without dead ends: 6667 [2019-01-12 23:20:38,667 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=99, Invalid=453, Unknown=0, NotChecked=0, Total=552 [2019-01-12 23:20:38,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6667 states. [2019-01-12 23:20:38,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6667 to 4962. [2019-01-12 23:20:38,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4962 states. [2019-01-12 23:20:38,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4962 states to 4962 states and 11766 transitions. [2019-01-12 23:20:38,730 INFO L78 Accepts]: Start accepts. Automaton has 4962 states and 11766 transitions. Word has length 104 [2019-01-12 23:20:38,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 23:20:38,731 INFO L480 AbstractCegarLoop]: Abstraction has 4962 states and 11766 transitions. [2019-01-12 23:20:38,731 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-01-12 23:20:38,731 INFO L276 IsEmpty]: Start isEmpty. Operand 4962 states and 11766 transitions. [2019-01-12 23:20:38,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-01-12 23:20:38,736 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 23:20:38,736 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, 1] [2019-01-12 23:20:38,737 INFO L423 AbstractCegarLoop]: === Iteration 29 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 23:20:38,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 23:20:38,737 INFO L82 PathProgramCache]: Analyzing trace with hash -720978081, now seen corresponding path program 1 times [2019-01-12 23:20:38,737 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 23:20:38,737 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 23:20:38,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:20:38,739 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 23:20:38,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:20:38,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-12 23:20:38,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-12 23:20:38,836 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-01-12 23:20:39,021 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2019-01-12 23:20:39,025 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.01 11:20:39 BasicIcfg [2019-01-12 23:20:39,027 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-12 23:20:39,027 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-12 23:20:39,027 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-12 23:20:39,029 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-12 23:20:39,030 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 11:18:56" (3/4) ... [2019-01-12 23:20:39,034 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2019-01-12 23:20:39,252 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-12 23:20:39,255 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-12 23:20:39,256 INFO L168 Benchmark]: Toolchain (without parser) took 105597.93 ms. Allocated memory was 1.0 GB in the beginning and 5.6 GB in the end (delta: 4.6 GB). Free memory was 942.0 MB in the beginning and 2.8 GB in the end (delta: -1.8 GB). Peak memory consumption was 2.7 GB. Max. memory is 11.5 GB. [2019-01-12 23:20:39,258 INFO L168 Benchmark]: CDTParser took 0.44 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 23:20:39,258 INFO L168 Benchmark]: CACSL2BoogieTranslator took 899.19 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.0 MB). Free memory was 942.0 MB in the beginning and 1.1 GB in the end (delta: -172.2 MB). Peak memory consumption was 26.2 MB. Max. memory is 11.5 GB. [2019-01-12 23:20:39,258 INFO L168 Benchmark]: Boogie Procedure Inliner took 101.09 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 23:20:39,258 INFO L168 Benchmark]: Boogie Preprocessor took 83.37 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 23:20:39,259 INFO L168 Benchmark]: RCFGBuilder took 1498.78 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.1 MB). Peak memory consumption was 58.1 MB. Max. memory is 11.5 GB. [2019-01-12 23:20:39,259 INFO L168 Benchmark]: TraceAbstraction took 102781.18 ms. Allocated memory was 1.2 GB in the beginning and 5.6 GB in the end (delta: 4.4 GB). Free memory was 1.0 GB in the beginning and 2.8 GB in the end (delta: -1.8 GB). Peak memory consumption was 2.7 GB. Max. memory is 11.5 GB. [2019-01-12 23:20:39,259 INFO L168 Benchmark]: Witness Printer took 227.84 ms. Allocated memory is still 5.6 GB. Free memory was 2.8 GB in the beginning and 2.8 GB in the end (delta: 49.7 MB). Peak memory consumption was 49.7 MB. Max. memory is 11.5 GB. [2019-01-12 23:20:39,266 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.44 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 899.19 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.0 MB). Free memory was 942.0 MB in the beginning and 1.1 GB in the end (delta: -172.2 MB). Peak memory consumption was 26.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 101.09 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 83.37 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 1498.78 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.1 MB). Peak memory consumption was 58.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 102781.18 ms. Allocated memory was 1.2 GB in the beginning and 5.6 GB in the end (delta: 4.4 GB). Free memory was 1.0 GB in the beginning and 2.8 GB in the end (delta: -1.8 GB). Peak memory consumption was 2.7 GB. Max. memory is 11.5 GB. * Witness Printer took 227.84 ms. Allocated memory is still 5.6 GB. Free memory was 2.8 GB in the beginning and 2.8 GB in the end (delta: 49.7 MB). Peak memory consumption was 49.7 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] [L686] -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, y=0] [L687] -1 _Bool y$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, y=0, y$flush_delayed=0] [L688] -1 int y$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, y=0, y$flush_delayed=0, y$mem_tmp=0] [L689] -1 _Bool y$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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0] [L690] -1 _Bool y$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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0] [L691] -1 _Bool y$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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0] [L692] -1 _Bool y$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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0] [L693] -1 _Bool y$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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0] [L694] -1 _Bool y$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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0] [L695] -1 _Bool y$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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0] [L696] -1 int *y$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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}] [L697] -1 int y$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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0] [L698] -1 _Bool y$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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0] [L699] -1 int y$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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0] [L700] -1 _Bool y$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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L702] -1 int z = 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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L703] -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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L704] -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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L794] -1 pthread_t t249; 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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L795] FCALL, FORK -1 pthread_create(&t249, ((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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L796] -1 pthread_t t250; 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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L797] FCALL, FORK -1 pthread_create(&t250, ((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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L742] 0 y$w_buff1 = y$w_buff0 [L743] 0 y$w_buff0 = 1 [L744] 0 y$w_buff1_used = y$w_buff0_used [L745] 0 y$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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L747] 0 y$r_buff1_thd0 = y$r_buff0_thd0 [L748] 0 y$r_buff1_thd1 = y$r_buff0_thd1 [L749] 0 y$r_buff1_thd2 = y$r_buff0_thd2 [L750] 0 y$r_buff0_thd2 = (_Bool)1 [L753] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L754] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L755] 0 y$flush_delayed = weak$$choice2 [L756] 0 y$mem_tmp = y 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=3, x=0, y=0, y$flush_delayed=3, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L757] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_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=3, x=0, y=0, y$flush_delayed=3, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L757] EXPR 0 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_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=3, x=0, y=0, y$flush_delayed=3, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L757] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_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=3, x=0, y=0, y$flush_delayed=3, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L757] 0 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L758] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_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=3, x=0, y=1, y$flush_delayed=3, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L758] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L759] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_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=3, x=0, y=1, y$flush_delayed=3, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L759] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L760] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_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=3, x=0, y=1, y$flush_delayed=3, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L760] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L761] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_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=3, x=0, y=1, y$flush_delayed=3, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L761] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L762] EXPR 0 weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_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=3, x=0, y=1, y$flush_delayed=3, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L762] 0 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L763] EXPR 0 weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_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=3, x=0, y=1, y$flush_delayed=3, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L763] 0 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L764] 0 __unbuffered_p1_EAX = 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=3, x=0, y=1, y$flush_delayed=3, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L765] EXPR 0 y$flush_delayed ? y$mem_tmp : 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=3, x=0, y=1, y$flush_delayed=3, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L765] 0 y = y$flush_delayed ? y$mem_tmp : y [L766] 0 y$flush_delayed = (_Bool)0 [L769] 0 __unbuffered_p1_EBX = z 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=3, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L772] EXPR 0 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_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=3, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L708] 1 z = 1 [L711] 1 x = 1 [L714] 1 __unbuffered_p0_EAX = x [L717] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L718] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L719] 1 y$flush_delayed = weak$$choice2 [L720] 1 y$mem_tmp = y 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=7, weak$$choice2=5, x=1, y=0, y$flush_delayed=5, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L721] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=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=7, weak$$choice2=5, x=1, y=0, y$flush_delayed=5, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L721] 1 y = !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L722] EXPR 1 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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=7, weak$$choice2=5, weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0))=1, x=1, y=0, y$flush_delayed=5, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L722] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L723] EXPR 1 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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=7, weak$$choice2=5, weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1))=0, x=1, y=0, y$flush_delayed=5, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L723] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L724] EXPR 1 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=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=7, weak$$choice2=5, weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used))=1, x=1, y=0, y$flush_delayed=5, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L724] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L725] EXPR 1 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=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=7, weak$$choice2=5, weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=5, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L725] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L726] EXPR 1 weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) VAL [__unbuffered_cnt=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=7, weak$$choice2=5, weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1))=0, x=1, y=0, y$flush_delayed=5, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L726] 1 y$r_buff0_thd1 = weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) [L727] EXPR 1 weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=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=7, weak$$choice2=5, weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=5, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L727] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L728] 1 __unbuffered_p0_EBX = y 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=7, weak$$choice2=5, x=1, y=0, y$flush_delayed=5, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L729] EXPR 1 y$flush_delayed ? y$mem_tmp : y 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=7, weak$$choice2=5, x=1, y=0, y$flush_delayed=5, y$flush_delayed ? y$mem_tmp : y=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L772] 0 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L773] EXPR 0 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$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=7, weak$$choice2=5, x=1, y=1, y$flush_delayed=5, y$flush_delayed ? y$mem_tmp : y=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L729] 1 y = y$flush_delayed ? y$mem_tmp : y [L730] 1 y$flush_delayed = (_Bool)0 [L735] 1 __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=7, weak$$choice2=5, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L773] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L774] EXPR 0 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=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=7, weak$$choice2=5, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L774] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L775] EXPR 0 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 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=7, weak$$choice2=5, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L775] 0 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L776] EXPR 0 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=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=7, weak$$choice2=5, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L776] 0 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L779] 0 __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=7, weak$$choice2=5, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L799] -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=7, weak$$choice2=5, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L803] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=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=7, weak$$choice2=5, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L803] EXPR -1 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y 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=7, weak$$choice2=5, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L803] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=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=7, weak$$choice2=5, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L803] -1 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L804] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$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=7, weak$$choice2=5, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L804] -1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L805] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=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=7, weak$$choice2=5, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L805] -1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L806] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$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=7, weak$$choice2=5, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L806] -1 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L807] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=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=7, weak$$choice2=5, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L807] -1 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L810] -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=7, weak$$choice2=5, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=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=7, weak$$choice2=5, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=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=7, weak$$choice2=5, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 285 locations, 3 error locations. UNSAFE Result, 102.5s OverallTime, 29 OverallIterations, 1 TraceHistogramMax, 36.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 10514 SDtfs, 12013 SDslu, 31263 SDs, 0 SdLazy, 10092 SolverSat, 641 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 16.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 319 GetRequests, 77 SyntacticMatches, 10 SemanticMatches, 232 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 400 ImplicationChecksByTransitivity, 8.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=202764occurred in iteration=5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 45.9s AutomataMinimizationTime, 28 MinimizatonAttempts, 363027 StatesRemovedByMinimization, 28 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 7.8s InterpolantComputationTime, 2440 NumberOfCodeBlocks, 2440 NumberOfCodeBlocksAsserted, 29 NumberOfCheckSat, 2308 ConstructedInterpolants, 0 QuantifiedInterpolants, 542126 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...