./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/pthread-wmm/rfi007_tso.oepc_false-unreach-call.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 2e94e6aa Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/svcomp/c/pthread-wmm/rfi007_tso.oepc_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 8e4e50c987c43e88e6c05ffc272ace38771270e4 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.24-2e94e6a [2018-12-31 22:52:57,626 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-31 22:52:57,628 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-31 22:52:57,641 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-31 22:52:57,641 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-31 22:52:57,643 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-31 22:52:57,645 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-31 22:52:57,647 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-31 22:52:57,649 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-31 22:52:57,650 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-31 22:52:57,651 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-31 22:52:57,651 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-31 22:52:57,653 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-31 22:52:57,654 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-31 22:52:57,657 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-31 22:52:57,658 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-31 22:52:57,659 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-31 22:52:57,664 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-31 22:52:57,670 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-31 22:52:57,672 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-31 22:52:57,673 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-31 22:52:57,674 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-31 22:52:57,678 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-31 22:52:57,678 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-31 22:52:57,678 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-31 22:52:57,679 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-31 22:52:57,681 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-31 22:52:57,682 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-31 22:52:57,684 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-31 22:52:57,685 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-31 22:52:57,685 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-31 22:52:57,686 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-31 22:52:57,686 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-31 22:52:57,687 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-31 22:52:57,688 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-31 22:52:57,690 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-31 22:52:57,690 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-12-31 22:52:57,715 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-31 22:52:57,716 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-31 22:52:57,717 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-31 22:52:57,717 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-31 22:52:57,717 INFO L133 SettingsManager]: * Use SBE=true [2018-12-31 22:52:57,718 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-31 22:52:57,718 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-31 22:52:57,718 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-31 22:52:57,718 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-31 22:52:57,718 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-31 22:52:57,718 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-31 22:52:57,720 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-31 22:52:57,720 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-31 22:52:57,720 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-31 22:52:57,720 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-31 22:52:57,721 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-31 22:52:57,721 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-31 22:52:57,722 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-31 22:52:57,722 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-31 22:52:57,722 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-31 22:52:57,722 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-31 22:52:57,722 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-31 22:52:57,722 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-31 22:52:57,723 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-31 22:52:57,723 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-31 22:52:57,723 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-31 22:52:57,723 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-31 22:52:57,723 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-31 22:52:57,724 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 -> 8e4e50c987c43e88e6c05ffc272ace38771270e4 [2018-12-31 22:52:57,763 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-31 22:52:57,776 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-31 22:52:57,780 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-31 22:52:57,782 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-31 22:52:57,782 INFO L276 PluginConnector]: CDTParser initialized [2018-12-31 22:52:57,783 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/pthread-wmm/rfi007_tso.oepc_false-unreach-call.i [2018-12-31 22:52:57,854 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ffa8f3401/af8ca8a8772d4952bb9d21983241aa22/FLAGce0adf7dd [2018-12-31 22:52:58,462 INFO L307 CDTParser]: Found 1 translation units. [2018-12-31 22:52:58,463 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/pthread-wmm/rfi007_tso.oepc_false-unreach-call.i [2018-12-31 22:52:58,485 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ffa8f3401/af8ca8a8772d4952bb9d21983241aa22/FLAGce0adf7dd [2018-12-31 22:52:58,687 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ffa8f3401/af8ca8a8772d4952bb9d21983241aa22 [2018-12-31 22:52:58,691 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-31 22:52:58,693 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-31 22:52:58,695 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-31 22:52:58,695 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-31 22:52:58,702 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-31 22:52:58,703 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.12 10:52:58" (1/1) ... [2018-12-31 22:52:58,706 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@d1002b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 10:52:58, skipping insertion in model container [2018-12-31 22:52:58,706 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.12 10:52:58" (1/1) ... [2018-12-31 22:52:58,714 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-31 22:52:58,777 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-31 22:52:59,373 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-31 22:52:59,399 INFO L191 MainTranslator]: Completed pre-run [2018-12-31 22:52:59,623 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-31 22:52:59,734 INFO L195 MainTranslator]: Completed translation [2018-12-31 22:52:59,735 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 10:52:59 WrapperNode [2018-12-31 22:52:59,735 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-31 22:52:59,737 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-31 22:52:59,737 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-31 22:52:59,737 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-31 22:52:59,748 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 10:52:59" (1/1) ... [2018-12-31 22:52:59,782 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 10:52:59" (1/1) ... [2018-12-31 22:52:59,824 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-31 22:52:59,825 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-31 22:52:59,825 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-31 22:52:59,825 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-31 22:52:59,842 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 10:52:59" (1/1) ... [2018-12-31 22:52:59,843 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 10:52:59" (1/1) ... [2018-12-31 22:52:59,856 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 10:52:59" (1/1) ... [2018-12-31 22:52:59,856 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 10:52:59" (1/1) ... [2018-12-31 22:52:59,870 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 10:52:59" (1/1) ... [2018-12-31 22:52:59,876 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 10:52:59" (1/1) ... [2018-12-31 22:52:59,880 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 10:52:59" (1/1) ... [2018-12-31 22:52:59,886 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-31 22:52:59,887 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-31 22:52:59,887 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-31 22:52:59,887 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-31 22:52:59,888 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 10:52:59" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-31 22:52:59,976 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-31 22:52:59,976 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2018-12-31 22:52:59,976 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2018-12-31 22:52:59,976 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-31 22:52:59,976 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2018-12-31 22:52:59,977 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2018-12-31 22:52:59,977 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2018-12-31 22:52:59,977 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2018-12-31 22:52:59,977 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2018-12-31 22:52:59,977 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-31 22:52:59,977 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-31 22:52:59,979 WARN L198 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2018-12-31 22:53:01,433 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-31 22:53:01,434 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-12-31 22:53:01,434 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 10:53:01 BoogieIcfgContainer [2018-12-31 22:53:01,436 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-31 22:53:01,438 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-31 22:53:01,438 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-31 22:53:01,441 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-31 22:53:01,442 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.12 10:52:58" (1/3) ... [2018-12-31 22:53:01,443 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b4fc2f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.12 10:53:01, skipping insertion in model container [2018-12-31 22:53:01,443 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 10:52:59" (2/3) ... [2018-12-31 22:53:01,443 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b4fc2f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.12 10:53:01, skipping insertion in model container [2018-12-31 22:53:01,443 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 10:53:01" (3/3) ... [2018-12-31 22:53:01,445 INFO L112 eAbstractionObserver]: Analyzing ICFG rfi007_tso.oepc_false-unreach-call.i [2018-12-31 22:53:01,497 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:53:01,498 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:53:01,498 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:53:01,498 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:53:01,499 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:53:01,499 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:53:01,499 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:53:01,499 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:53:01,501 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:53:01,501 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:53:01,501 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:53:01,502 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:53:01,502 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:53:01,503 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:53:01,503 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:53:01,503 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:53:01,503 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:53:01,503 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:53:01,504 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:53:01,504 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:53:01,504 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:53:01,504 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:53:01,504 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:53:01,506 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:53:01,507 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:53:01,507 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:53:01,507 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:53:01,507 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:53:01,507 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:53:01,508 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:53:01,509 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:53:01,509 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:53:01,509 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:53:01,509 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:53:01,510 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:53:01,512 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:53:01,512 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:53:01,512 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:53:01,512 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:53:01,513 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:53:01,513 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:53:01,513 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:53:01,513 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet11.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:53:01,513 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet11.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:53:01,515 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:53:01,515 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:53:01,515 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet11.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:53:01,515 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:53:01,516 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet11.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:53:01,516 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:53:01,516 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:53:01,517 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:53:01,518 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:53:01,518 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:53:01,518 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:53:01,519 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:53:01,519 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:53:01,520 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:53:01,520 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:53:01,520 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:53:01,520 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:53:01,520 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:53:01,521 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:53:01,521 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:53:01,521 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:53:01,521 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:53:01,523 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:53:01,524 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:53:01,524 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:53:01,524 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:53:01,524 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:53:01,524 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:53:01,525 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:53:01,526 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:53:01,526 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:53:01,526 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:53:01,526 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:53:01,527 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:53:01,528 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:53:01,528 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:53:01,528 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:53:01,528 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:53:01,528 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:53:01,529 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:53:01,529 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:53:01,529 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:53:01,529 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:53:01,529 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:53:01,531 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:53:01,532 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:53:01,532 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:53:01,532 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:53:01,532 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:53:01,532 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:53:01,534 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:53:01,534 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:53:01,534 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:53:01,534 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:53:01,534 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:53:01,535 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:53:01,536 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:53:01,536 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:53:01,536 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:53:01,537 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:53:01,538 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:53:01,538 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:53:01,538 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:53:01,538 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:53:01,538 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:53:01,538 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:53:01,539 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:53:01,539 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:53:01,539 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:53:01,539 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:53:01,539 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:53:01,541 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:53:01,542 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:53:01,542 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:53:01,542 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:53:01,542 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:53:01,543 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:53:01,544 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:53:01,544 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:53:01,544 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:53:01,544 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:53:01,545 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:53:01,545 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:53:01,546 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:53:01,546 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:53:01,546 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:53:01,546 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:53:01,546 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:53:01,548 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:53:01,548 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:53:01,548 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:53:01,549 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:53:01,549 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:53:01,550 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:53:01,550 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:53:01,550 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:53:01,550 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:53:01,551 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:53:01,551 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:53:01,551 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:53:01,551 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:53:01,551 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:53:01,551 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:53:01,554 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:53:01,554 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:53:01,554 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:53:01,554 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:53:01,555 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:53:01,556 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:53:01,556 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:53:01,556 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:53:01,556 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:53:01,557 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:53:01,558 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:53:01,558 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet39.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:53:01,558 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet39.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:53:01,558 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:53:01,558 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:53:01,558 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet39.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:53:01,559 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet39.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:53:01,588 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2018-12-31 22:53:01,588 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-31 22:53:01,599 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-12-31 22:53:01,617 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2018-12-31 22:53:01,647 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-31 22:53:01,647 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-31 22:53:01,648 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-31 22:53:01,648 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-31 22:53:01,648 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-31 22:53:01,648 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-31 22:53:01,648 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-31 22:53:01,648 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-31 22:53:01,649 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-31 22:53:01,669 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 184places, 243 transitions [2018-12-31 22:53:08,820 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 75068 states. [2018-12-31 22:53:08,823 INFO L276 IsEmpty]: Start isEmpty. Operand 75068 states. [2018-12-31 22:53:08,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-12-31 22:53:08,834 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 22:53:08,835 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] [2018-12-31 22:53:08,838 INFO L423 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 22:53:08,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 22:53:08,844 INFO L82 PathProgramCache]: Analyzing trace with hash 210414996, now seen corresponding path program 1 times [2018-12-31 22:53:08,846 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 22:53:08,847 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 22:53:08,912 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:53:08,913 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 22:53:08,913 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:53:08,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 22:53:09,260 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 22:53:09,264 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 22:53:09,264 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 22:53:09,269 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-31 22:53:09,286 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-31 22:53:09,287 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-31 22:53:09,289 INFO L87 Difference]: Start difference. First operand 75068 states. Second operand 4 states. [2018-12-31 22:53:12,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 22:53:12,384 INFO L93 Difference]: Finished difference Result 142996 states and 583892 transitions. [2018-12-31 22:53:12,385 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-31 22:53:12,386 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 37 [2018-12-31 22:53:12,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 22:53:13,207 INFO L225 Difference]: With dead ends: 142996 [2018-12-31 22:53:13,207 INFO L226 Difference]: Without dead ends: 126812 [2018-12-31 22:53:13,209 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-31 22:53:15,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126812 states. [2018-12-31 22:53:17,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126812 to 67930. [2018-12-31 22:53:17,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67930 states. [2018-12-31 22:53:17,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67930 states to 67930 states and 279065 transitions. [2018-12-31 22:53:17,857 INFO L78 Accepts]: Start accepts. Automaton has 67930 states and 279065 transitions. Word has length 37 [2018-12-31 22:53:17,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 22:53:17,858 INFO L480 AbstractCegarLoop]: Abstraction has 67930 states and 279065 transitions. [2018-12-31 22:53:17,858 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-31 22:53:17,859 INFO L276 IsEmpty]: Start isEmpty. Operand 67930 states and 279065 transitions. [2018-12-31 22:53:17,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-12-31 22:53:17,866 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 22:53:17,866 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] [2018-12-31 22:53:17,866 INFO L423 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 22:53:17,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 22:53:17,867 INFO L82 PathProgramCache]: Analyzing trace with hash -746847349, now seen corresponding path program 1 times [2018-12-31 22:53:17,867 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 22:53:17,867 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 22:53:17,875 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:53:17,876 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 22:53:17,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:53:17,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 22:53:18,033 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 22:53:18,033 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 22:53:18,033 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-31 22:53:18,036 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 22:53:18,036 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 22:53:18,036 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-31 22:53:18,037 INFO L87 Difference]: Start difference. First operand 67930 states and 279065 transitions. Second operand 5 states. [2018-12-31 22:53:22,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 22:53:22,748 INFO L93 Difference]: Finished difference Result 201246 states and 776001 transitions. [2018-12-31 22:53:22,749 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-31 22:53:22,749 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 44 [2018-12-31 22:53:22,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 22:53:23,606 INFO L225 Difference]: With dead ends: 201246 [2018-12-31 22:53:23,607 INFO L226 Difference]: Without dead ends: 201086 [2018-12-31 22:53:23,608 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 [2018-12-31 22:53:31,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201086 states. [2018-12-31 22:53:33,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201086 to 109739. [2018-12-31 22:53:33,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109739 states. [2018-12-31 22:53:35,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109739 states to 109739 states and 422911 transitions. [2018-12-31 22:53:35,096 INFO L78 Accepts]: Start accepts. Automaton has 109739 states and 422911 transitions. Word has length 44 [2018-12-31 22:53:35,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 22:53:35,097 INFO L480 AbstractCegarLoop]: Abstraction has 109739 states and 422911 transitions. [2018-12-31 22:53:35,097 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 22:53:35,097 INFO L276 IsEmpty]: Start isEmpty. Operand 109739 states and 422911 transitions. [2018-12-31 22:53:35,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-12-31 22:53:35,103 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 22:53:35,103 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 22:53:35,103 INFO L423 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 22:53:35,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 22:53:35,105 INFO L82 PathProgramCache]: Analyzing trace with hash 56283897, now seen corresponding path program 1 times [2018-12-31 22:53:35,105 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 22:53:35,105 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 22:53:35,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:53:35,110 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 22:53:35,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:53:35,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 22:53:35,215 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 22:53:35,216 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 22:53:35,216 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 22:53:35,216 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-31 22:53:35,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-31 22:53:35,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-31 22:53:35,217 INFO L87 Difference]: Start difference. First operand 109739 states and 422911 transitions. Second operand 4 states. [2018-12-31 22:53:35,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 22:53:35,369 INFO L93 Difference]: Finished difference Result 26128 states and 89696 transitions. [2018-12-31 22:53:35,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-31 22:53:35,370 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 45 [2018-12-31 22:53:35,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 22:53:35,414 INFO L225 Difference]: With dead ends: 26128 [2018-12-31 22:53:35,415 INFO L226 Difference]: Without dead ends: 24431 [2018-12-31 22:53:35,415 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-31 22:53:35,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24431 states. [2018-12-31 22:53:35,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24431 to 24431. [2018-12-31 22:53:35,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24431 states. [2018-12-31 22:53:35,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24431 states to 24431 states and 84249 transitions. [2018-12-31 22:53:35,830 INFO L78 Accepts]: Start accepts. Automaton has 24431 states and 84249 transitions. Word has length 45 [2018-12-31 22:53:35,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 22:53:35,831 INFO L480 AbstractCegarLoop]: Abstraction has 24431 states and 84249 transitions. [2018-12-31 22:53:35,831 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-31 22:53:35,831 INFO L276 IsEmpty]: Start isEmpty. Operand 24431 states and 84249 transitions. [2018-12-31 22:53:35,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-12-31 22:53:35,836 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 22:53:35,836 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] [2018-12-31 22:53:35,836 INFO L423 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 22:53:35,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 22:53:35,837 INFO L82 PathProgramCache]: Analyzing trace with hash -677750709, now seen corresponding path program 1 times [2018-12-31 22:53:35,837 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 22:53:35,837 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 22:53:35,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:53:35,840 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 22:53:35,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:53:35,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 22:53:36,123 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 22:53:36,123 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 22:53:36,124 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 22:53:36,124 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-31 22:53:36,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-31 22:53:36,124 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-31 22:53:36,128 INFO L87 Difference]: Start difference. First operand 24431 states and 84249 transitions. Second operand 4 states. [2018-12-31 22:53:37,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 22:53:37,097 INFO L93 Difference]: Finished difference Result 33039 states and 111277 transitions. [2018-12-31 22:53:37,098 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-31 22:53:37,098 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 58 [2018-12-31 22:53:37,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 22:53:37,162 INFO L225 Difference]: With dead ends: 33039 [2018-12-31 22:53:37,162 INFO L226 Difference]: Without dead ends: 33039 [2018-12-31 22:53:37,163 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-31 22:53:37,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33039 states. [2018-12-31 22:53:37,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33039 to 27711. [2018-12-31 22:53:37,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27711 states. [2018-12-31 22:53:37,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27711 states to 27711 states and 94397 transitions. [2018-12-31 22:53:37,668 INFO L78 Accepts]: Start accepts. Automaton has 27711 states and 94397 transitions. Word has length 58 [2018-12-31 22:53:37,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 22:53:37,668 INFO L480 AbstractCegarLoop]: Abstraction has 27711 states and 94397 transitions. [2018-12-31 22:53:37,668 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-31 22:53:37,668 INFO L276 IsEmpty]: Start isEmpty. Operand 27711 states and 94397 transitions. [2018-12-31 22:53:37,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-12-31 22:53:37,675 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 22:53:37,675 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] [2018-12-31 22:53:37,675 INFO L423 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 22:53:37,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 22:53:37,675 INFO L82 PathProgramCache]: Analyzing trace with hash 1045055487, now seen corresponding path program 1 times [2018-12-31 22:53:37,676 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 22:53:37,676 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 22:53:37,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:53:37,678 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 22:53:37,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:53:37,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 22:53:37,798 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 22:53:37,798 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 22:53:37,798 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-31 22:53:37,798 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-31 22:53:37,799 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-31 22:53:37,799 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-31 22:53:37,799 INFO L87 Difference]: Start difference. First operand 27711 states and 94397 transitions. Second operand 6 states. [2018-12-31 22:53:39,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 22:53:39,338 INFO L93 Difference]: Finished difference Result 41483 states and 139930 transitions. [2018-12-31 22:53:39,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-31 22:53:39,338 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 58 [2018-12-31 22:53:39,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 22:53:39,422 INFO L225 Difference]: With dead ends: 41483 [2018-12-31 22:53:39,422 INFO L226 Difference]: Without dead ends: 41451 [2018-12-31 22:53:39,422 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2018-12-31 22:53:39,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41451 states. [2018-12-31 22:53:41,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41451 to 32891. [2018-12-31 22:53:41,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32891 states. [2018-12-31 22:53:41,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32891 states to 32891 states and 110842 transitions. [2018-12-31 22:53:41,149 INFO L78 Accepts]: Start accepts. Automaton has 32891 states and 110842 transitions. Word has length 58 [2018-12-31 22:53:41,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 22:53:41,149 INFO L480 AbstractCegarLoop]: Abstraction has 32891 states and 110842 transitions. [2018-12-31 22:53:41,150 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-31 22:53:41,150 INFO L276 IsEmpty]: Start isEmpty. Operand 32891 states and 110842 transitions. [2018-12-31 22:53:41,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-12-31 22:53:41,181 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 22:53:41,182 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] [2018-12-31 22:53:41,182 INFO L423 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 22:53:41,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 22:53:41,182 INFO L82 PathProgramCache]: Analyzing trace with hash -1038639251, now seen corresponding path program 1 times [2018-12-31 22:53:41,182 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 22:53:41,183 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 22:53:41,185 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:53:41,185 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 22:53:41,185 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:53:41,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 22:53:41,356 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 22:53:41,357 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 22:53:41,357 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 22:53:41,357 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-31 22:53:41,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-31 22:53:41,358 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-31 22:53:41,358 INFO L87 Difference]: Start difference. First operand 32891 states and 110842 transitions. Second operand 4 states. [2018-12-31 22:53:42,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 22:53:42,363 INFO L93 Difference]: Finished difference Result 52727 states and 174843 transitions. [2018-12-31 22:53:42,364 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-31 22:53:42,364 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 72 [2018-12-31 22:53:42,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 22:53:42,474 INFO L225 Difference]: With dead ends: 52727 [2018-12-31 22:53:42,474 INFO L226 Difference]: Without dead ends: 52551 [2018-12-31 22:53:42,475 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-31 22:53:42,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52551 states. [2018-12-31 22:53:43,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52551 to 44915. [2018-12-31 22:53:43,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44915 states. [2018-12-31 22:53:43,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44915 states to 44915 states and 150432 transitions. [2018-12-31 22:53:43,285 INFO L78 Accepts]: Start accepts. Automaton has 44915 states and 150432 transitions. Word has length 72 [2018-12-31 22:53:43,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 22:53:43,285 INFO L480 AbstractCegarLoop]: Abstraction has 44915 states and 150432 transitions. [2018-12-31 22:53:43,285 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-31 22:53:43,285 INFO L276 IsEmpty]: Start isEmpty. Operand 44915 states and 150432 transitions. [2018-12-31 22:53:43,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-12-31 22:53:43,315 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 22:53:43,315 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] [2018-12-31 22:53:43,315 INFO L423 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 22:53:43,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 22:53:43,316 INFO L82 PathProgramCache]: Analyzing trace with hash 314670446, now seen corresponding path program 1 times [2018-12-31 22:53:43,316 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 22:53:43,316 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 22:53:43,318 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:53:43,318 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 22:53:43,318 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:53:43,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 22:53:43,542 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 22:53:43,542 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 22:53:43,542 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-31 22:53:43,543 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 22:53:43,543 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 22:53:43,543 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-31 22:53:43,543 INFO L87 Difference]: Start difference. First operand 44915 states and 150432 transitions. Second operand 5 states. [2018-12-31 22:53:43,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 22:53:43,713 INFO L93 Difference]: Finished difference Result 6023 states and 16083 transitions. [2018-12-31 22:53:43,714 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-31 22:53:43,714 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 72 [2018-12-31 22:53:43,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 22:53:43,720 INFO L225 Difference]: With dead ends: 6023 [2018-12-31 22:53:43,720 INFO L226 Difference]: Without dead ends: 4939 [2018-12-31 22:53:43,720 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-12-31 22:53:43,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4939 states. [2018-12-31 22:53:43,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4939 to 4335. [2018-12-31 22:53:43,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4335 states. [2018-12-31 22:53:43,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4335 states to 4335 states and 11438 transitions. [2018-12-31 22:53:43,774 INFO L78 Accepts]: Start accepts. Automaton has 4335 states and 11438 transitions. Word has length 72 [2018-12-31 22:53:43,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 22:53:43,774 INFO L480 AbstractCegarLoop]: Abstraction has 4335 states and 11438 transitions. [2018-12-31 22:53:43,774 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 22:53:43,774 INFO L276 IsEmpty]: Start isEmpty. Operand 4335 states and 11438 transitions. [2018-12-31 22:53:43,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-12-31 22:53:43,781 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 22:53:43,781 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, 1, 1, 1] [2018-12-31 22:53:43,781 INFO L423 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 22:53:43,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 22:53:43,782 INFO L82 PathProgramCache]: Analyzing trace with hash -45620389, now seen corresponding path program 1 times [2018-12-31 22:53:43,782 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 22:53:43,782 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 22:53:43,784 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:53:43,784 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 22:53:43,784 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:53:43,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 22:53:44,023 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 22:53:44,023 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 22:53:44,023 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-31 22:53:44,024 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-31 22:53:44,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-31 22:53:44,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-31 22:53:44,024 INFO L87 Difference]: Start difference. First operand 4335 states and 11438 transitions. Second operand 6 states. [2018-12-31 22:53:44,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 22:53:44,970 INFO L93 Difference]: Finished difference Result 5546 states and 14399 transitions. [2018-12-31 22:53:44,971 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-31 22:53:44,971 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 107 [2018-12-31 22:53:44,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 22:53:44,978 INFO L225 Difference]: With dead ends: 5546 [2018-12-31 22:53:44,979 INFO L226 Difference]: Without dead ends: 5546 [2018-12-31 22:53:44,979 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2018-12-31 22:53:44,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5546 states. [2018-12-31 22:53:45,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5546 to 4917. [2018-12-31 22:53:45,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4917 states. [2018-12-31 22:53:45,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4917 states to 4917 states and 12828 transitions. [2018-12-31 22:53:45,037 INFO L78 Accepts]: Start accepts. Automaton has 4917 states and 12828 transitions. Word has length 107 [2018-12-31 22:53:45,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 22:53:45,037 INFO L480 AbstractCegarLoop]: Abstraction has 4917 states and 12828 transitions. [2018-12-31 22:53:45,037 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-31 22:53:45,037 INFO L276 IsEmpty]: Start isEmpty. Operand 4917 states and 12828 transitions. [2018-12-31 22:53:45,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-12-31 22:53:45,045 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 22:53:45,045 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, 1, 1, 1] [2018-12-31 22:53:45,045 INFO L423 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 22:53:45,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 22:53:45,046 INFO L82 PathProgramCache]: Analyzing trace with hash -1503837772, now seen corresponding path program 1 times [2018-12-31 22:53:45,046 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 22:53:45,046 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 22:53:45,048 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:53:45,048 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 22:53:45,048 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:53:45,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 22:53:45,476 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 22:53:45,476 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 22:53:45,476 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-31 22:53:45,477 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-31 22:53:45,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-31 22:53:45,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2018-12-31 22:53:45,477 INFO L87 Difference]: Start difference. First operand 4917 states and 12828 transitions. Second operand 7 states. [2018-12-31 22:53:46,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 22:53:46,026 INFO L93 Difference]: Finished difference Result 5530 states and 14281 transitions. [2018-12-31 22:53:46,027 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-31 22:53:46,027 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 107 [2018-12-31 22:53:46,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 22:53:46,034 INFO L225 Difference]: With dead ends: 5530 [2018-12-31 22:53:46,035 INFO L226 Difference]: Without dead ends: 5530 [2018-12-31 22:53:46,035 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2018-12-31 22:53:46,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5530 states. [2018-12-31 22:53:46,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5530 to 4975. [2018-12-31 22:53:46,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4975 states. [2018-12-31 22:53:46,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4975 states to 4975 states and 12962 transitions. [2018-12-31 22:53:46,089 INFO L78 Accepts]: Start accepts. Automaton has 4975 states and 12962 transitions. Word has length 107 [2018-12-31 22:53:46,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 22:53:46,089 INFO L480 AbstractCegarLoop]: Abstraction has 4975 states and 12962 transitions. [2018-12-31 22:53:46,089 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-31 22:53:46,089 INFO L276 IsEmpty]: Start isEmpty. Operand 4975 states and 12962 transitions. [2018-12-31 22:53:46,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-12-31 22:53:46,097 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 22:53:46,097 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, 1, 1, 1] [2018-12-31 22:53:46,097 INFO L423 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 22:53:46,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 22:53:46,098 INFO L82 PathProgramCache]: Analyzing trace with hash -994130960, now seen corresponding path program 2 times [2018-12-31 22:53:46,098 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 22:53:46,098 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 22:53:46,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:53:46,100 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 22:53:46,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:53:46,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 22:53:46,353 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 22:53:46,354 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 22:53:46,354 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-31 22:53:46,354 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 22:53:46,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 22:53:46,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-31 22:53:46,355 INFO L87 Difference]: Start difference. First operand 4975 states and 12962 transitions. Second operand 5 states. [2018-12-31 22:53:46,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 22:53:46,772 INFO L93 Difference]: Finished difference Result 5424 states and 13968 transitions. [2018-12-31 22:53:46,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-31 22:53:46,773 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 107 [2018-12-31 22:53:46,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 22:53:46,781 INFO L225 Difference]: With dead ends: 5424 [2018-12-31 22:53:46,781 INFO L226 Difference]: Without dead ends: 5424 [2018-12-31 22:53:46,781 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-12-31 22:53:46,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5424 states. [2018-12-31 22:53:46,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5424 to 4990. [2018-12-31 22:53:46,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4990 states. [2018-12-31 22:53:46,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4990 states to 4990 states and 12993 transitions. [2018-12-31 22:53:46,839 INFO L78 Accepts]: Start accepts. Automaton has 4990 states and 12993 transitions. Word has length 107 [2018-12-31 22:53:46,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 22:53:46,839 INFO L480 AbstractCegarLoop]: Abstraction has 4990 states and 12993 transitions. [2018-12-31 22:53:46,840 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 22:53:46,840 INFO L276 IsEmpty]: Start isEmpty. Operand 4990 states and 12993 transitions. [2018-12-31 22:53:46,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-12-31 22:53:46,847 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 22:53:46,847 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, 1, 1, 1] [2018-12-31 22:53:46,847 INFO L423 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 22:53:46,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 22:53:46,848 INFO L82 PathProgramCache]: Analyzing trace with hash -1252469456, now seen corresponding path program 3 times [2018-12-31 22:53:46,848 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 22:53:46,848 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 22:53:46,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:53:46,852 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-31 22:53:46,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:53:46,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 22:53:47,068 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 22:53:47,068 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 22:53:47,068 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 22:53:47,069 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-31 22:53:47,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-31 22:53:47,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-31 22:53:47,069 INFO L87 Difference]: Start difference. First operand 4990 states and 12993 transitions. Second operand 4 states. [2018-12-31 22:53:47,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 22:53:47,583 INFO L93 Difference]: Finished difference Result 5497 states and 14212 transitions. [2018-12-31 22:53:47,585 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-31 22:53:47,585 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 107 [2018-12-31 22:53:47,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 22:53:47,593 INFO L225 Difference]: With dead ends: 5497 [2018-12-31 22:53:47,593 INFO L226 Difference]: Without dead ends: 5497 [2018-12-31 22:53:47,593 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-31 22:53:47,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5497 states. [2018-12-31 22:53:47,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5497 to 5451. [2018-12-31 22:53:47,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5451 states. [2018-12-31 22:53:47,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5451 states to 5451 states and 14104 transitions. [2018-12-31 22:53:47,651 INFO L78 Accepts]: Start accepts. Automaton has 5451 states and 14104 transitions. Word has length 107 [2018-12-31 22:53:47,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 22:53:47,652 INFO L480 AbstractCegarLoop]: Abstraction has 5451 states and 14104 transitions. [2018-12-31 22:53:47,652 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-31 22:53:47,652 INFO L276 IsEmpty]: Start isEmpty. Operand 5451 states and 14104 transitions. [2018-12-31 22:53:47,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-12-31 22:53:47,660 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 22:53:47,660 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, 1, 1, 1] [2018-12-31 22:53:47,660 INFO L423 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 22:53:47,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 22:53:47,660 INFO L82 PathProgramCache]: Analyzing trace with hash -282888433, now seen corresponding path program 1 times [2018-12-31 22:53:47,661 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 22:53:47,662 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 22:53:47,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:53:47,665 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-31 22:53:47,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:53:47,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 22:53:47,773 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 22:53:47,774 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 22:53:47,774 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-31 22:53:47,774 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 22:53:47,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 22:53:47,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 22:53:47,775 INFO L87 Difference]: Start difference. First operand 5451 states and 14104 transitions. Second operand 3 states. [2018-12-31 22:53:48,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 22:53:48,008 INFO L93 Difference]: Finished difference Result 6559 states and 16671 transitions. [2018-12-31 22:53:48,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 22:53:48,009 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 107 [2018-12-31 22:53:48,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 22:53:48,017 INFO L225 Difference]: With dead ends: 6559 [2018-12-31 22:53:48,017 INFO L226 Difference]: Without dead ends: 6559 [2018-12-31 22:53:48,018 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 22:53:48,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6559 states. [2018-12-31 22:53:48,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6559 to 6285. [2018-12-31 22:53:48,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6285 states. [2018-12-31 22:53:48,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6285 states to 6285 states and 16067 transitions. [2018-12-31 22:53:48,092 INFO L78 Accepts]: Start accepts. Automaton has 6285 states and 16067 transitions. Word has length 107 [2018-12-31 22:53:48,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 22:53:48,092 INFO L480 AbstractCegarLoop]: Abstraction has 6285 states and 16067 transitions. [2018-12-31 22:53:48,092 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 22:53:48,092 INFO L276 IsEmpty]: Start isEmpty. Operand 6285 states and 16067 transitions. [2018-12-31 22:53:48,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-12-31 22:53:48,102 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 22:53:48,102 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, 1, 1, 1] [2018-12-31 22:53:48,103 INFO L423 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 22:53:48,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 22:53:48,103 INFO L82 PathProgramCache]: Analyzing trace with hash 1937307839, now seen corresponding path program 2 times [2018-12-31 22:53:48,103 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 22:53:48,103 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 22:53:48,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:53:48,105 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 22:53:48,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:53:48,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 22:53:48,515 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 22:53:48,515 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 22:53:48,516 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-31 22:53:48,516 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 22:53:48,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 22:53:48,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-31 22:53:48,518 INFO L87 Difference]: Start difference. First operand 6285 states and 16067 transitions. Second operand 5 states. [2018-12-31 22:53:50,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 22:53:50,126 INFO L93 Difference]: Finished difference Result 7150 states and 18081 transitions. [2018-12-31 22:53:50,127 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-31 22:53:50,128 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 107 [2018-12-31 22:53:50,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 22:53:50,136 INFO L225 Difference]: With dead ends: 7150 [2018-12-31 22:53:50,136 INFO L226 Difference]: Without dead ends: 7150 [2018-12-31 22:53:50,136 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-31 22:53:50,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7150 states. [2018-12-31 22:53:50,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7150 to 6656. [2018-12-31 22:53:50,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6656 states. [2018-12-31 22:53:50,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6656 states to 6656 states and 16894 transitions. [2018-12-31 22:53:50,215 INFO L78 Accepts]: Start accepts. Automaton has 6656 states and 16894 transitions. Word has length 107 [2018-12-31 22:53:50,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 22:53:50,216 INFO L480 AbstractCegarLoop]: Abstraction has 6656 states and 16894 transitions. [2018-12-31 22:53:50,216 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 22:53:50,216 INFO L276 IsEmpty]: Start isEmpty. Operand 6656 states and 16894 transitions. [2018-12-31 22:53:50,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-12-31 22:53:50,223 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 22:53:50,224 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, 1, 1, 1] [2018-12-31 22:53:50,224 INFO L423 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 22:53:50,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 22:53:50,224 INFO L82 PathProgramCache]: Analyzing trace with hash 605591080, now seen corresponding path program 1 times [2018-12-31 22:53:50,224 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 22:53:50,224 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 22:53:50,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:53:50,227 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-31 22:53:50,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:53:50,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 22:53:50,351 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 22:53:50,352 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 22:53:50,352 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 22:53:50,352 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-31 22:53:50,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-31 22:53:50,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-31 22:53:50,353 INFO L87 Difference]: Start difference. First operand 6656 states and 16894 transitions. Second operand 4 states. [2018-12-31 22:53:50,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 22:53:50,783 INFO L93 Difference]: Finished difference Result 9846 states and 24401 transitions. [2018-12-31 22:53:50,792 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-31 22:53:50,792 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 107 [2018-12-31 22:53:50,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 22:53:50,807 INFO L225 Difference]: With dead ends: 9846 [2018-12-31 22:53:50,807 INFO L226 Difference]: Without dead ends: 9760 [2018-12-31 22:53:50,807 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-31 22:53:50,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9760 states. [2018-12-31 22:53:50,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9760 to 7224. [2018-12-31 22:53:50,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7224 states. [2018-12-31 22:53:50,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7224 states to 7224 states and 18315 transitions. [2018-12-31 22:53:50,934 INFO L78 Accepts]: Start accepts. Automaton has 7224 states and 18315 transitions. Word has length 107 [2018-12-31 22:53:50,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 22:53:50,934 INFO L480 AbstractCegarLoop]: Abstraction has 7224 states and 18315 transitions. [2018-12-31 22:53:50,934 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-31 22:53:50,934 INFO L276 IsEmpty]: Start isEmpty. Operand 7224 states and 18315 transitions. [2018-12-31 22:53:50,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-12-31 22:53:50,944 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 22:53:50,944 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, 1, 1, 1] [2018-12-31 22:53:50,945 INFO L423 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 22:53:50,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 22:53:50,946 INFO L82 PathProgramCache]: Analyzing trace with hash 1479569678, now seen corresponding path program 2 times [2018-12-31 22:53:50,946 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 22:53:50,946 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 22:53:50,952 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:53:50,952 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 22:53:50,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:53:50,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 22:53:51,178 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 22:53:51,178 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 22:53:51,178 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 22:53:51,179 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-31 22:53:51,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-31 22:53:51,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-31 22:53:51,179 INFO L87 Difference]: Start difference. First operand 7224 states and 18315 transitions. Second operand 4 states. [2018-12-31 22:53:51,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 22:53:51,586 INFO L93 Difference]: Finished difference Result 7897 states and 19866 transitions. [2018-12-31 22:53:51,587 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-31 22:53:51,587 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 107 [2018-12-31 22:53:51,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 22:53:51,597 INFO L225 Difference]: With dead ends: 7897 [2018-12-31 22:53:51,598 INFO L226 Difference]: Without dead ends: 7897 [2018-12-31 22:53:51,598 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-31 22:53:51,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7897 states. [2018-12-31 22:53:51,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7897 to 7053. [2018-12-31 22:53:51,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7053 states. [2018-12-31 22:53:51,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7053 states to 7053 states and 17920 transitions. [2018-12-31 22:53:51,711 INFO L78 Accepts]: Start accepts. Automaton has 7053 states and 17920 transitions. Word has length 107 [2018-12-31 22:53:51,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 22:53:51,712 INFO L480 AbstractCegarLoop]: Abstraction has 7053 states and 17920 transitions. [2018-12-31 22:53:51,712 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-31 22:53:51,712 INFO L276 IsEmpty]: Start isEmpty. Operand 7053 states and 17920 transitions. [2018-12-31 22:53:51,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-12-31 22:53:51,721 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 22:53:51,722 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, 1, 1, 1, 1, 1] [2018-12-31 22:53:51,722 INFO L423 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 22:53:51,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 22:53:51,722 INFO L82 PathProgramCache]: Analyzing trace with hash -873799520, now seen corresponding path program 1 times [2018-12-31 22:53:51,722 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 22:53:51,723 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 22:53:51,724 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:53:51,724 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-31 22:53:51,724 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:53:51,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 22:53:52,066 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 22:53:52,067 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 22:53:52,067 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-31 22:53:52,067 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-31 22:53:52,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-31 22:53:52,067 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-12-31 22:53:52,068 INFO L87 Difference]: Start difference. First operand 7053 states and 17920 transitions. Second operand 7 states. [2018-12-31 22:53:52,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 22:53:52,661 INFO L93 Difference]: Finished difference Result 9401 states and 23216 transitions. [2018-12-31 22:53:52,662 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-31 22:53:52,662 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 109 [2018-12-31 22:53:52,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 22:53:52,673 INFO L225 Difference]: With dead ends: 9401 [2018-12-31 22:53:52,673 INFO L226 Difference]: Without dead ends: 9341 [2018-12-31 22:53:52,674 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2018-12-31 22:53:52,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9341 states. [2018-12-31 22:53:52,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9341 to 7766. [2018-12-31 22:53:52,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7766 states. [2018-12-31 22:53:52,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7766 states to 7766 states and 19525 transitions. [2018-12-31 22:53:52,770 INFO L78 Accepts]: Start accepts. Automaton has 7766 states and 19525 transitions. Word has length 109 [2018-12-31 22:53:52,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 22:53:52,770 INFO L480 AbstractCegarLoop]: Abstraction has 7766 states and 19525 transitions. [2018-12-31 22:53:52,770 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-31 22:53:52,770 INFO L276 IsEmpty]: Start isEmpty. Operand 7766 states and 19525 transitions. [2018-12-31 22:53:52,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-12-31 22:53:52,779 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 22:53:52,779 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, 1, 1, 1, 1, 1] [2018-12-31 22:53:52,779 INFO L423 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 22:53:52,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 22:53:52,780 INFO L82 PathProgramCache]: Analyzing trace with hash 1906365565, now seen corresponding path program 1 times [2018-12-31 22:53:52,780 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 22:53:52,780 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 22:53:52,781 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:53:52,781 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 22:53:52,781 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:53:52,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 22:53:53,241 WARN L181 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 10 [2018-12-31 22:53:53,266 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 22:53:53,267 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 22:53:53,267 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-31 22:53:53,267 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-31 22:53:53,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-31 22:53:53,267 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-31 22:53:53,268 INFO L87 Difference]: Start difference. First operand 7766 states and 19525 transitions. Second operand 6 states. [2018-12-31 22:53:53,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 22:53:53,892 INFO L93 Difference]: Finished difference Result 9797 states and 24361 transitions. [2018-12-31 22:53:53,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-31 22:53:53,893 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 109 [2018-12-31 22:53:53,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 22:53:53,909 INFO L225 Difference]: With dead ends: 9797 [2018-12-31 22:53:53,909 INFO L226 Difference]: Without dead ends: 9765 [2018-12-31 22:53:53,910 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-31 22:53:53,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9765 states. [2018-12-31 22:53:53,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9765 to 7798. [2018-12-31 22:53:53,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7798 states. [2018-12-31 22:53:54,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7798 states to 7798 states and 19605 transitions. [2018-12-31 22:53:54,003 INFO L78 Accepts]: Start accepts. Automaton has 7798 states and 19605 transitions. Word has length 109 [2018-12-31 22:53:54,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 22:53:54,004 INFO L480 AbstractCegarLoop]: Abstraction has 7798 states and 19605 transitions. [2018-12-31 22:53:54,004 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-31 22:53:54,004 INFO L276 IsEmpty]: Start isEmpty. Operand 7798 states and 19605 transitions. [2018-12-31 22:53:54,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-12-31 22:53:54,012 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 22:53:54,012 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, 1, 1, 1, 1, 1] [2018-12-31 22:53:54,012 INFO L423 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 22:53:54,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 22:53:54,013 INFO L82 PathProgramCache]: Analyzing trace with hash -1426987714, now seen corresponding path program 1 times [2018-12-31 22:53:54,013 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 22:53:54,013 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 22:53:54,014 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:53:54,014 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 22:53:54,014 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:53:54,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 22:53:54,183 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 22:53:54,184 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 22:53:54,184 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-31 22:53:54,184 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-31 22:53:54,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-31 22:53:54,185 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-12-31 22:53:54,185 INFO L87 Difference]: Start difference. First operand 7798 states and 19605 transitions. Second operand 7 states. [2018-12-31 22:53:54,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 22:53:54,984 INFO L93 Difference]: Finished difference Result 9503 states and 23249 transitions. [2018-12-31 22:53:54,985 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-31 22:53:54,986 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 109 [2018-12-31 22:53:54,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 22:53:54,997 INFO L225 Difference]: With dead ends: 9503 [2018-12-31 22:53:54,997 INFO L226 Difference]: Without dead ends: 9503 [2018-12-31 22:53:54,998 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2018-12-31 22:53:55,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9503 states. [2018-12-31 22:53:55,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9503 to 6646. [2018-12-31 22:53:55,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6646 states. [2018-12-31 22:53:55,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6646 states to 6646 states and 16677 transitions. [2018-12-31 22:53:55,082 INFO L78 Accepts]: Start accepts. Automaton has 6646 states and 16677 transitions. Word has length 109 [2018-12-31 22:53:55,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 22:53:55,082 INFO L480 AbstractCegarLoop]: Abstraction has 6646 states and 16677 transitions. [2018-12-31 22:53:55,082 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-31 22:53:55,082 INFO L276 IsEmpty]: Start isEmpty. Operand 6646 states and 16677 transitions. [2018-12-31 22:53:55,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-12-31 22:53:55,091 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 22:53:55,092 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, 1, 1, 1, 1, 1] [2018-12-31 22:53:55,092 INFO L423 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 22:53:55,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 22:53:55,092 INFO L82 PathProgramCache]: Analyzing trace with hash 147542528, now seen corresponding path program 1 times [2018-12-31 22:53:55,092 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 22:53:55,092 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 22:53:55,096 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:53:55,096 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 22:53:55,097 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:53:55,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 22:53:55,235 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 22:53:55,235 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 22:53:55,236 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-31 22:53:55,236 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-31 22:53:55,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-31 22:53:55,236 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-31 22:53:55,237 INFO L87 Difference]: Start difference. First operand 6646 states and 16677 transitions. Second operand 6 states. [2018-12-31 22:53:57,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 22:53:57,264 INFO L93 Difference]: Finished difference Result 8855 states and 21970 transitions. [2018-12-31 22:53:57,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-31 22:53:57,265 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 109 [2018-12-31 22:53:57,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 22:53:57,276 INFO L225 Difference]: With dead ends: 8855 [2018-12-31 22:53:57,276 INFO L226 Difference]: Without dead ends: 8805 [2018-12-31 22:53:57,276 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-12-31 22:53:57,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8805 states. [2018-12-31 22:53:57,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8805 to 7103. [2018-12-31 22:53:57,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7103 states. [2018-12-31 22:53:57,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7103 states to 7103 states and 17682 transitions. [2018-12-31 22:53:57,364 INFO L78 Accepts]: Start accepts. Automaton has 7103 states and 17682 transitions. Word has length 109 [2018-12-31 22:53:57,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 22:53:57,365 INFO L480 AbstractCegarLoop]: Abstraction has 7103 states and 17682 transitions. [2018-12-31 22:53:57,365 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-31 22:53:57,365 INFO L276 IsEmpty]: Start isEmpty. Operand 7103 states and 17682 transitions. [2018-12-31 22:53:57,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-12-31 22:53:57,374 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 22:53:57,374 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, 1, 1, 1, 1, 1] [2018-12-31 22:53:57,375 INFO L423 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 22:53:57,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 22:53:57,375 INFO L82 PathProgramCache]: Analyzing trace with hash 1313447743, now seen corresponding path program 1 times [2018-12-31 22:53:57,375 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 22:53:57,375 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 22:53:57,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:53:57,380 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 22:53:57,380 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:53:57,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 22:53:58,171 WARN L181 SmtUtils]: Spent 300.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 10 [2018-12-31 22:53:58,466 WARN L181 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 16 DAG size of output: 12 [2018-12-31 22:53:58,476 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 22:53:58,476 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 22:53:58,477 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-31 22:53:58,477 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-31 22:53:58,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-31 22:53:58,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-12-31 22:53:58,478 INFO L87 Difference]: Start difference. First operand 7103 states and 17682 transitions. Second operand 7 states. [2018-12-31 22:53:59,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 22:53:59,471 INFO L93 Difference]: Finished difference Result 9728 states and 23882 transitions. [2018-12-31 22:53:59,472 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-31 22:53:59,472 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 109 [2018-12-31 22:53:59,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 22:53:59,484 INFO L225 Difference]: With dead ends: 9728 [2018-12-31 22:53:59,484 INFO L226 Difference]: Without dead ends: 9696 [2018-12-31 22:53:59,484 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2018-12-31 22:53:59,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9696 states. [2018-12-31 22:53:59,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9696 to 7354. [2018-12-31 22:53:59,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7354 states. [2018-12-31 22:53:59,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7354 states to 7354 states and 18172 transitions. [2018-12-31 22:53:59,577 INFO L78 Accepts]: Start accepts. Automaton has 7354 states and 18172 transitions. Word has length 109 [2018-12-31 22:53:59,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 22:53:59,577 INFO L480 AbstractCegarLoop]: Abstraction has 7354 states and 18172 transitions. [2018-12-31 22:53:59,577 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-31 22:53:59,577 INFO L276 IsEmpty]: Start isEmpty. Operand 7354 states and 18172 transitions. [2018-12-31 22:53:59,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-12-31 22:53:59,584 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 22:53:59,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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 22:53:59,585 INFO L423 AbstractCegarLoop]: === Iteration 21 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 22:53:59,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 22:53:59,585 INFO L82 PathProgramCache]: Analyzing trace with hash -775141055, now seen corresponding path program 1 times [2018-12-31 22:53:59,585 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 22:53:59,585 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 22:53:59,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:53:59,588 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 22:53:59,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:53:59,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 22:53:59,841 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 22:53:59,841 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 22:53:59,841 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-31 22:53:59,841 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-31 22:53:59,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-31 22:53:59,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-12-31 22:53:59,842 INFO L87 Difference]: Start difference. First operand 7354 states and 18172 transitions. Second operand 7 states. [2018-12-31 22:54:00,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 22:54:00,079 INFO L93 Difference]: Finished difference Result 10673 states and 26910 transitions. [2018-12-31 22:54:00,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-31 22:54:00,080 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 109 [2018-12-31 22:54:00,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 22:54:00,095 INFO L225 Difference]: With dead ends: 10673 [2018-12-31 22:54:00,095 INFO L226 Difference]: Without dead ends: 10673 [2018-12-31 22:54:00,095 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-12-31 22:54:00,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10673 states. [2018-12-31 22:54:00,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10673 to 7556. [2018-12-31 22:54:00,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7556 states. [2018-12-31 22:54:00,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7556 states to 7556 states and 18619 transitions. [2018-12-31 22:54:00,192 INFO L78 Accepts]: Start accepts. Automaton has 7556 states and 18619 transitions. Word has length 109 [2018-12-31 22:54:00,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 22:54:00,192 INFO L480 AbstractCegarLoop]: Abstraction has 7556 states and 18619 transitions. [2018-12-31 22:54:00,192 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-31 22:54:00,192 INFO L276 IsEmpty]: Start isEmpty. Operand 7556 states and 18619 transitions. [2018-12-31 22:54:00,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-12-31 22:54:00,199 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 22:54:00,200 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, 1, 1, 1, 1, 1] [2018-12-31 22:54:00,200 INFO L423 AbstractCegarLoop]: === Iteration 22 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 22:54:00,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 22:54:00,200 INFO L82 PathProgramCache]: Analyzing trace with hash 1584165954, now seen corresponding path program 1 times [2018-12-31 22:54:00,200 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 22:54:00,200 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 22:54:00,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:54:00,202 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 22:54:00,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:54:00,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 22:54:00,609 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 22:54:00,610 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 22:54:00,610 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-31 22:54:00,610 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 22:54:00,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 22:54:00,611 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-31 22:54:00,611 INFO L87 Difference]: Start difference. First operand 7556 states and 18619 transitions. Second operand 5 states. [2018-12-31 22:54:00,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 22:54:00,671 INFO L93 Difference]: Finished difference Result 9453 states and 23251 transitions. [2018-12-31 22:54:00,672 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-31 22:54:00,672 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 109 [2018-12-31 22:54:00,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 22:54:00,683 INFO L225 Difference]: With dead ends: 9453 [2018-12-31 22:54:00,683 INFO L226 Difference]: Without dead ends: 9453 [2018-12-31 22:54:00,684 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-12-31 22:54:00,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9453 states. [2018-12-31 22:54:00,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9453 to 6577. [2018-12-31 22:54:00,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6577 states. [2018-12-31 22:54:00,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6577 states to 6577 states and 15710 transitions. [2018-12-31 22:54:00,770 INFO L78 Accepts]: Start accepts. Automaton has 6577 states and 15710 transitions. Word has length 109 [2018-12-31 22:54:00,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 22:54:00,770 INFO L480 AbstractCegarLoop]: Abstraction has 6577 states and 15710 transitions. [2018-12-31 22:54:00,770 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 22:54:00,770 INFO L276 IsEmpty]: Start isEmpty. Operand 6577 states and 15710 transitions. [2018-12-31 22:54:00,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-12-31 22:54:00,777 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 22:54:00,777 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, 1, 1, 1, 1, 1] [2018-12-31 22:54:00,778 INFO L423 AbstractCegarLoop]: === Iteration 23 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 22:54:00,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 22:54:00,778 INFO L82 PathProgramCache]: Analyzing trace with hash 2064882370, now seen corresponding path program 1 times [2018-12-31 22:54:00,778 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 22:54:00,778 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 22:54:00,779 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:54:00,780 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 22:54:00,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:54:00,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 22:54:01,411 WARN L181 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 9 [2018-12-31 22:54:01,425 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 22:54:01,426 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 22:54:01,426 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-31 22:54:01,426 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-31 22:54:01,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-31 22:54:01,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-31 22:54:01,428 INFO L87 Difference]: Start difference. First operand 6577 states and 15710 transitions. Second operand 6 states. [2018-12-31 22:54:02,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 22:54:02,759 INFO L93 Difference]: Finished difference Result 6209 states and 14598 transitions. [2018-12-31 22:54:02,760 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-31 22:54:02,760 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 109 [2018-12-31 22:54:02,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 22:54:02,769 INFO L225 Difference]: With dead ends: 6209 [2018-12-31 22:54:02,769 INFO L226 Difference]: Without dead ends: 6209 [2018-12-31 22:54:02,769 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-12-31 22:54:02,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6209 states. [2018-12-31 22:54:02,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6209 to 5048. [2018-12-31 22:54:02,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5048 states. [2018-12-31 22:54:02,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5048 states to 5048 states and 12047 transitions. [2018-12-31 22:54:02,830 INFO L78 Accepts]: Start accepts. Automaton has 5048 states and 12047 transitions. Word has length 109 [2018-12-31 22:54:02,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 22:54:02,830 INFO L480 AbstractCegarLoop]: Abstraction has 5048 states and 12047 transitions. [2018-12-31 22:54:02,830 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-31 22:54:02,830 INFO L276 IsEmpty]: Start isEmpty. Operand 5048 states and 12047 transitions. [2018-12-31 22:54:02,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-12-31 22:54:02,835 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 22:54:02,836 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, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 22:54:02,836 INFO L423 AbstractCegarLoop]: === Iteration 24 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 22:54:02,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 22:54:02,836 INFO L82 PathProgramCache]: Analyzing trace with hash 938406261, now seen corresponding path program 1 times [2018-12-31 22:54:02,836 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 22:54:02,836 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 22:54:02,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:54:02,838 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 22:54:02,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:54:02,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 22:54:03,107 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 22:54:03,107 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 22:54:03,107 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-31 22:54:03,108 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-31 22:54:03,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-31 22:54:03,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-31 22:54:03,108 INFO L87 Difference]: Start difference. First operand 5048 states and 12047 transitions. Second operand 7 states. [2018-12-31 22:54:04,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 22:54:04,064 INFO L93 Difference]: Finished difference Result 9022 states and 20749 transitions. [2018-12-31 22:54:04,065 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-31 22:54:04,065 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 111 [2018-12-31 22:54:04,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 22:54:04,076 INFO L225 Difference]: With dead ends: 9022 [2018-12-31 22:54:04,077 INFO L226 Difference]: Without dead ends: 8990 [2018-12-31 22:54:04,077 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2018-12-31 22:54:04,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8990 states. [2018-12-31 22:54:04,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8990 to 6491. [2018-12-31 22:54:04,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6491 states. [2018-12-31 22:54:04,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6491 states to 6491 states and 15317 transitions. [2018-12-31 22:54:04,162 INFO L78 Accepts]: Start accepts. Automaton has 6491 states and 15317 transitions. Word has length 111 [2018-12-31 22:54:04,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 22:54:04,162 INFO L480 AbstractCegarLoop]: Abstraction has 6491 states and 15317 transitions. [2018-12-31 22:54:04,162 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-31 22:54:04,162 INFO L276 IsEmpty]: Start isEmpty. Operand 6491 states and 15317 transitions. [2018-12-31 22:54:04,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-12-31 22:54:04,169 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 22:54:04,169 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, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 22:54:04,170 INFO L423 AbstractCegarLoop]: === Iteration 25 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 22:54:04,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 22:54:04,170 INFO L82 PathProgramCache]: Analyzing trace with hash -2111796554, now seen corresponding path program 1 times [2018-12-31 22:54:04,170 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 22:54:04,170 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 22:54:04,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:54:04,172 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 22:54:04,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:54:04,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 22:54:04,657 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 22:54:04,658 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 22:54:04,658 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-31 22:54:04,658 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-31 22:54:04,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-31 22:54:04,658 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-31 22:54:04,659 INFO L87 Difference]: Start difference. First operand 6491 states and 15317 transitions. Second operand 7 states. [2018-12-31 22:54:05,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 22:54:05,089 INFO L93 Difference]: Finished difference Result 7559 states and 17484 transitions. [2018-12-31 22:54:05,090 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-31 22:54:05,090 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 111 [2018-12-31 22:54:05,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 22:54:05,098 INFO L225 Difference]: With dead ends: 7559 [2018-12-31 22:54:05,099 INFO L226 Difference]: Without dead ends: 7559 [2018-12-31 22:54:05,099 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 [2018-12-31 22:54:05,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7559 states. [2018-12-31 22:54:05,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7559 to 6563. [2018-12-31 22:54:05,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6563 states. [2018-12-31 22:54:05,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6563 states to 6563 states and 15457 transitions. [2018-12-31 22:54:05,176 INFO L78 Accepts]: Start accepts. Automaton has 6563 states and 15457 transitions. Word has length 111 [2018-12-31 22:54:05,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 22:54:05,177 INFO L480 AbstractCegarLoop]: Abstraction has 6563 states and 15457 transitions. [2018-12-31 22:54:05,177 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-31 22:54:05,177 INFO L276 IsEmpty]: Start isEmpty. Operand 6563 states and 15457 transitions. [2018-12-31 22:54:05,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-12-31 22:54:05,184 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 22:54:05,184 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, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 22:54:05,185 INFO L423 AbstractCegarLoop]: === Iteration 26 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 22:54:05,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 22:54:05,186 INFO L82 PathProgramCache]: Analyzing trace with hash 1268172022, now seen corresponding path program 1 times [2018-12-31 22:54:05,186 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 22:54:05,186 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 22:54:05,187 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:54:05,189 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 22:54:05,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:54:05,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 22:54:05,356 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 22:54:05,357 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 22:54:05,357 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-31 22:54:05,357 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 22:54:05,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 22:54:05,357 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-31 22:54:05,358 INFO L87 Difference]: Start difference. First operand 6563 states and 15457 transitions. Second operand 5 states. [2018-12-31 22:54:05,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 22:54:05,624 INFO L93 Difference]: Finished difference Result 6915 states and 16321 transitions. [2018-12-31 22:54:05,625 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-31 22:54:05,625 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 111 [2018-12-31 22:54:05,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 22:54:05,634 INFO L225 Difference]: With dead ends: 6915 [2018-12-31 22:54:05,634 INFO L226 Difference]: Without dead ends: 6883 [2018-12-31 22:54:05,634 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-12-31 22:54:05,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6883 states. [2018-12-31 22:54:05,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6883 to 5869. [2018-12-31 22:54:05,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5869 states. [2018-12-31 22:54:05,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5869 states to 5869 states and 13792 transitions. [2018-12-31 22:54:05,703 INFO L78 Accepts]: Start accepts. Automaton has 5869 states and 13792 transitions. Word has length 111 [2018-12-31 22:54:05,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 22:54:05,703 INFO L480 AbstractCegarLoop]: Abstraction has 5869 states and 13792 transitions. [2018-12-31 22:54:05,704 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 22:54:05,704 INFO L276 IsEmpty]: Start isEmpty. Operand 5869 states and 13792 transitions. [2018-12-31 22:54:05,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-12-31 22:54:05,709 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 22:54:05,710 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, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 22:54:05,710 INFO L423 AbstractCegarLoop]: === Iteration 27 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 22:54:05,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 22:54:05,710 INFO L82 PathProgramCache]: Analyzing trace with hash -1782030793, now seen corresponding path program 1 times [2018-12-31 22:54:05,710 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 22:54:05,710 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 22:54:05,712 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:54:05,712 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 22:54:05,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:54:05,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 22:54:06,078 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 22:54:06,078 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 22:54:06,078 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-31 22:54:06,079 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 22:54:06,079 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 22:54:06,079 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-31 22:54:06,079 INFO L87 Difference]: Start difference. First operand 5869 states and 13792 transitions. Second operand 5 states. [2018-12-31 22:54:06,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 22:54:06,703 INFO L93 Difference]: Finished difference Result 7113 states and 16468 transitions. [2018-12-31 22:54:06,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-31 22:54:06,704 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 111 [2018-12-31 22:54:06,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 22:54:06,712 INFO L225 Difference]: With dead ends: 7113 [2018-12-31 22:54:06,712 INFO L226 Difference]: Without dead ends: 7113 [2018-12-31 22:54:06,713 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-12-31 22:54:06,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7113 states. [2018-12-31 22:54:06,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7113 to 5460. [2018-12-31 22:54:06,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5460 states. [2018-12-31 22:54:06,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5460 states to 5460 states and 12829 transitions. [2018-12-31 22:54:06,773 INFO L78 Accepts]: Start accepts. Automaton has 5460 states and 12829 transitions. Word has length 111 [2018-12-31 22:54:06,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 22:54:06,774 INFO L480 AbstractCegarLoop]: Abstraction has 5460 states and 12829 transitions. [2018-12-31 22:54:06,774 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 22:54:06,774 INFO L276 IsEmpty]: Start isEmpty. Operand 5460 states and 12829 transitions. [2018-12-31 22:54:06,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-12-31 22:54:06,779 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 22:54:06,779 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 22:54:06,780 INFO L423 AbstractCegarLoop]: === Iteration 28 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 22:54:06,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 22:54:06,780 INFO L82 PathProgramCache]: Analyzing trace with hash -755343524, now seen corresponding path program 1 times [2018-12-31 22:54:06,780 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 22:54:06,780 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 22:54:06,781 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:54:06,782 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 22:54:06,782 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:54:06,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 22:54:07,101 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 22:54:07,101 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 22:54:07,101 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-31 22:54:07,101 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-31 22:54:07,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-31 22:54:07,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-12-31 22:54:07,102 INFO L87 Difference]: Start difference. First operand 5460 states and 12829 transitions. Second operand 9 states. [2018-12-31 22:54:07,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 22:54:07,357 INFO L93 Difference]: Finished difference Result 7724 states and 18634 transitions. [2018-12-31 22:54:07,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-31 22:54:07,358 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 113 [2018-12-31 22:54:07,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 22:54:07,363 INFO L225 Difference]: With dead ends: 7724 [2018-12-31 22:54:07,363 INFO L226 Difference]: Without dead ends: 2456 [2018-12-31 22:54:07,363 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2018-12-31 22:54:07,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2456 states. [2018-12-31 22:54:07,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2456 to 2456. [2018-12-31 22:54:07,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2456 states. [2018-12-31 22:54:07,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2456 states to 2456 states and 6129 transitions. [2018-12-31 22:54:07,389 INFO L78 Accepts]: Start accepts. Automaton has 2456 states and 6129 transitions. Word has length 113 [2018-12-31 22:54:07,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 22:54:07,389 INFO L480 AbstractCegarLoop]: Abstraction has 2456 states and 6129 transitions. [2018-12-31 22:54:07,389 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-31 22:54:07,389 INFO L276 IsEmpty]: Start isEmpty. Operand 2456 states and 6129 transitions. [2018-12-31 22:54:07,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-12-31 22:54:07,393 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 22:54:07,393 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 22:54:07,393 INFO L423 AbstractCegarLoop]: === Iteration 29 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 22:54:07,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 22:54:07,393 INFO L82 PathProgramCache]: Analyzing trace with hash 1447618370, now seen corresponding path program 2 times [2018-12-31 22:54:07,393 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 22:54:07,394 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 22:54:07,395 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:54:07,395 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 22:54:07,395 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:54:07,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-31 22:54:07,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-31 22:54:07,493 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-31 22:54:07,716 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-12-31 22:54:07,721 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.12 10:54:07 BasicIcfg [2018-12-31 22:54:07,721 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-31 22:54:07,721 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-31 22:54:07,721 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-31 22:54:07,722 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-31 22:54:07,724 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 10:53:01" (3/4) ... [2018-12-31 22:54:07,728 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-31 22:54:07,971 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2018-12-31 22:54:07,976 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-31 22:54:07,977 INFO L168 Benchmark]: Toolchain (without parser) took 69285.20 ms. Allocated memory was 1.0 GB in the beginning and 4.9 GB in the end (delta: 3.8 GB). Free memory was 950.0 MB in the beginning and 1.3 GB in the end (delta: -319.6 MB). Peak memory consumption was 3.5 GB. Max. memory is 11.5 GB. [2018-12-31 22:54:07,978 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-31 22:54:07,979 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1041.19 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.1 MB). Free memory was 944.6 MB in the beginning and 1.1 GB in the end (delta: -164.9 MB). Peak memory consumption was 26.1 MB. Max. memory is 11.5 GB. [2018-12-31 22:54:07,979 INFO L168 Benchmark]: Boogie Procedure Inliner took 88.07 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.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. [2018-12-31 22:54:07,979 INFO L168 Benchmark]: Boogie Preprocessor took 61.80 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-31 22:54:07,980 INFO L168 Benchmark]: RCFGBuilder took 1549.80 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: 59.6 MB). Peak memory consumption was 59.6 MB. Max. memory is 11.5 GB. [2018-12-31 22:54:07,980 INFO L168 Benchmark]: TraceAbstraction took 66283.17 ms. Allocated memory was 1.2 GB in the beginning and 4.9 GB in the end (delta: 3.7 GB). Free memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: -271.3 MB). Peak memory consumption was 3.4 GB. Max. memory is 11.5 GB. [2018-12-31 22:54:07,980 INFO L168 Benchmark]: Witness Printer took 254.85 ms. Allocated memory is still 4.9 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 44.7 MB). Peak memory consumption was 44.7 MB. Max. memory is 11.5 GB. [2018-12-31 22:54:07,987 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 1041.19 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.1 MB). Free memory was 944.6 MB in the beginning and 1.1 GB in the end (delta: -164.9 MB). Peak memory consumption was 26.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 88.07 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.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 61.80 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 1549.80 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: 59.6 MB). Peak memory consumption was 59.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 66283.17 ms. Allocated memory was 1.2 GB in the beginning and 4.9 GB in the end (delta: 3.7 GB). Free memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: -271.3 MB). Peak memory consumption was 3.4 GB. Max. memory is 11.5 GB. * Witness Printer took 254.85 ms. Allocated memory is still 4.9 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 44.7 MB). Peak memory consumption was 44.7 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L671] -1 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L673] -1 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0] [L675] -1 int __unbuffered_p1_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0] [L676] -1 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0] [L677] -1 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L679] -1 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L681] -1 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L682] -1 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L683] -1 int y$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L684] -1 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0] [L685] -1 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0] [L686] -1 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0] [L687] -1 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0] [L688] -1 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0] [L689] -1 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0] [L690] -1 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0] [L691] -1 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}] [L692] -1 int y$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0] [L693] -1 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0] [L694] -1 int y$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0] [L695] -1 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L696] -1 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L697] -1 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L773] -1 pthread_t t1719; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L774] FCALL, FORK -1 pthread_create(&t1719, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L775] -1 pthread_t t1720; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L776] FCALL, FORK -1 pthread_create(&t1720, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L721] 0 y$w_buff1 = y$w_buff0 [L722] 0 y$w_buff0 = 2 [L723] 0 y$w_buff1_used = y$w_buff0_used [L724] 0 y$w_buff0_used = (_Bool)1 [L4] COND FALSE 0 !(!expression) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L726] 0 y$r_buff1_thd0 = y$r_buff0_thd0 [L727] 0 y$r_buff1_thd1 = y$r_buff0_thd1 [L728] 0 y$r_buff1_thd2 = y$r_buff0_thd2 [L729] 0 y$r_buff0_thd2 = (_Bool)1 [L732] 0 weak$$choice0 = __VERIFIER_nondet_pointer() [L733] 0 weak$$choice2 = __VERIFIER_nondet_pointer() [L734] 0 y$flush_delayed = weak$$choice2 [L735] 0 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=0, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L736] 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_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=0, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L736] EXPR 0 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=0, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L736] 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_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=0, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L736] 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) [L737] 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_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=0, y=2, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L737] 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)) [L738] 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_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=0, y=2, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L738] 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)) [L739] 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_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=0, y=2, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L739] 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)) [L740] 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_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=0, y=2, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L740] 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)) [L741] 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_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=0, y=2, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L741] 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)) [L742] 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_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=0, y=2, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L742] 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)) [L743] 0 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=0, y=2, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L744] EXPR 0 y$flush_delayed ? y$mem_tmp : y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=0, y=2, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L744] 0 y = y$flush_delayed ? y$mem_tmp : y [L745] 0 y$flush_delayed = (_Bool)0 [L748] 0 __unbuffered_p1_EBX = x VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L701] 1 x = 1 [L704] 1 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L707] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L707] EXPR 1 y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y=1] [L707] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y)=1, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y=1] [L707] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L708] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L708] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L751] EXPR 0 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L751] 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) [L752] EXPR 0 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L752] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L753] EXPR 0 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L753] 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 [L754] EXPR 0 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L754] 0 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L755] EXPR 0 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L755] 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 [L758] 0 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L709] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used=0, y$w_buff1=0, y$w_buff1_used=0] [L709] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L710] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1=0, y$w_buff1=0, y$w_buff1_used=0] [L710] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L711] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1=0, y$w_buff1=0, y$w_buff1_used=0] [L711] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L714] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L778] -1 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L782] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L782] EXPR -1 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L782] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L782] -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) [L783] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L783] -1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L784] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L784] -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 [L785] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L785] -1 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L786] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L786] -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 [L789] -1 weak$$choice0 = __VERIFIER_nondet_pointer() [L790] -1 weak$$choice2 = __VERIFIER_nondet_pointer() [L791] -1 y$flush_delayed = weak$$choice2 [L792] -1 y$mem_tmp = y VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L793] EXPR -1 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L793] -1 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L794] EXPR -1 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L794] -1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L795] EXPR -1 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L795] -1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L796] EXPR -1 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L796] -1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L797] EXPR -1 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L797] -1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L798] EXPR -1 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L798] -1 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L799] EXPR -1 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L799] -1 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L800] -1 main$tmp_guard1 = !(y == 2 && __unbuffered_p1_EAX == 2 && __unbuffered_p1_EBX == 0) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L801] EXPR -1 y$flush_delayed ? y$mem_tmp : y VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L801] -1 y = y$flush_delayed ? y$mem_tmp : y [L802] -1 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L4] COND TRUE -1 !expression VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L4] -1 __VERIFIER_error() VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 264 locations, 3 error locations. UNSAFE Result, 66.0s OverallTime, 29 OverallIterations, 1 TraceHistogramMax, 28.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 9617 SDtfs, 9336 SDslu, 20191 SDs, 0 SdLazy, 7710 SolverSat, 477 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 16.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 262 GetRequests, 73 SyntacticMatches, 26 SemanticMatches, 163 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 8.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=109739occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 21.2s AutomataMinimizationTime, 28 MinimizatonAttempts, 201928 StatesRemovedByMinimization, 26 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 7.8s InterpolantComputationTime, 2784 NumberOfCodeBlocks, 2784 NumberOfCodeBlocksAsserted, 29 NumberOfCheckSat, 2643 ConstructedInterpolants, 0 QuantifiedInterpolants, 579609 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...