./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/pthread-wmm/mix000_tso.oepc_false-unreach-call.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0ed9222f Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/svcomp/c/pthread-wmm/mix000_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 c88656182442dc130c6177960ddd26b8e0100871 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.24-0ed9222-m [2019-01-12 22:28:01,674 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-12 22:28:01,676 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-12 22:28:01,690 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-12 22:28:01,690 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-12 22:28:01,691 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-12 22:28:01,692 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-12 22:28:01,694 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-12 22:28:01,696 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-12 22:28:01,697 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-12 22:28:01,698 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-12 22:28:01,699 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-12 22:28:01,699 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-12 22:28:01,701 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-12 22:28:01,702 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-12 22:28:01,703 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-12 22:28:01,704 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-12 22:28:01,706 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-12 22:28:01,708 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-12 22:28:01,710 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-12 22:28:01,711 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-12 22:28:01,713 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-12 22:28:01,716 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-12 22:28:01,716 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-12 22:28:01,716 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-12 22:28:01,717 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-12 22:28:01,719 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-12 22:28:01,720 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-12 22:28:01,720 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-12 22:28:01,722 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-12 22:28:01,722 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-12 22:28:01,723 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-12 22:28:01,723 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-12 22:28:01,723 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-12 22:28:01,725 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-12 22:28:01,726 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-12 22:28:01,726 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-01-12 22:28:01,747 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-12 22:28:01,748 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-12 22:28:01,750 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-12 22:28:01,751 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-12 22:28:01,751 INFO L133 SettingsManager]: * Use SBE=true [2019-01-12 22:28:01,751 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-12 22:28:01,751 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-12 22:28:01,751 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-12 22:28:01,752 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-12 22:28:01,752 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-12 22:28:01,752 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-12 22:28:01,752 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-12 22:28:01,752 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-12 22:28:01,752 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-12 22:28:01,753 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-12 22:28:01,755 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-12 22:28:01,755 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-12 22:28:01,755 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-12 22:28:01,755 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-12 22:28:01,755 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-12 22:28:01,755 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-12 22:28:01,757 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-12 22:28:01,758 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-12 22:28:01,758 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-12 22:28:01,758 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-12 22:28:01,758 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-12 22:28:01,759 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-12 22:28:01,759 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-12 22:28:01,759 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 -> c88656182442dc130c6177960ddd26b8e0100871 [2019-01-12 22:28:01,823 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-12 22:28:01,840 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-12 22:28:01,843 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-12 22:28:01,844 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-12 22:28:01,845 INFO L276 PluginConnector]: CDTParser initialized [2019-01-12 22:28:01,846 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/pthread-wmm/mix000_tso.oepc_false-unreach-call.i [2019-01-12 22:28:01,913 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1b9d0a0d9/1b5559cf614747ab845311efeec262d2/FLAGe4663f7c3 [2019-01-12 22:28:02,399 INFO L307 CDTParser]: Found 1 translation units. [2019-01-12 22:28:02,399 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/pthread-wmm/mix000_tso.oepc_false-unreach-call.i [2019-01-12 22:28:02,415 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1b9d0a0d9/1b5559cf614747ab845311efeec262d2/FLAGe4663f7c3 [2019-01-12 22:28:02,680 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1b9d0a0d9/1b5559cf614747ab845311efeec262d2 [2019-01-12 22:28:02,683 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-12 22:28:02,684 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-12 22:28:02,685 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-12 22:28:02,686 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-12 22:28:02,692 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-12 22:28:02,693 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 10:28:02" (1/1) ... [2019-01-12 22:28:02,696 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1f9cdb9b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 10:28:02, skipping insertion in model container [2019-01-12 22:28:02,696 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 10:28:02" (1/1) ... [2019-01-12 22:28:02,705 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-12 22:28:02,764 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-12 22:28:03,241 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 22:28:03,262 INFO L191 MainTranslator]: Completed pre-run [2019-01-12 22:28:03,428 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 22:28:03,526 INFO L195 MainTranslator]: Completed translation [2019-01-12 22:28:03,527 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 10:28:03 WrapperNode [2019-01-12 22:28:03,527 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-12 22:28:03,529 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-12 22:28:03,529 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-12 22:28:03,529 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-12 22:28:03,539 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 10:28:03" (1/1) ... [2019-01-12 22:28:03,570 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 10:28:03" (1/1) ... [2019-01-12 22:28:03,616 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-12 22:28:03,619 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-12 22:28:03,619 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-12 22:28:03,619 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-12 22:28:03,635 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 10:28:03" (1/1) ... [2019-01-12 22:28:03,635 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 10:28:03" (1/1) ... [2019-01-12 22:28:03,640 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 10:28:03" (1/1) ... [2019-01-12 22:28:03,640 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 10:28:03" (1/1) ... [2019-01-12 22:28:03,653 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 10:28:03" (1/1) ... [2019-01-12 22:28:03,658 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 10:28:03" (1/1) ... [2019-01-12 22:28:03,662 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 10:28:03" (1/1) ... [2019-01-12 22:28:03,668 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-12 22:28:03,668 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-12 22:28:03,668 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-12 22:28:03,668 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-12 22:28:03,669 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 10:28:03" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-12 22:28:03,751 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-12 22:28:03,751 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-01-12 22:28:03,751 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-12 22:28:03,752 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-12 22:28:03,752 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-01-12 22:28:03,752 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-01-12 22:28:03,752 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-01-12 22:28:03,752 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-01-12 22:28:03,752 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-01-12 22:28:03,753 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-12 22:28:03,753 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-12 22:28:03,755 WARN L204 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-01-12 22:28:05,097 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-12 22:28:05,098 INFO L286 CfgBuilder]: Removed 8 assue(true) statements. [2019-01-12 22:28:05,100 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 10:28:05 BoogieIcfgContainer [2019-01-12 22:28:05,100 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-12 22:28:05,101 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-12 22:28:05,101 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-12 22:28:05,104 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-12 22:28:05,105 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.01 10:28:02" (1/3) ... [2019-01-12 22:28:05,105 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@694dc15e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 10:28:05, skipping insertion in model container [2019-01-12 22:28:05,105 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 10:28:03" (2/3) ... [2019-01-12 22:28:05,106 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@694dc15e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 10:28:05, skipping insertion in model container [2019-01-12 22:28:05,106 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 10:28:05" (3/3) ... [2019-01-12 22:28:05,108 INFO L112 eAbstractionObserver]: Analyzing ICFG mix000_tso.oepc_false-unreach-call.i [2019-01-12 22:28:05,162 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:05,162 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:05,163 WARN L317 ript$VariableManager]: TermVariabe Thread1_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:05,163 WARN L317 ript$VariableManager]: TermVariabe Thread1_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:05,163 WARN L317 ript$VariableManager]: TermVariabe Thread1_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:05,163 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:05,164 WARN L317 ript$VariableManager]: TermVariabe Thread1_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:05,164 WARN L317 ript$VariableManager]: TermVariabe Thread1_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:05,165 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:05,165 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:05,165 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:05,165 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:05,165 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:05,166 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:05,166 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:05,166 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:05,166 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:05,167 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:05,167 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:05,167 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:05,167 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:05,168 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:05,168 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:05,168 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:05,168 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:05,168 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:05,169 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:05,169 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:05,169 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:05,170 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:05,170 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:05,170 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:05,170 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:05,170 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:05,171 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:05,171 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:05,171 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:05,171 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:05,172 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:05,172 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:05,172 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:05,172 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:05,172 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:05,173 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:05,173 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:05,173 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:05,173 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:05,173 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:05,174 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:05,174 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:05,174 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:05,174 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:05,175 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:05,175 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:05,175 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:05,175 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:05,175 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:05,176 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:05,176 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:05,176 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:05,176 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:05,176 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:05,177 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:05,177 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:05,177 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:05,177 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:05,177 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:05,178 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:05,178 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:05,178 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:05,178 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:05,178 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:05,179 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:05,179 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:05,179 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:05,179 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:05,180 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:05,180 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:05,180 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:05,180 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:05,180 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:05,180 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:05,181 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:05,181 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:05,181 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:05,181 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:05,182 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:05,182 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:05,182 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:05,182 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:05,182 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:05,183 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:05,183 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:05,183 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:05,183 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:05,183 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:05,184 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:05,184 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:05,184 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:05,184 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:05,184 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:05,185 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:05,185 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:05,185 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:05,185 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:05,185 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:05,186 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:05,186 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:05,187 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:05,187 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:05,187 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:05,187 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:05,188 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:05,188 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:05,188 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:05,188 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:05,188 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:05,189 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:05,189 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:05,189 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:05,189 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet32.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:05,189 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet32.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:05,190 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:05,190 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:05,190 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet32.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:05,190 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet32.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:05,191 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:05,191 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:05,192 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:05,192 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:05,192 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:05,192 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:05,192 WARN L317 ript$VariableManager]: TermVariabe Thread0_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:05,192 WARN L317 ript$VariableManager]: TermVariabe Thread0_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:05,193 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:05,193 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:05,193 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:05,193 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:05,194 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:05,194 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:05,194 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:05,194 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:05,194 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:05,195 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:05,195 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:05,195 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:05,195 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:05,195 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:05,196 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:05,196 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:05,196 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:05,196 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:05,196 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:05,197 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:05,197 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:05,197 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:05,197 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:05,197 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:05,198 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:05,198 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:05,198 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:05,198 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:05,198 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:05,199 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:05,199 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:05,199 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:05,199 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:05,199 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:05,199 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:05,200 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:05,200 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:05,200 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:05,200 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:05,200 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:05,201 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:05,201 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:05,201 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:05,201 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:05,201 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:05,202 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:05,202 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:05,202 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:05,202 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:05,202 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:05,203 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:05,203 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:05,203 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:05,203 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:05,203 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:05,204 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:05,204 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:05,204 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:05,204 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:05,204 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:05,205 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:05,205 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:05,205 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:05,205 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:05,205 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:05,206 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:05,206 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:05,206 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:05,206 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:05,206 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:05,207 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:05,207 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:05,207 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:05,207 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:05,207 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:05,208 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:05,208 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:05,208 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:05,208 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:05,208 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:05,209 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:05,209 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:05,209 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:05,209 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:05,209 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:05,210 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:05,210 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:05,210 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:05,210 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:05,210 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:05,211 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:05,211 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:05,211 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:05,211 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:05,211 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:05,212 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:05,212 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:05,212 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:05,212 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:05,212 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:05,213 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:05,213 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:05,213 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:05,213 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:05,213 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:05,214 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:05,214 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:05,214 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:05,214 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet62.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:05,214 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet62.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:05,215 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:05,215 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:05,215 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet62.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:05,215 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet62.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:28:05,247 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-01-12 22:28:05,247 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-12 22:28:05,256 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2019-01-12 22:28:05,272 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2019-01-12 22:28:05,294 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-12 22:28:05,295 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-12 22:28:05,295 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-12 22:28:05,295 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-12 22:28:05,295 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-12 22:28:05,296 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-12 22:28:05,296 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-12 22:28:05,296 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-12 22:28:05,296 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-12 22:28:05,311 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 186places, 245 transitions [2019-01-12 22:28:17,007 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 104360 states. [2019-01-12 22:28:17,009 INFO L276 IsEmpty]: Start isEmpty. Operand 104360 states. [2019-01-12 22:28:17,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-01-12 22:28:17,016 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 22:28:17,017 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] [2019-01-12 22:28:17,019 INFO L423 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 22:28:17,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 22:28:17,027 INFO L82 PathProgramCache]: Analyzing trace with hash -1413658612, now seen corresponding path program 1 times [2019-01-12 22:28:17,029 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 22:28:17,030 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 22:28:17,088 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:28:17,088 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 22:28:17,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:28:17,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 22:28:17,378 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 22:28:17,381 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 22:28:17,382 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 22:28:17,386 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 22:28:17,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 22:28:17,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-12 22:28:17,404 INFO L87 Difference]: Start difference. First operand 104360 states. Second operand 4 states. [2019-01-12 22:28:19,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 22:28:19,704 INFO L93 Difference]: Finished difference Result 192000 states and 772893 transitions. [2019-01-12 22:28:19,705 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 22:28:19,706 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 35 [2019-01-12 22:28:19,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 22:28:20,693 INFO L225 Difference]: With dead ends: 192000 [2019-01-12 22:28:20,693 INFO L226 Difference]: Without dead ends: 135832 [2019-01-12 22:28:20,695 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-12 22:28:23,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135832 states. [2019-01-12 22:28:26,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135832 to 77068. [2019-01-12 22:28:26,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77068 states. [2019-01-12 22:28:26,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77068 states to 77068 states and 313611 transitions. [2019-01-12 22:28:26,902 INFO L78 Accepts]: Start accepts. Automaton has 77068 states and 313611 transitions. Word has length 35 [2019-01-12 22:28:26,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 22:28:26,904 INFO L480 AbstractCegarLoop]: Abstraction has 77068 states and 313611 transitions. [2019-01-12 22:28:26,904 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 22:28:26,904 INFO L276 IsEmpty]: Start isEmpty. Operand 77068 states and 313611 transitions. [2019-01-12 22:28:26,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-01-12 22:28:26,916 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 22:28:26,916 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 22:28:26,916 INFO L423 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 22:28:26,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 22:28:26,917 INFO L82 PathProgramCache]: Analyzing trace with hash 512759921, now seen corresponding path program 1 times [2019-01-12 22:28:26,918 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 22:28:26,918 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 22:28:26,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:28:26,931 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 22:28:26,931 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:28:26,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 22:28:27,096 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 22:28:27,097 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 22:28:27,097 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 22:28:27,099 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 22:28:27,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 22:28:27,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-12 22:28:27,100 INFO L87 Difference]: Start difference. First operand 77068 states and 313611 transitions. Second operand 4 states. [2019-01-12 22:28:27,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 22:28:27,646 INFO L93 Difference]: Finished difference Result 16846 states and 57032 transitions. [2019-01-12 22:28:27,647 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-12 22:28:27,647 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 47 [2019-01-12 22:28:27,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 22:28:27,707 INFO L225 Difference]: With dead ends: 16846 [2019-01-12 22:28:27,708 INFO L226 Difference]: Without dead ends: 13306 [2019-01-12 22:28:27,709 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-12 22:28:27,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13306 states. [2019-01-12 22:28:28,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13306 to 13306. [2019-01-12 22:28:28,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13306 states. [2019-01-12 22:28:28,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13306 states to 13306 states and 43727 transitions. [2019-01-12 22:28:28,159 INFO L78 Accepts]: Start accepts. Automaton has 13306 states and 43727 transitions. Word has length 47 [2019-01-12 22:28:28,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 22:28:28,159 INFO L480 AbstractCegarLoop]: Abstraction has 13306 states and 43727 transitions. [2019-01-12 22:28:28,159 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 22:28:28,160 INFO L276 IsEmpty]: Start isEmpty. Operand 13306 states and 43727 transitions. [2019-01-12 22:28:28,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-01-12 22:28:28,163 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 22:28:28,164 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 22:28:28,164 INFO L423 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 22:28:28,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 22:28:28,164 INFO L82 PathProgramCache]: Analyzing trace with hash -1044252158, now seen corresponding path program 1 times [2019-01-12 22:28:28,164 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 22:28:28,164 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 22:28:28,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:28:28,171 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 22:28:28,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:28:28,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 22:28:28,455 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 22:28:28,456 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 22:28:28,456 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-12 22:28:28,457 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 22:28:28,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 22:28:28,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-12 22:28:28,458 INFO L87 Difference]: Start difference. First operand 13306 states and 43727 transitions. Second operand 5 states. [2019-01-12 22:28:30,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 22:28:30,588 INFO L93 Difference]: Finished difference Result 25424 states and 82823 transitions. [2019-01-12 22:28:30,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-12 22:28:30,589 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 48 [2019-01-12 22:28:30,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 22:28:30,690 INFO L225 Difference]: With dead ends: 25424 [2019-01-12 22:28:30,690 INFO L226 Difference]: Without dead ends: 25356 [2019-01-12 22:28:30,691 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-01-12 22:28:30,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25356 states. [2019-01-12 22:28:31,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25356 to 16160. [2019-01-12 22:28:31,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16160 states. [2019-01-12 22:28:31,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16160 states to 16160 states and 51762 transitions. [2019-01-12 22:28:31,183 INFO L78 Accepts]: Start accepts. Automaton has 16160 states and 51762 transitions. Word has length 48 [2019-01-12 22:28:31,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 22:28:31,184 INFO L480 AbstractCegarLoop]: Abstraction has 16160 states and 51762 transitions. [2019-01-12 22:28:31,184 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 22:28:31,184 INFO L276 IsEmpty]: Start isEmpty. Operand 16160 states and 51762 transitions. [2019-01-12 22:28:31,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-01-12 22:28:31,189 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 22:28:31,189 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 22:28:31,190 INFO L423 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 22:28:31,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 22:28:31,190 INFO L82 PathProgramCache]: Analyzing trace with hash -1766694552, now seen corresponding path program 1 times [2019-01-12 22:28:31,190 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 22:28:31,190 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 22:28:31,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:28:31,195 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 22:28:31,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:28:31,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 22:28:31,282 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 22:28:31,283 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 22:28:31,283 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 22:28:31,283 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 22:28:31,284 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 22:28:31,284 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 22:28:31,284 INFO L87 Difference]: Start difference. First operand 16160 states and 51762 transitions. Second operand 3 states. [2019-01-12 22:28:31,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 22:28:31,826 INFO L93 Difference]: Finished difference Result 30242 states and 95729 transitions. [2019-01-12 22:28:31,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 22:28:31,827 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2019-01-12 22:28:31,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 22:28:31,904 INFO L225 Difference]: With dead ends: 30242 [2019-01-12 22:28:31,905 INFO L226 Difference]: Without dead ends: 30242 [2019-01-12 22:28:31,905 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 22:28:32,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30242 states. [2019-01-12 22:28:32,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30242 to 24713. [2019-01-12 22:28:32,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24713 states. [2019-01-12 22:28:32,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24713 states to 24713 states and 78043 transitions. [2019-01-12 22:28:32,557 INFO L78 Accepts]: Start accepts. Automaton has 24713 states and 78043 transitions. Word has length 50 [2019-01-12 22:28:32,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 22:28:32,559 INFO L480 AbstractCegarLoop]: Abstraction has 24713 states and 78043 transitions. [2019-01-12 22:28:32,559 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 22:28:32,559 INFO L276 IsEmpty]: Start isEmpty. Operand 24713 states and 78043 transitions. [2019-01-12 22:28:32,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-01-12 22:28:32,564 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 22:28:32,564 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 22:28:32,565 INFO L423 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 22:28:32,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 22:28:32,565 INFO L82 PathProgramCache]: Analyzing trace with hash 1751055411, now seen corresponding path program 1 times [2019-01-12 22:28:32,565 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 22:28:32,565 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 22:28:32,569 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:28:32,569 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 22:28:32,569 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:28:32,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 22:28:32,941 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 22:28:32,941 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 22:28:32,941 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-12 22:28:32,941 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-12 22:28:32,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-12 22:28:32,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-01-12 22:28:32,942 INFO L87 Difference]: Start difference. First operand 24713 states and 78043 transitions. Second operand 6 states. [2019-01-12 22:28:34,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 22:28:34,324 INFO L93 Difference]: Finished difference Result 35355 states and 111009 transitions. [2019-01-12 22:28:34,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-12 22:28:34,325 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 54 [2019-01-12 22:28:34,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 22:28:34,386 INFO L225 Difference]: With dead ends: 35355 [2019-01-12 22:28:34,387 INFO L226 Difference]: Without dead ends: 35283 [2019-01-12 22:28:34,387 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2019-01-12 22:28:34,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35283 states. [2019-01-12 22:28:35,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35283 to 24760. [2019-01-12 22:28:35,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24760 states. [2019-01-12 22:28:35,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24760 states to 24760 states and 78149 transitions. [2019-01-12 22:28:35,158 INFO L78 Accepts]: Start accepts. Automaton has 24760 states and 78149 transitions. Word has length 54 [2019-01-12 22:28:35,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 22:28:35,158 INFO L480 AbstractCegarLoop]: Abstraction has 24760 states and 78149 transitions. [2019-01-12 22:28:35,158 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-12 22:28:35,158 INFO L276 IsEmpty]: Start isEmpty. Operand 24760 states and 78149 transitions. [2019-01-12 22:28:35,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-01-12 22:28:35,171 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 22:28:35,172 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] [2019-01-12 22:28:35,172 INFO L423 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 22:28:35,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 22:28:35,172 INFO L82 PathProgramCache]: Analyzing trace with hash 642841615, now seen corresponding path program 1 times [2019-01-12 22:28:35,173 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 22:28:35,173 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 22:28:35,177 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:28:35,177 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 22:28:35,177 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:28:35,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 22:28:35,304 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 22:28:35,305 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 22:28:35,306 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 22:28:35,306 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 22:28:35,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 22:28:35,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-12 22:28:35,309 INFO L87 Difference]: Start difference. First operand 24760 states and 78149 transitions. Second operand 4 states. [2019-01-12 22:28:35,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 22:28:35,758 INFO L93 Difference]: Finished difference Result 28877 states and 90795 transitions. [2019-01-12 22:28:35,758 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-12 22:28:35,759 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 62 [2019-01-12 22:28:35,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 22:28:35,818 INFO L225 Difference]: With dead ends: 28877 [2019-01-12 22:28:35,818 INFO L226 Difference]: Without dead ends: 28877 [2019-01-12 22:28:35,818 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-12 22:28:36,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28877 states. [2019-01-12 22:28:36,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28877 to 28097. [2019-01-12 22:28:36,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28097 states. [2019-01-12 22:28:36,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28097 states to 28097 states and 88459 transitions. [2019-01-12 22:28:36,932 INFO L78 Accepts]: Start accepts. Automaton has 28097 states and 88459 transitions. Word has length 62 [2019-01-12 22:28:36,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 22:28:36,933 INFO L480 AbstractCegarLoop]: Abstraction has 28097 states and 88459 transitions. [2019-01-12 22:28:36,933 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 22:28:36,933 INFO L276 IsEmpty]: Start isEmpty. Operand 28097 states and 88459 transitions. [2019-01-12 22:28:36,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-01-12 22:28:36,945 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 22:28:36,946 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] [2019-01-12 22:28:36,946 INFO L423 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 22:28:36,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 22:28:36,946 INFO L82 PathProgramCache]: Analyzing trace with hash -1909315346, now seen corresponding path program 1 times [2019-01-12 22:28:36,946 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 22:28:36,946 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 22:28:36,950 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:28:36,950 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 22:28:36,950 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:28:36,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 22:28:37,353 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 22:28:37,354 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 22:28:37,354 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-12 22:28:37,355 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-12 22:28:37,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-12 22:28:37,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-01-12 22:28:37,355 INFO L87 Difference]: Start difference. First operand 28097 states and 88459 transitions. Second operand 6 states. [2019-01-12 22:28:38,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 22:28:38,627 INFO L93 Difference]: Finished difference Result 58735 states and 182823 transitions. [2019-01-12 22:28:38,628 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-12 22:28:38,628 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 62 [2019-01-12 22:28:38,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 22:28:38,736 INFO L225 Difference]: With dead ends: 58735 [2019-01-12 22:28:38,737 INFO L226 Difference]: Without dead ends: 58664 [2019-01-12 22:28:38,737 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-01-12 22:28:38,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58664 states. [2019-01-12 22:28:39,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58664 to 36269. [2019-01-12 22:28:39,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36269 states. [2019-01-12 22:28:39,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36269 states to 36269 states and 111482 transitions. [2019-01-12 22:28:39,499 INFO L78 Accepts]: Start accepts. Automaton has 36269 states and 111482 transitions. Word has length 62 [2019-01-12 22:28:39,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 22:28:39,500 INFO L480 AbstractCegarLoop]: Abstraction has 36269 states and 111482 transitions. [2019-01-12 22:28:39,500 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-12 22:28:39,500 INFO L276 IsEmpty]: Start isEmpty. Operand 36269 states and 111482 transitions. [2019-01-12 22:28:39,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-01-12 22:28:39,514 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 22:28:39,515 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 22:28:39,515 INFO L423 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 22:28:39,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 22:28:39,515 INFO L82 PathProgramCache]: Analyzing trace with hash -941424289, now seen corresponding path program 1 times [2019-01-12 22:28:39,515 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 22:28:39,515 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 22:28:39,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:28:39,519 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 22:28:39,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:28:39,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 22:28:39,601 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 22:28:39,602 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 22:28:39,602 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 22:28:39,602 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 22:28:39,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 22:28:39,603 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 22:28:39,604 INFO L87 Difference]: Start difference. First operand 36269 states and 111482 transitions. Second operand 3 states. [2019-01-12 22:28:39,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 22:28:39,831 INFO L93 Difference]: Finished difference Result 44982 states and 136819 transitions. [2019-01-12 22:28:39,833 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 22:28:39,833 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 68 [2019-01-12 22:28:39,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 22:28:39,911 INFO L225 Difference]: With dead ends: 44982 [2019-01-12 22:28:39,911 INFO L226 Difference]: Without dead ends: 44982 [2019-01-12 22:28:39,911 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 22:28:40,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44982 states. [2019-01-12 22:28:40,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44982 to 36865. [2019-01-12 22:28:40,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36865 states. [2019-01-12 22:28:40,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36865 states to 36865 states and 111150 transitions. [2019-01-12 22:28:40,499 INFO L78 Accepts]: Start accepts. Automaton has 36865 states and 111150 transitions. Word has length 68 [2019-01-12 22:28:40,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 22:28:40,499 INFO L480 AbstractCegarLoop]: Abstraction has 36865 states and 111150 transitions. [2019-01-12 22:28:40,499 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 22:28:40,499 INFO L276 IsEmpty]: Start isEmpty. Operand 36865 states and 111150 transitions. [2019-01-12 22:28:40,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-01-12 22:28:40,515 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 22:28:40,515 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 22:28:40,515 INFO L423 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 22:28:40,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 22:28:40,516 INFO L82 PathProgramCache]: Analyzing trace with hash 53745586, now seen corresponding path program 1 times [2019-01-12 22:28:40,516 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 22:28:40,516 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 22:28:40,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:28:40,518 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 22:28:40,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:28:40,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 22:28:40,849 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 22:28:40,849 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 22:28:40,849 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-12 22:28:40,849 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 22:28:40,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 22:28:40,850 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-12 22:28:40,850 INFO L87 Difference]: Start difference. First operand 36865 states and 111150 transitions. Second operand 5 states. [2019-01-12 22:28:41,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 22:28:41,828 INFO L93 Difference]: Finished difference Result 41458 states and 124779 transitions. [2019-01-12 22:28:41,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-12 22:28:41,829 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 74 [2019-01-12 22:28:41,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 22:28:41,893 INFO L225 Difference]: With dead ends: 41458 [2019-01-12 22:28:41,893 INFO L226 Difference]: Without dead ends: 41458 [2019-01-12 22:28:41,893 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-01-12 22:28:41,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41458 states. [2019-01-12 22:28:42,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41458 to 37226. [2019-01-12 22:28:42,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37226 states. [2019-01-12 22:28:42,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37226 states to 37226 states and 112139 transitions. [2019-01-12 22:28:42,697 INFO L78 Accepts]: Start accepts. Automaton has 37226 states and 112139 transitions. Word has length 74 [2019-01-12 22:28:42,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 22:28:42,698 INFO L480 AbstractCegarLoop]: Abstraction has 37226 states and 112139 transitions. [2019-01-12 22:28:42,698 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 22:28:42,698 INFO L276 IsEmpty]: Start isEmpty. Operand 37226 states and 112139 transitions. [2019-01-12 22:28:42,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-01-12 22:28:42,714 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 22:28:42,714 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] [2019-01-12 22:28:42,714 INFO L423 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 22:28:42,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 22:28:42,714 INFO L82 PathProgramCache]: Analyzing trace with hash 1796555921, now seen corresponding path program 1 times [2019-01-12 22:28:42,715 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 22:28:42,715 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 22:28:42,718 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:28:42,719 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 22:28:42,719 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:28:42,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 22:28:42,900 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 22:28:42,900 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 22:28:42,900 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-12 22:28:42,901 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-12 22:28:42,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-12 22:28:42,901 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-01-12 22:28:42,901 INFO L87 Difference]: Start difference. First operand 37226 states and 112139 transitions. Second operand 7 states. [2019-01-12 22:28:44,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 22:28:44,059 INFO L93 Difference]: Finished difference Result 44484 states and 134041 transitions. [2019-01-12 22:28:44,060 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-01-12 22:28:44,060 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 74 [2019-01-12 22:28:44,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 22:28:44,129 INFO L225 Difference]: With dead ends: 44484 [2019-01-12 22:28:44,129 INFO L226 Difference]: Without dead ends: 44397 [2019-01-12 22:28:44,129 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2019-01-12 22:28:44,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44397 states. [2019-01-12 22:28:44,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44397 to 33386. [2019-01-12 22:28:44,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33386 states. [2019-01-12 22:28:44,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33386 states to 33386 states and 101987 transitions. [2019-01-12 22:28:44,650 INFO L78 Accepts]: Start accepts. Automaton has 33386 states and 101987 transitions. Word has length 74 [2019-01-12 22:28:44,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 22:28:44,650 INFO L480 AbstractCegarLoop]: Abstraction has 33386 states and 101987 transitions. [2019-01-12 22:28:44,650 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-12 22:28:44,651 INFO L276 IsEmpty]: Start isEmpty. Operand 33386 states and 101987 transitions. [2019-01-12 22:28:44,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-01-12 22:28:44,666 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 22:28:44,666 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] [2019-01-12 22:28:44,667 INFO L423 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 22:28:44,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 22:28:44,667 INFO L82 PathProgramCache]: Analyzing trace with hash -744614695, now seen corresponding path program 1 times [2019-01-12 22:28:44,667 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 22:28:44,667 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 22:28:44,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:28:44,669 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 22:28:44,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:28:44,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 22:28:44,794 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 22:28:44,794 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 22:28:44,794 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 22:28:44,794 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 22:28:44,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 22:28:44,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-12 22:28:44,795 INFO L87 Difference]: Start difference. First operand 33386 states and 101987 transitions. Second operand 4 states. [2019-01-12 22:28:45,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 22:28:45,714 INFO L93 Difference]: Finished difference Result 46919 states and 139168 transitions. [2019-01-12 22:28:45,715 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-12 22:28:45,715 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 76 [2019-01-12 22:28:45,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 22:28:45,785 INFO L225 Difference]: With dead ends: 46919 [2019-01-12 22:28:45,785 INFO L226 Difference]: Without dead ends: 46919 [2019-01-12 22:28:45,785 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-12 22:28:45,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46919 states. [2019-01-12 22:28:46,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46919 to 41583. [2019-01-12 22:28:46,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41583 states. [2019-01-12 22:28:46,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41583 states to 41583 states and 124562 transitions. [2019-01-12 22:28:46,394 INFO L78 Accepts]: Start accepts. Automaton has 41583 states and 124562 transitions. Word has length 76 [2019-01-12 22:28:46,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 22:28:46,394 INFO L480 AbstractCegarLoop]: Abstraction has 41583 states and 124562 transitions. [2019-01-12 22:28:46,395 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 22:28:46,395 INFO L276 IsEmpty]: Start isEmpty. Operand 41583 states and 124562 transitions. [2019-01-12 22:28:46,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-01-12 22:28:46,416 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 22:28:46,416 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] [2019-01-12 22:28:46,417 INFO L423 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 22:28:46,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 22:28:46,417 INFO L82 PathProgramCache]: Analyzing trace with hash 608695002, now seen corresponding path program 1 times [2019-01-12 22:28:46,417 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 22:28:46,417 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 22:28:46,420 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:28:46,420 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 22:28:46,420 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:28:46,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 22:28:46,609 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 22:28:46,609 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 22:28:46,609 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-12 22:28:46,609 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 22:28:46,611 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 22:28:46,611 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-01-12 22:28:46,611 INFO L87 Difference]: Start difference. First operand 41583 states and 124562 transitions. Second operand 5 states. [2019-01-12 22:28:46,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 22:28:46,737 INFO L93 Difference]: Finished difference Result 17411 states and 44125 transitions. [2019-01-12 22:28:46,738 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-12 22:28:46,738 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 76 [2019-01-12 22:28:46,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 22:28:46,759 INFO L225 Difference]: With dead ends: 17411 [2019-01-12 22:28:46,759 INFO L226 Difference]: Without dead ends: 15683 [2019-01-12 22:28:46,760 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-01-12 22:28:46,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15683 states. [2019-01-12 22:28:46,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15683 to 15383. [2019-01-12 22:28:46,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15383 states. [2019-01-12 22:28:46,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15383 states to 15383 states and 38391 transitions. [2019-01-12 22:28:46,939 INFO L78 Accepts]: Start accepts. Automaton has 15383 states and 38391 transitions. Word has length 76 [2019-01-12 22:28:46,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 22:28:46,939 INFO L480 AbstractCegarLoop]: Abstraction has 15383 states and 38391 transitions. [2019-01-12 22:28:46,939 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 22:28:46,939 INFO L276 IsEmpty]: Start isEmpty. Operand 15383 states and 38391 transitions. [2019-01-12 22:28:46,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-01-12 22:28:46,956 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 22:28:46,956 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] [2019-01-12 22:28:46,957 INFO L423 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 22:28:46,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 22:28:46,957 INFO L82 PathProgramCache]: Analyzing trace with hash 2118808404, now seen corresponding path program 1 times [2019-01-12 22:28:46,957 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 22:28:46,957 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 22:28:46,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:28:46,959 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 22:28:46,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:28:46,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 22:28:47,194 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 22:28:47,194 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 22:28:47,194 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 22:28:47,195 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 22:28:47,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 22:28:47,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-12 22:28:47,195 INFO L87 Difference]: Start difference. First operand 15383 states and 38391 transitions. Second operand 4 states. [2019-01-12 22:28:47,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 22:28:47,451 INFO L93 Difference]: Finished difference Result 17144 states and 41878 transitions. [2019-01-12 22:28:47,451 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 22:28:47,451 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 109 [2019-01-12 22:28:47,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 22:28:47,471 INFO L225 Difference]: With dead ends: 17144 [2019-01-12 22:28:47,471 INFO L226 Difference]: Without dead ends: 17124 [2019-01-12 22:28:47,472 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-12 22:28:47,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17124 states. [2019-01-12 22:28:47,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17124 to 16733. [2019-01-12 22:28:47,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16733 states. [2019-01-12 22:28:47,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16733 states to 16733 states and 40961 transitions. [2019-01-12 22:28:47,674 INFO L78 Accepts]: Start accepts. Automaton has 16733 states and 40961 transitions. Word has length 109 [2019-01-12 22:28:47,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 22:28:47,674 INFO L480 AbstractCegarLoop]: Abstraction has 16733 states and 40961 transitions. [2019-01-12 22:28:47,674 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 22:28:47,674 INFO L276 IsEmpty]: Start isEmpty. Operand 16733 states and 40961 transitions. [2019-01-12 22:28:47,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-01-12 22:28:47,695 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 22:28:47,696 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] [2019-01-12 22:28:47,696 INFO L423 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 22:28:47,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 22:28:47,696 INFO L82 PathProgramCache]: Analyzing trace with hash 632503910, now seen corresponding path program 1 times [2019-01-12 22:28:47,696 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 22:28:47,697 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 22:28:47,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:28:47,699 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 22:28:47,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:28:47,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 22:28:47,871 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 22:28:47,872 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 22:28:47,872 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-12 22:28:47,872 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 22:28:47,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 22:28:47,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-12 22:28:47,873 INFO L87 Difference]: Start difference. First operand 16733 states and 40961 transitions. Second operand 5 states. [2019-01-12 22:28:48,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 22:28:48,062 INFO L93 Difference]: Finished difference Result 20084 states and 48536 transitions. [2019-01-12 22:28:48,063 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-12 22:28:48,063 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 111 [2019-01-12 22:28:48,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 22:28:48,088 INFO L225 Difference]: With dead ends: 20084 [2019-01-12 22:28:48,088 INFO L226 Difference]: Without dead ends: 20084 [2019-01-12 22:28:48,089 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-01-12 22:28:48,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20084 states. [2019-01-12 22:28:48,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20084 to 15831. [2019-01-12 22:28:48,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15831 states. [2019-01-12 22:28:48,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15831 states to 15831 states and 38250 transitions. [2019-01-12 22:28:48,341 INFO L78 Accepts]: Start accepts. Automaton has 15831 states and 38250 transitions. Word has length 111 [2019-01-12 22:28:48,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 22:28:48,341 INFO L480 AbstractCegarLoop]: Abstraction has 15831 states and 38250 transitions. [2019-01-12 22:28:48,341 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 22:28:48,341 INFO L276 IsEmpty]: Start isEmpty. Operand 15831 states and 38250 transitions. [2019-01-12 22:28:48,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-01-12 22:28:48,368 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 22:28:48,368 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] [2019-01-12 22:28:48,369 INFO L423 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 22:28:48,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 22:28:48,369 INFO L82 PathProgramCache]: Analyzing trace with hash 962269671, now seen corresponding path program 1 times [2019-01-12 22:28:48,369 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 22:28:48,369 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 22:28:48,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:28:48,374 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 22:28:48,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:28:48,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 22:28:48,725 WARN L181 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2019-01-12 22:28:48,739 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 22:28:48,740 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 22:28:48,740 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-12 22:28:48,740 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 22:28:48,741 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 22:28:48,742 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-01-12 22:28:48,743 INFO L87 Difference]: Start difference. First operand 15831 states and 38250 transitions. Second operand 5 states. [2019-01-12 22:28:49,143 WARN L181 SmtUtils]: Spent 151.00 ms on a formula simplification that was a NOOP. DAG size: 20 [2019-01-12 22:28:50,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 22:28:50,116 INFO L93 Difference]: Finished difference Result 33686 states and 81122 transitions. [2019-01-12 22:28:50,117 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-12 22:28:50,117 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 111 [2019-01-12 22:28:50,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 22:28:50,157 INFO L225 Difference]: With dead ends: 33686 [2019-01-12 22:28:50,157 INFO L226 Difference]: Without dead ends: 33652 [2019-01-12 22:28:50,158 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-01-12 22:28:50,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33652 states. [2019-01-12 22:28:50,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33652 to 19730. [2019-01-12 22:28:50,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19730 states. [2019-01-12 22:28:50,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19730 states to 19730 states and 48110 transitions. [2019-01-12 22:28:50,494 INFO L78 Accepts]: Start accepts. Automaton has 19730 states and 48110 transitions. Word has length 111 [2019-01-12 22:28:50,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 22:28:50,495 INFO L480 AbstractCegarLoop]: Abstraction has 19730 states and 48110 transitions. [2019-01-12 22:28:50,495 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 22:28:50,495 INFO L276 IsEmpty]: Start isEmpty. Operand 19730 states and 48110 transitions. [2019-01-12 22:28:50,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-01-12 22:28:50,530 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 22:28:50,531 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] [2019-01-12 22:28:50,531 INFO L423 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 22:28:50,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 22:28:50,531 INFO L82 PathProgramCache]: Analyzing trace with hash -1047834170, now seen corresponding path program 1 times [2019-01-12 22:28:50,531 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 22:28:50,532 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 22:28:50,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:28:50,536 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 22:28:50,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:28:50,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 22:28:50,950 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 22:28:50,951 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 22:28:50,951 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 22:28:50,951 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 22:28:50,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 22:28:50,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-12 22:28:50,952 INFO L87 Difference]: Start difference. First operand 19730 states and 48110 transitions. Second operand 4 states. [2019-01-12 22:28:51,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 22:28:51,241 INFO L93 Difference]: Finished difference Result 21454 states and 51921 transitions. [2019-01-12 22:28:51,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 22:28:51,242 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 111 [2019-01-12 22:28:51,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 22:28:51,268 INFO L225 Difference]: With dead ends: 21454 [2019-01-12 22:28:51,269 INFO L226 Difference]: Without dead ends: 21434 [2019-01-12 22:28:51,269 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-12 22:28:51,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21434 states. [2019-01-12 22:28:51,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21434 to 20671. [2019-01-12 22:28:51,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20671 states. [2019-01-12 22:28:51,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20671 states to 20671 states and 50207 transitions. [2019-01-12 22:28:51,511 INFO L78 Accepts]: Start accepts. Automaton has 20671 states and 50207 transitions. Word has length 111 [2019-01-12 22:28:51,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 22:28:51,511 INFO L480 AbstractCegarLoop]: Abstraction has 20671 states and 50207 transitions. [2019-01-12 22:28:51,511 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 22:28:51,512 INFO L276 IsEmpty]: Start isEmpty. Operand 20671 states and 50207 transitions. [2019-01-12 22:28:51,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-01-12 22:28:51,534 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 22:28:51,534 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] [2019-01-12 22:28:51,534 INFO L423 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 22:28:51,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 22:28:51,535 INFO L82 PathProgramCache]: Analyzing trace with hash -354732473, now seen corresponding path program 1 times [2019-01-12 22:28:51,535 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 22:28:51,535 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 22:28:51,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:28:51,537 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 22:28:51,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:28:51,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 22:28:51,833 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 22:28:51,833 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 22:28:51,833 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-12 22:28:51,833 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-12 22:28:51,834 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-12 22:28:51,834 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-01-12 22:28:51,834 INFO L87 Difference]: Start difference. First operand 20671 states and 50207 transitions. Second operand 7 states. [2019-01-12 22:28:52,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 22:28:52,912 INFO L93 Difference]: Finished difference Result 30874 states and 73107 transitions. [2019-01-12 22:28:52,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-01-12 22:28:52,913 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 111 [2019-01-12 22:28:52,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 22:28:52,954 INFO L225 Difference]: With dead ends: 30874 [2019-01-12 22:28:52,954 INFO L226 Difference]: Without dead ends: 30874 [2019-01-12 22:28:52,955 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2019-01-12 22:28:53,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30874 states. [2019-01-12 22:28:53,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30874 to 29072. [2019-01-12 22:28:53,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29072 states. [2019-01-12 22:28:53,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29072 states to 29072 states and 68872 transitions. [2019-01-12 22:28:53,320 INFO L78 Accepts]: Start accepts. Automaton has 29072 states and 68872 transitions. Word has length 111 [2019-01-12 22:28:53,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 22:28:53,320 INFO L480 AbstractCegarLoop]: Abstraction has 29072 states and 68872 transitions. [2019-01-12 22:28:53,320 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-12 22:28:53,320 INFO L276 IsEmpty]: Start isEmpty. Operand 29072 states and 68872 transitions. [2019-01-12 22:28:53,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-01-12 22:28:53,350 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 22:28:53,350 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 22:28:53,350 INFO L423 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 22:28:53,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 22:28:53,351 INFO L82 PathProgramCache]: Analyzing trace with hash -403426232, now seen corresponding path program 1 times [2019-01-12 22:28:53,351 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 22:28:53,351 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 22:28:53,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:28:53,353 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 22:28:53,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:28:53,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 22:28:53,496 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 22:28:53,497 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 22:28:53,497 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 22:28:53,498 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 22:28:53,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 22:28:53,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 22:28:53,499 INFO L87 Difference]: Start difference. First operand 29072 states and 68872 transitions. Second operand 3 states. [2019-01-12 22:28:53,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 22:28:53,957 INFO L93 Difference]: Finished difference Result 36146 states and 84388 transitions. [2019-01-12 22:28:53,958 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 22:28:53,958 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 111 [2019-01-12 22:28:53,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 22:28:54,000 INFO L225 Difference]: With dead ends: 36146 [2019-01-12 22:28:54,000 INFO L226 Difference]: Without dead ends: 36146 [2019-01-12 22:28:54,001 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 22:28:54,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36146 states. [2019-01-12 22:28:54,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36146 to 29859. [2019-01-12 22:28:54,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29859 states. [2019-01-12 22:28:54,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29859 states to 29859 states and 70558 transitions. [2019-01-12 22:28:54,370 INFO L78 Accepts]: Start accepts. Automaton has 29859 states and 70558 transitions. Word has length 111 [2019-01-12 22:28:54,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 22:28:54,370 INFO L480 AbstractCegarLoop]: Abstraction has 29859 states and 70558 transitions. [2019-01-12 22:28:54,370 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 22:28:54,371 INFO L276 IsEmpty]: Start isEmpty. Operand 29859 states and 70558 transitions. [2019-01-12 22:28:54,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-01-12 22:28:54,400 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 22:28:54,400 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] [2019-01-12 22:28:54,400 INFO L423 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 22:28:54,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 22:28:54,400 INFO L82 PathProgramCache]: Analyzing trace with hash 1878465293, now seen corresponding path program 2 times [2019-01-12 22:28:54,401 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 22:28:54,401 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 22:28:54,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:28:54,403 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 22:28:54,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:28:54,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 22:28:54,719 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 22:28:54,719 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 22:28:54,719 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-12 22:28:54,721 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 22:28:54,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 22:28:54,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-12 22:28:54,722 INFO L87 Difference]: Start difference. First operand 29859 states and 70558 transitions. Second operand 5 states. [2019-01-12 22:28:55,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 22:28:55,300 INFO L93 Difference]: Finished difference Result 32398 states and 76046 transitions. [2019-01-12 22:28:55,302 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-12 22:28:55,302 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 111 [2019-01-12 22:28:55,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 22:28:55,340 INFO L225 Difference]: With dead ends: 32398 [2019-01-12 22:28:55,340 INFO L226 Difference]: Without dead ends: 32398 [2019-01-12 22:28:55,340 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-01-12 22:28:55,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32398 states. [2019-01-12 22:28:55,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32398 to 30305. [2019-01-12 22:28:55,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30305 states. [2019-01-12 22:28:55,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30305 states to 30305 states and 71546 transitions. [2019-01-12 22:28:55,722 INFO L78 Accepts]: Start accepts. Automaton has 30305 states and 71546 transitions. Word has length 111 [2019-01-12 22:28:55,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 22:28:55,723 INFO L480 AbstractCegarLoop]: Abstraction has 30305 states and 71546 transitions. [2019-01-12 22:28:55,723 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 22:28:55,723 INFO L276 IsEmpty]: Start isEmpty. Operand 30305 states and 71546 transitions. [2019-01-12 22:28:55,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-01-12 22:28:55,754 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 22:28:55,754 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] [2019-01-12 22:28:55,755 INFO L423 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 22:28:55,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 22:28:55,755 INFO L82 PathProgramCache]: Analyzing trace with hash 1387343367, now seen corresponding path program 1 times [2019-01-12 22:28:55,755 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 22:28:55,755 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 22:28:55,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:28:55,759 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 22:28:55,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:28:55,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 22:28:56,042 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 22:28:56,042 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 22:28:56,042 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-12 22:28:56,043 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-12 22:28:56,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-12 22:28:56,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-01-12 22:28:56,043 INFO L87 Difference]: Start difference. First operand 30305 states and 71546 transitions. Second operand 7 states. [2019-01-12 22:28:57,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 22:28:57,325 INFO L93 Difference]: Finished difference Result 42474 states and 99114 transitions. [2019-01-12 22:28:57,326 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-12 22:28:57,326 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 113 [2019-01-12 22:28:57,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 22:28:57,385 INFO L225 Difference]: With dead ends: 42474 [2019-01-12 22:28:57,385 INFO L226 Difference]: Without dead ends: 42474 [2019-01-12 22:28:57,386 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-01-12 22:28:57,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42474 states. [2019-01-12 22:28:57,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42474 to 33262. [2019-01-12 22:28:57,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33262 states. [2019-01-12 22:28:57,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33262 states to 33262 states and 78288 transitions. [2019-01-12 22:28:57,859 INFO L78 Accepts]: Start accepts. Automaton has 33262 states and 78288 transitions. Word has length 113 [2019-01-12 22:28:57,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 22:28:57,860 INFO L480 AbstractCegarLoop]: Abstraction has 33262 states and 78288 transitions. [2019-01-12 22:28:57,860 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-12 22:28:57,860 INFO L276 IsEmpty]: Start isEmpty. Operand 33262 states and 78288 transitions. [2019-01-12 22:28:57,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-01-12 22:28:57,896 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 22:28:57,896 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 22:28:57,896 INFO L423 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 22:28:57,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 22:28:57,897 INFO L82 PathProgramCache]: Analyzing trace with hash -622760474, now seen corresponding path program 1 times [2019-01-12 22:28:57,897 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 22:28:57,897 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 22:28:57,898 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:28:57,899 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 22:28:57,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:28:57,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 22:28:58,438 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 22:28:58,438 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 22:28:58,438 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-12 22:28:58,438 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-12 22:28:58,439 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-12 22:28:58,439 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-01-12 22:28:58,439 INFO L87 Difference]: Start difference. First operand 33262 states and 78288 transitions. Second operand 7 states. [2019-01-12 22:28:59,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 22:28:59,238 INFO L93 Difference]: Finished difference Result 40440 states and 95301 transitions. [2019-01-12 22:28:59,239 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-12 22:28:59,239 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 113 [2019-01-12 22:28:59,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 22:28:59,289 INFO L225 Difference]: With dead ends: 40440 [2019-01-12 22:28:59,289 INFO L226 Difference]: Without dead ends: 40440 [2019-01-12 22:28:59,290 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2019-01-12 22:28:59,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40440 states. [2019-01-12 22:28:59,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40440 to 35293. [2019-01-12 22:28:59,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35293 states. [2019-01-12 22:28:59,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35293 states to 35293 states and 83404 transitions. [2019-01-12 22:28:59,742 INFO L78 Accepts]: Start accepts. Automaton has 35293 states and 83404 transitions. Word has length 113 [2019-01-12 22:28:59,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 22:28:59,742 INFO L480 AbstractCegarLoop]: Abstraction has 35293 states and 83404 transitions. [2019-01-12 22:28:59,743 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-12 22:28:59,743 INFO L276 IsEmpty]: Start isEmpty. Operand 35293 states and 83404 transitions. [2019-01-12 22:28:59,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-01-12 22:28:59,778 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 22:28:59,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] [2019-01-12 22:28:59,779 INFO L423 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 22:28:59,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 22:28:59,779 INFO L82 PathProgramCache]: Analyzing trace with hash -641656679, now seen corresponding path program 1 times [2019-01-12 22:28:59,779 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 22:28:59,779 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 22:28:59,781 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:28:59,781 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 22:28:59,781 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:28:59,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 22:29:00,437 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 22:29:00,438 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 22:29:00,438 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-01-12 22:29:00,438 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-12 22:29:00,438 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-12 22:29:00,439 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-01-12 22:29:00,439 INFO L87 Difference]: Start difference. First operand 35293 states and 83404 transitions. Second operand 8 states. [2019-01-12 22:29:01,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 22:29:01,816 INFO L93 Difference]: Finished difference Result 50039 states and 117872 transitions. [2019-01-12 22:29:01,817 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-01-12 22:29:01,817 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 113 [2019-01-12 22:29:01,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 22:29:01,876 INFO L225 Difference]: With dead ends: 50039 [2019-01-12 22:29:01,876 INFO L226 Difference]: Without dead ends: 50039 [2019-01-12 22:29:01,877 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=70, Invalid=236, Unknown=0, NotChecked=0, Total=306 [2019-01-12 22:29:01,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50039 states. [2019-01-12 22:29:02,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50039 to 39056. [2019-01-12 22:29:02,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39056 states. [2019-01-12 22:29:02,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39056 states to 39056 states and 92223 transitions. [2019-01-12 22:29:02,380 INFO L78 Accepts]: Start accepts. Automaton has 39056 states and 92223 transitions. Word has length 113 [2019-01-12 22:29:02,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 22:29:02,381 INFO L480 AbstractCegarLoop]: Abstraction has 39056 states and 92223 transitions. [2019-01-12 22:29:02,381 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-12 22:29:02,381 INFO L276 IsEmpty]: Start isEmpty. Operand 39056 states and 92223 transitions. [2019-01-12 22:29:02,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-01-12 22:29:02,420 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 22:29:02,420 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] [2019-01-12 22:29:02,420 INFO L423 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 22:29:02,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 22:29:02,420 INFO L82 PathProgramCache]: Analyzing trace with hash 245847002, now seen corresponding path program 1 times [2019-01-12 22:29:02,421 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 22:29:02,421 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 22:29:02,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:29:02,422 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 22:29:02,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:29:02,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 22:29:02,533 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 22:29:02,534 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 22:29:02,534 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 22:29:02,534 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 22:29:02,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 22:29:02,535 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 22:29:02,535 INFO L87 Difference]: Start difference. First operand 39056 states and 92223 transitions. Second operand 3 states. [2019-01-12 22:29:02,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 22:29:02,647 INFO L93 Difference]: Finished difference Result 38928 states and 91791 transitions. [2019-01-12 22:29:02,648 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 22:29:02,648 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 113 [2019-01-12 22:29:02,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 22:29:02,694 INFO L225 Difference]: With dead ends: 38928 [2019-01-12 22:29:02,694 INFO L226 Difference]: Without dead ends: 38928 [2019-01-12 22:29:02,695 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 22:29:02,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38928 states. [2019-01-12 22:29:03,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38928 to 34917. [2019-01-12 22:29:03,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34917 states. [2019-01-12 22:29:03,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34917 states to 34917 states and 82496 transitions. [2019-01-12 22:29:03,161 INFO L78 Accepts]: Start accepts. Automaton has 34917 states and 82496 transitions. Word has length 113 [2019-01-12 22:29:03,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 22:29:03,161 INFO L480 AbstractCegarLoop]: Abstraction has 34917 states and 82496 transitions. [2019-01-12 22:29:03,161 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 22:29:03,161 INFO L276 IsEmpty]: Start isEmpty. Operand 34917 states and 82496 transitions. [2019-01-12 22:29:03,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-01-12 22:29:03,208 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 22:29:03,208 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] [2019-01-12 22:29:03,208 INFO L423 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 22:29:03,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 22:29:03,209 INFO L82 PathProgramCache]: Analyzing trace with hash -792724927, now seen corresponding path program 1 times [2019-01-12 22:29:03,209 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 22:29:03,209 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 22:29:03,211 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:29:03,211 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 22:29:03,211 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:29:03,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 22:29:03,737 WARN L181 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 14 [2019-01-12 22:29:03,908 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 22:29:03,909 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 22:29:03,909 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-01-12 22:29:03,909 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-12 22:29:03,909 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-12 22:29:03,910 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2019-01-12 22:29:03,910 INFO L87 Difference]: Start difference. First operand 34917 states and 82496 transitions. Second operand 10 states. [2019-01-12 22:29:05,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 22:29:05,055 INFO L93 Difference]: Finished difference Result 46523 states and 107398 transitions. [2019-01-12 22:29:05,056 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-01-12 22:29:05,056 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 113 [2019-01-12 22:29:05,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 22:29:05,111 INFO L225 Difference]: With dead ends: 46523 [2019-01-12 22:29:05,111 INFO L226 Difference]: Without dead ends: 46523 [2019-01-12 22:29:05,111 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=80, Invalid=130, Unknown=0, NotChecked=0, Total=210 [2019-01-12 22:29:05,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46523 states. [2019-01-12 22:29:05,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46523 to 39172. [2019-01-12 22:29:05,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39172 states. [2019-01-12 22:29:05,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39172 states to 39172 states and 91336 transitions. [2019-01-12 22:29:05,610 INFO L78 Accepts]: Start accepts. Automaton has 39172 states and 91336 transitions. Word has length 113 [2019-01-12 22:29:05,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 22:29:05,610 INFO L480 AbstractCegarLoop]: Abstraction has 39172 states and 91336 transitions. [2019-01-12 22:29:05,610 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-12 22:29:05,610 INFO L276 IsEmpty]: Start isEmpty. Operand 39172 states and 91336 transitions. [2019-01-12 22:29:05,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-01-12 22:29:05,650 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 22:29:05,650 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] [2019-01-12 22:29:05,650 INFO L423 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 22:29:05,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 22:29:05,651 INFO L82 PathProgramCache]: Analyzing trace with hash 932755970, now seen corresponding path program 1 times [2019-01-12 22:29:05,651 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 22:29:05,651 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 22:29:05,653 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:29:05,653 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 22:29:05,653 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:29:05,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 22:29:06,211 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 22:29:06,212 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 22:29:06,212 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-01-12 22:29:06,212 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-12 22:29:06,212 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-12 22:29:06,212 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-01-12 22:29:06,213 INFO L87 Difference]: Start difference. First operand 39172 states and 91336 transitions. Second operand 8 states. [2019-01-12 22:29:07,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 22:29:07,307 INFO L93 Difference]: Finished difference Result 49867 states and 114910 transitions. [2019-01-12 22:29:07,308 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-01-12 22:29:07,308 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 113 [2019-01-12 22:29:07,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 22:29:07,369 INFO L225 Difference]: With dead ends: 49867 [2019-01-12 22:29:07,369 INFO L226 Difference]: Without dead ends: 49849 [2019-01-12 22:29:07,370 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=82, Invalid=190, Unknown=0, NotChecked=0, Total=272 [2019-01-12 22:29:07,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49849 states. [2019-01-12 22:29:07,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49849 to 42579. [2019-01-12 22:29:07,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42579 states. [2019-01-12 22:29:07,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42579 states to 42579 states and 99182 transitions. [2019-01-12 22:29:07,924 INFO L78 Accepts]: Start accepts. Automaton has 42579 states and 99182 transitions. Word has length 113 [2019-01-12 22:29:07,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 22:29:07,925 INFO L480 AbstractCegarLoop]: Abstraction has 42579 states and 99182 transitions. [2019-01-12 22:29:07,925 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-12 22:29:07,925 INFO L276 IsEmpty]: Start isEmpty. Operand 42579 states and 99182 transitions. [2019-01-12 22:29:07,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-01-12 22:29:07,969 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 22:29:07,969 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] [2019-01-12 22:29:07,969 INFO L423 AbstractCegarLoop]: === Iteration 26 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 22:29:07,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 22:29:07,970 INFO L82 PathProgramCache]: Analyzing trace with hash 1144106883, now seen corresponding path program 1 times [2019-01-12 22:29:07,970 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 22:29:07,970 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 22:29:07,972 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:29:07,972 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 22:29:07,972 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:29:07,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 22:29:08,149 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 22:29:08,149 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 22:29:08,150 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-12 22:29:08,150 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-12 22:29:08,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-12 22:29:08,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-01-12 22:29:08,151 INFO L87 Difference]: Start difference. First operand 42579 states and 99182 transitions. Second operand 6 states. [2019-01-12 22:29:08,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 22:29:08,824 INFO L93 Difference]: Finished difference Result 47238 states and 109374 transitions. [2019-01-12 22:29:08,825 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-12 22:29:08,825 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 113 [2019-01-12 22:29:08,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 22:29:08,884 INFO L225 Difference]: With dead ends: 47238 [2019-01-12 22:29:08,885 INFO L226 Difference]: Without dead ends: 47238 [2019-01-12 22:29:08,885 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2019-01-12 22:29:08,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47238 states. [2019-01-12 22:29:09,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47238 to 42880. [2019-01-12 22:29:09,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42880 states. [2019-01-12 22:29:09,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42880 states to 42880 states and 99841 transitions. [2019-01-12 22:29:09,524 INFO L78 Accepts]: Start accepts. Automaton has 42880 states and 99841 transitions. Word has length 113 [2019-01-12 22:29:09,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 22:29:09,525 INFO L480 AbstractCegarLoop]: Abstraction has 42880 states and 99841 transitions. [2019-01-12 22:29:09,525 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-12 22:29:09,525 INFO L276 IsEmpty]: Start isEmpty. Operand 42880 states and 99841 transitions. [2019-01-12 22:29:09,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-01-12 22:29:09,579 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 22:29:09,579 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, 1, 1] [2019-01-12 22:29:09,579 INFO L423 AbstractCegarLoop]: === Iteration 27 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 22:29:09,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 22:29:09,580 INFO L82 PathProgramCache]: Analyzing trace with hash -779122372, now seen corresponding path program 1 times [2019-01-12 22:29:09,580 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 22:29:09,580 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 22:29:09,582 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:29:09,583 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 22:29:09,583 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:29:09,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 22:29:09,975 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 22:29:09,976 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 22:29:09,976 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-12 22:29:09,976 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-12 22:29:09,977 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-12 22:29:09,977 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-01-12 22:29:09,977 INFO L87 Difference]: Start difference. First operand 42880 states and 99841 transitions. Second operand 7 states. [2019-01-12 22:29:10,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 22:29:10,680 INFO L93 Difference]: Finished difference Result 50318 states and 115200 transitions. [2019-01-12 22:29:10,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-12 22:29:10,681 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 115 [2019-01-12 22:29:10,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 22:29:10,742 INFO L225 Difference]: With dead ends: 50318 [2019-01-12 22:29:10,742 INFO L226 Difference]: Without dead ends: 50274 [2019-01-12 22:29:10,743 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-01-12 22:29:10,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50274 states. [2019-01-12 22:29:11,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50274 to 43020. [2019-01-12 22:29:11,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43020 states. [2019-01-12 22:29:11,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43020 states to 43020 states and 99154 transitions. [2019-01-12 22:29:11,804 INFO L78 Accepts]: Start accepts. Automaton has 43020 states and 99154 transitions. Word has length 115 [2019-01-12 22:29:11,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 22:29:11,804 INFO L480 AbstractCegarLoop]: Abstraction has 43020 states and 99154 transitions. [2019-01-12 22:29:11,804 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-12 22:29:11,804 INFO L276 IsEmpty]: Start isEmpty. Operand 43020 states and 99154 transitions. [2019-01-12 22:29:11,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-01-12 22:29:11,845 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 22:29:11,845 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 22:29:11,846 INFO L423 AbstractCegarLoop]: === Iteration 28 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 22:29:11,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 22:29:11,846 INFO L82 PathProgramCache]: Analyzing trace with hash -86020675, now seen corresponding path program 1 times [2019-01-12 22:29:11,846 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 22:29:11,846 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 22:29:11,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:29:11,848 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 22:29:11,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:29:11,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 22:29:12,451 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 22:29:12,451 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 22:29:12,451 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-12 22:29:12,452 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-12 22:29:12,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-12 22:29:12,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-01-12 22:29:12,452 INFO L87 Difference]: Start difference. First operand 43020 states and 99154 transitions. Second operand 7 states. [2019-01-12 22:29:13,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 22:29:13,299 INFO L93 Difference]: Finished difference Result 49235 states and 112198 transitions. [2019-01-12 22:29:13,300 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-12 22:29:13,300 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 115 [2019-01-12 22:29:13,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 22:29:13,356 INFO L225 Difference]: With dead ends: 49235 [2019-01-12 22:29:13,356 INFO L226 Difference]: Without dead ends: 49235 [2019-01-12 22:29:13,356 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2019-01-12 22:29:13,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49235 states. [2019-01-12 22:29:13,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49235 to 44767. [2019-01-12 22:29:13,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44767 states. [2019-01-12 22:29:13,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44767 states to 44767 states and 102439 transitions. [2019-01-12 22:29:13,922 INFO L78 Accepts]: Start accepts. Automaton has 44767 states and 102439 transitions. Word has length 115 [2019-01-12 22:29:13,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 22:29:13,922 INFO L480 AbstractCegarLoop]: Abstraction has 44767 states and 102439 transitions. [2019-01-12 22:29:13,922 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-12 22:29:13,922 INFO L276 IsEmpty]: Start isEmpty. Operand 44767 states and 102439 transitions. [2019-01-12 22:29:13,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-01-12 22:29:13,965 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 22:29:13,965 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 22:29:13,965 INFO L423 AbstractCegarLoop]: === Iteration 29 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 22:29:13,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 22:29:13,966 INFO L82 PathProgramCache]: Analyzing trace with hash 2131737278, now seen corresponding path program 1 times [2019-01-12 22:29:13,966 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 22:29:13,966 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 22:29:13,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:29:13,967 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 22:29:13,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:29:13,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 22:29:14,164 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 22:29:14,165 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 22:29:14,165 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-12 22:29:14,165 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-12 22:29:14,165 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-12 22:29:14,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-01-12 22:29:14,166 INFO L87 Difference]: Start difference. First operand 44767 states and 102439 transitions. Second operand 7 states. [2019-01-12 22:29:14,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 22:29:14,605 INFO L93 Difference]: Finished difference Result 45875 states and 104800 transitions. [2019-01-12 22:29:14,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-12 22:29:14,606 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 115 [2019-01-12 22:29:14,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 22:29:14,658 INFO L225 Difference]: With dead ends: 45875 [2019-01-12 22:29:14,658 INFO L226 Difference]: Without dead ends: 45875 [2019-01-12 22:29:14,658 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2019-01-12 22:29:14,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45875 states. [2019-01-12 22:29:15,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45875 to 45215. [2019-01-12 22:29:15,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45215 states. [2019-01-12 22:29:15,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45215 states to 45215 states and 103458 transitions. [2019-01-12 22:29:15,184 INFO L78 Accepts]: Start accepts. Automaton has 45215 states and 103458 transitions. Word has length 115 [2019-01-12 22:29:15,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 22:29:15,184 INFO L480 AbstractCegarLoop]: Abstraction has 45215 states and 103458 transitions. [2019-01-12 22:29:15,184 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-12 22:29:15,184 INFO L276 IsEmpty]: Start isEmpty. Operand 45215 states and 103458 transitions. [2019-01-12 22:29:15,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-01-12 22:29:15,230 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 22:29:15,230 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, 1, 1] [2019-01-12 22:29:15,230 INFO L423 AbstractCegarLoop]: === Iteration 30 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 22:29:15,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 22:29:15,231 INFO L82 PathProgramCache]: Analyzing trace with hash -1275726337, now seen corresponding path program 1 times [2019-01-12 22:29:15,231 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 22:29:15,231 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 22:29:15,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:29:15,232 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 22:29:15,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:29:15,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 22:29:15,326 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 22:29:15,326 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 22:29:15,326 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 22:29:15,327 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 22:29:15,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 22:29:15,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 22:29:15,327 INFO L87 Difference]: Start difference. First operand 45215 states and 103458 transitions. Second operand 3 states. [2019-01-12 22:29:15,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 22:29:15,582 INFO L93 Difference]: Finished difference Result 55478 states and 125652 transitions. [2019-01-12 22:29:15,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 22:29:15,583 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 115 [2019-01-12 22:29:15,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 22:29:15,650 INFO L225 Difference]: With dead ends: 55478 [2019-01-12 22:29:15,650 INFO L226 Difference]: Without dead ends: 55478 [2019-01-12 22:29:15,651 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 22:29:15,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55478 states. [2019-01-12 22:29:16,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55478 to 55017. [2019-01-12 22:29:16,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55017 states. [2019-01-12 22:29:16,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55017 states to 55017 states and 124645 transitions. [2019-01-12 22:29:16,284 INFO L78 Accepts]: Start accepts. Automaton has 55017 states and 124645 transitions. Word has length 115 [2019-01-12 22:29:16,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 22:29:16,284 INFO L480 AbstractCegarLoop]: Abstraction has 55017 states and 124645 transitions. [2019-01-12 22:29:16,284 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 22:29:16,284 INFO L276 IsEmpty]: Start isEmpty. Operand 55017 states and 124645 transitions. [2019-01-12 22:29:16,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-01-12 22:29:16,340 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 22:29:16,340 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, 1, 1] [2019-01-12 22:29:16,340 INFO L423 AbstractCegarLoop]: === Iteration 31 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 22:29:16,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 22:29:16,341 INFO L82 PathProgramCache]: Analyzing trace with hash 449754560, now seen corresponding path program 1 times [2019-01-12 22:29:16,341 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 22:29:16,341 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 22:29:16,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:29:16,342 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 22:29:16,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:29:16,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 22:29:16,972 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 22:29:16,972 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 22:29:16,972 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-01-12 22:29:16,973 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-01-12 22:29:16,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-01-12 22:29:16,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2019-01-12 22:29:16,973 INFO L87 Difference]: Start difference. First operand 55017 states and 124645 transitions. Second operand 13 states. [2019-01-12 22:29:17,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 22:29:17,870 INFO L93 Difference]: Finished difference Result 89825 states and 203771 transitions. [2019-01-12 22:29:17,871 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-01-12 22:29:17,871 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 115 [2019-01-12 22:29:17,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 22:29:17,964 INFO L225 Difference]: With dead ends: 89825 [2019-01-12 22:29:17,965 INFO L226 Difference]: Without dead ends: 75580 [2019-01-12 22:29:17,965 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=117, Invalid=435, Unknown=0, NotChecked=0, Total=552 [2019-01-12 22:29:18,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75580 states. [2019-01-12 22:29:18,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75580 to 62714. [2019-01-12 22:29:18,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62714 states. [2019-01-12 22:29:18,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62714 states to 62714 states and 141291 transitions. [2019-01-12 22:29:18,737 INFO L78 Accepts]: Start accepts. Automaton has 62714 states and 141291 transitions. Word has length 115 [2019-01-12 22:29:18,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 22:29:18,737 INFO L480 AbstractCegarLoop]: Abstraction has 62714 states and 141291 transitions. [2019-01-12 22:29:18,737 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-01-12 22:29:18,737 INFO L276 IsEmpty]: Start isEmpty. Operand 62714 states and 141291 transitions. [2019-01-12 22:29:18,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-01-12 22:29:18,803 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 22:29:18,803 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, 1, 1] [2019-01-12 22:29:18,803 INFO L423 AbstractCegarLoop]: === Iteration 32 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 22:29:18,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 22:29:18,804 INFO L82 PathProgramCache]: Analyzing trace with hash 1473651648, now seen corresponding path program 2 times [2019-01-12 22:29:18,804 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 22:29:18,804 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 22:29:18,805 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:29:18,805 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 22:29:18,806 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:29:18,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 22:29:19,987 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 22:29:19,987 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 22:29:19,987 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-01-12 22:29:19,988 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-01-12 22:29:19,988 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-01-12 22:29:19,988 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=156, Unknown=0, NotChecked=0, Total=182 [2019-01-12 22:29:19,988 INFO L87 Difference]: Start difference. First operand 62714 states and 141291 transitions. Second operand 14 states. [2019-01-12 22:29:21,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 22:29:21,416 INFO L93 Difference]: Finished difference Result 128067 states and 289576 transitions. [2019-01-12 22:29:21,417 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-01-12 22:29:21,417 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 115 [2019-01-12 22:29:21,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 22:29:21,541 INFO L225 Difference]: With dead ends: 128067 [2019-01-12 22:29:21,541 INFO L226 Difference]: Without dead ends: 98792 [2019-01-12 22:29:21,542 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 224 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=246, Invalid=1086, Unknown=0, NotChecked=0, Total=1332 [2019-01-12 22:29:21,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98792 states. [2019-01-12 22:29:22,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98792 to 72195. [2019-01-12 22:29:22,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72195 states. [2019-01-12 22:29:22,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72195 states to 72195 states and 160411 transitions. [2019-01-12 22:29:22,948 INFO L78 Accepts]: Start accepts. Automaton has 72195 states and 160411 transitions. Word has length 115 [2019-01-12 22:29:22,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 22:29:22,948 INFO L480 AbstractCegarLoop]: Abstraction has 72195 states and 160411 transitions. [2019-01-12 22:29:22,948 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-01-12 22:29:22,949 INFO L276 IsEmpty]: Start isEmpty. Operand 72195 states and 160411 transitions. [2019-01-12 22:29:23,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-01-12 22:29:23,030 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 22:29:23,030 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, 1, 1] [2019-01-12 22:29:23,031 INFO L423 AbstractCegarLoop]: === Iteration 33 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 22:29:23,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 22:29:23,031 INFO L82 PathProgramCache]: Analyzing trace with hash -1838854620, now seen corresponding path program 3 times [2019-01-12 22:29:23,031 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 22:29:23,031 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 22:29:23,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:29:23,033 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 22:29:23,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:29:23,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 22:29:23,405 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 22:29:23,405 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 22:29:23,405 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-01-12 22:29:23,405 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-01-12 22:29:23,406 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-01-12 22:29:23,407 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=182, Unknown=0, NotChecked=0, Total=210 [2019-01-12 22:29:23,408 INFO L87 Difference]: Start difference. First operand 72195 states and 160411 transitions. Second operand 15 states. [2019-01-12 22:29:24,006 WARN L181 SmtUtils]: Spent 363.00 ms on a formula simplification. DAG size of input: 16 DAG size of output: 13 [2019-01-12 22:29:25,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 22:29:25,812 INFO L93 Difference]: Finished difference Result 98700 states and 220784 transitions. [2019-01-12 22:29:25,812 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-01-12 22:29:25,812 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 115 [2019-01-12 22:29:25,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 22:29:25,955 INFO L225 Difference]: With dead ends: 98700 [2019-01-12 22:29:25,955 INFO L226 Difference]: Without dead ends: 86446 [2019-01-12 22:29:25,957 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 299 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=316, Invalid=1406, Unknown=0, NotChecked=0, Total=1722 [2019-01-12 22:29:26,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86446 states. [2019-01-12 22:29:26,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86446 to 72504. [2019-01-12 22:29:26,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72504 states. [2019-01-12 22:29:27,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72504 states to 72504 states and 161300 transitions. [2019-01-12 22:29:27,001 INFO L78 Accepts]: Start accepts. Automaton has 72504 states and 161300 transitions. Word has length 115 [2019-01-12 22:29:27,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 22:29:27,002 INFO L480 AbstractCegarLoop]: Abstraction has 72504 states and 161300 transitions. [2019-01-12 22:29:27,002 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-01-12 22:29:27,002 INFO L276 IsEmpty]: Start isEmpty. Operand 72504 states and 161300 transitions. [2019-01-12 22:29:27,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-01-12 22:29:27,089 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 22:29:27,089 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, 1, 1] [2019-01-12 22:29:27,089 INFO L423 AbstractCegarLoop]: === Iteration 34 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 22:29:27,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 22:29:27,089 INFO L82 PathProgramCache]: Analyzing trace with hash 250044971, now seen corresponding path program 1 times [2019-01-12 22:29:27,090 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 22:29:27,090 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 22:29:27,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:29:27,091 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 22:29:27,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:29:27,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 22:29:27,421 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 22:29:27,421 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 22:29:27,421 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-01-12 22:29:27,421 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-01-12 22:29:27,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-01-12 22:29:27,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=210, Unknown=0, NotChecked=0, Total=240 [2019-01-12 22:29:27,422 INFO L87 Difference]: Start difference. First operand 72504 states and 161300 transitions. Second operand 16 states. [2019-01-12 22:29:29,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 22:29:29,303 INFO L93 Difference]: Finished difference Result 101999 states and 228536 transitions. [2019-01-12 22:29:29,305 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-01-12 22:29:29,305 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 115 [2019-01-12 22:29:29,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 22:29:29,407 INFO L225 Difference]: With dead ends: 101999 [2019-01-12 22:29:29,407 INFO L226 Difference]: Without dead ends: 86882 [2019-01-12 22:29:29,408 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 266 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=281, Invalid=1359, Unknown=0, NotChecked=0, Total=1640 [2019-01-12 22:29:29,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86882 states. [2019-01-12 22:29:30,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86882 to 69711. [2019-01-12 22:29:30,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69711 states. [2019-01-12 22:29:30,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69711 states to 69711 states and 155330 transitions. [2019-01-12 22:29:30,340 INFO L78 Accepts]: Start accepts. Automaton has 69711 states and 155330 transitions. Word has length 115 [2019-01-12 22:29:30,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 22:29:30,340 INFO L480 AbstractCegarLoop]: Abstraction has 69711 states and 155330 transitions. [2019-01-12 22:29:30,340 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-01-12 22:29:30,340 INFO L276 IsEmpty]: Start isEmpty. Operand 69711 states and 155330 transitions. [2019-01-12 22:29:30,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-01-12 22:29:30,414 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 22:29:30,415 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, 1, 1] [2019-01-12 22:29:30,415 INFO L423 AbstractCegarLoop]: === Iteration 35 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 22:29:30,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 22:29:30,415 INFO L82 PathProgramCache]: Analyzing trace with hash -1473068119, now seen corresponding path program 1 times [2019-01-12 22:29:30,415 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 22:29:30,415 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 22:29:30,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:29:30,417 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 22:29:30,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:29:30,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 22:29:30,882 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 22:29:30,883 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 22:29:30,884 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-12 22:29:30,884 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-12 22:29:30,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-12 22:29:30,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-01-12 22:29:30,887 INFO L87 Difference]: Start difference. First operand 69711 states and 155330 transitions. Second operand 6 states. [2019-01-12 22:29:31,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 22:29:31,295 INFO L93 Difference]: Finished difference Result 75126 states and 167236 transitions. [2019-01-12 22:29:31,297 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-12 22:29:31,297 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 115 [2019-01-12 22:29:31,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 22:29:31,392 INFO L225 Difference]: With dead ends: 75126 [2019-01-12 22:29:31,392 INFO L226 Difference]: Without dead ends: 74995 [2019-01-12 22:29:31,393 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-01-12 22:29:31,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74995 states. [2019-01-12 22:29:32,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74995 to 67686. [2019-01-12 22:29:32,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67686 states. [2019-01-12 22:29:32,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67686 states to 67686 states and 150958 transitions. [2019-01-12 22:29:32,227 INFO L78 Accepts]: Start accepts. Automaton has 67686 states and 150958 transitions. Word has length 115 [2019-01-12 22:29:32,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 22:29:32,227 INFO L480 AbstractCegarLoop]: Abstraction has 67686 states and 150958 transitions. [2019-01-12 22:29:32,228 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-12 22:29:32,228 INFO L276 IsEmpty]: Start isEmpty. Operand 67686 states and 150958 transitions. [2019-01-12 22:29:32,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-01-12 22:29:32,722 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 22:29:32,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, 1, 1, 1, 1, 1, 1] [2019-01-12 22:29:32,722 INFO L423 AbstractCegarLoop]: === Iteration 36 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 22:29:32,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 22:29:32,723 INFO L82 PathProgramCache]: Analyzing trace with hash -924509768, now seen corresponding path program 1 times [2019-01-12 22:29:32,723 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 22:29:32,723 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 22:29:32,724 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:29:32,724 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 22:29:32,725 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:29:32,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 22:29:32,925 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 22:29:32,926 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 22:29:32,926 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-01-12 22:29:32,926 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-12 22:29:32,926 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-12 22:29:32,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-01-12 22:29:32,927 INFO L87 Difference]: Start difference. First operand 67686 states and 150958 transitions. Second operand 10 states. [2019-01-12 22:29:33,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 22:29:33,802 INFO L93 Difference]: Finished difference Result 76687 states and 170862 transitions. [2019-01-12 22:29:33,803 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-12 22:29:33,803 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 115 [2019-01-12 22:29:33,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 22:29:33,813 INFO L225 Difference]: With dead ends: 76687 [2019-01-12 22:29:33,813 INFO L226 Difference]: Without dead ends: 7319 [2019-01-12 22:29:33,813 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2019-01-12 22:29:33,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7319 states. [2019-01-12 22:29:33,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7319 to 7319. [2019-01-12 22:29:33,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7319 states. [2019-01-12 22:29:33,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7319 states to 7319 states and 17095 transitions. [2019-01-12 22:29:33,884 INFO L78 Accepts]: Start accepts. Automaton has 7319 states and 17095 transitions. Word has length 115 [2019-01-12 22:29:33,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 22:29:33,884 INFO L480 AbstractCegarLoop]: Abstraction has 7319 states and 17095 transitions. [2019-01-12 22:29:33,884 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-12 22:29:33,884 INFO L276 IsEmpty]: Start isEmpty. Operand 7319 states and 17095 transitions. [2019-01-12 22:29:33,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-01-12 22:29:33,892 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 22:29:33,892 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, 1, 1] [2019-01-12 22:29:33,892 INFO L423 AbstractCegarLoop]: === Iteration 37 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 22:29:33,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 22:29:33,893 INFO L82 PathProgramCache]: Analyzing trace with hash 681840101, now seen corresponding path program 2 times [2019-01-12 22:29:33,893 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 22:29:33,893 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 22:29:33,894 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:29:33,894 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 22:29:33,894 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:29:33,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-12 22:29:33,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-12 22:29:34,001 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-01-12 22:29:34,221 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2019-01-12 22:29:34,225 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.01 10:29:34 BasicIcfg [2019-01-12 22:29:34,227 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-12 22:29:34,228 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-12 22:29:34,228 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-12 22:29:34,228 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-12 22:29:34,228 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 10:28:05" (3/4) ... [2019-01-12 22:29:34,233 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2019-01-12 22:29:34,448 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-12 22:29:34,451 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-12 22:29:34,453 INFO L168 Benchmark]: Toolchain (without parser) took 91768.86 ms. Allocated memory was 1.0 GB in the beginning and 4.7 GB in the end (delta: 3.6 GB). Free memory was 944.7 MB in the beginning and 3.3 GB in the end (delta: -2.3 GB). Peak memory consumption was 1.3 GB. Max. memory is 11.5 GB. [2019-01-12 22:29:34,453 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-12 22:29:34,454 INFO L168 Benchmark]: CACSL2BoogieTranslator took 843.04 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 149.9 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -178.6 MB). Peak memory consumption was 26.2 MB. Max. memory is 11.5 GB. [2019-01-12 22:29:34,456 INFO L168 Benchmark]: Boogie Procedure Inliner took 87.50 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-12 22:29:34,456 INFO L168 Benchmark]: Boogie Preprocessor took 49.25 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-12 22:29:34,456 INFO L168 Benchmark]: RCFGBuilder took 1432.17 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: 57.4 MB). Peak memory consumption was 57.4 MB. Max. memory is 11.5 GB. [2019-01-12 22:29:34,457 INFO L168 Benchmark]: TraceAbstraction took 89125.97 ms. Allocated memory was 1.2 GB in the beginning and 4.7 GB in the end (delta: 3.5 GB). Free memory was 1.1 GB in the beginning and 3.3 GB in the end (delta: -2.3 GB). Peak memory consumption was 1.2 GB. Max. memory is 11.5 GB. [2019-01-12 22:29:34,459 INFO L168 Benchmark]: Witness Printer took 224.10 ms. Allocated memory is still 4.7 GB. Free memory was 3.3 GB in the beginning and 3.3 GB in the end (delta: 70.9 MB). Peak memory consumption was 70.9 MB. Max. memory is 11.5 GB. [2019-01-12 22:29:34,463 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.17 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 843.04 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 149.9 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -178.6 MB). Peak memory consumption was 26.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 87.50 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. * Boogie Preprocessor took 49.25 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 1432.17 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: 57.4 MB). Peak memory consumption was 57.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 89125.97 ms. Allocated memory was 1.2 GB in the beginning and 4.7 GB in the end (delta: 3.5 GB). Free memory was 1.1 GB in the beginning and 3.3 GB in the end (delta: -2.3 GB). Peak memory consumption was 1.2 GB. Max. memory is 11.5 GB. * Witness Printer took 224.10 ms. Allocated memory is still 4.7 GB. Free memory was 3.3 GB in the beginning and 3.3 GB in the end (delta: 70.9 MB). Peak memory consumption was 70.9 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L672] -1 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L674] -1 int __unbuffered_p0_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0] [L676] -1 int __unbuffered_p0_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0] [L678] -1 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0] [L680] -1 int __unbuffered_p1_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0] [L681] -1 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0] [L682] -1 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L684] -1 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L686] -1 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L687] -1 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L688] -1 int y$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L689] -1 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0] [L690] -1 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0] [L691] -1 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0] [L692] -1 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0] [L693] -1 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0] [L694] -1 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0] [L695] -1 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0] [L696] -1 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}] [L697] -1 int y$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0] [L698] -1 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0] [L699] -1 int y$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0] [L700] -1 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L701] -1 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L702] -1 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L794] -1 pthread_t t12; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L795] FCALL, FORK -1 pthread_create(&t12, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, 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] [L796] -1 pthread_t t13; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L797] FCALL, FORK -1 pthread_create(&t13, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L706] 0 y$w_buff1 = y$w_buff0 [L707] 0 y$w_buff0 = 1 [L708] 0 y$w_buff1_used = y$w_buff0_used [L709] 0 y$w_buff0_used = (_Bool)1 [L5] COND FALSE 0 !(!expression) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L711] 0 y$r_buff1_thd0 = y$r_buff0_thd0 [L712] 0 y$r_buff1_thd1 = y$r_buff0_thd1 [L713] 0 y$r_buff1_thd2 = y$r_buff0_thd2 [L714] 0 y$r_buff0_thd1 = (_Bool)1 [L717] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L718] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L719] 0 y$flush_delayed = weak$$choice2 [L720] 0 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=3, x=0, y=0, y$flush_delayed=3, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L721] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=3, x=0, y=0, y$flush_delayed=3, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L721] EXPR 0 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=3, x=0, y=0, y$flush_delayed=3, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L721] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=3, x=0, y=0, y$flush_delayed=3, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L721] 0 y = !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L722] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=3, x=0, y=1, y$flush_delayed=3, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L722] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L723] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=3, x=0, y=1, y$flush_delayed=3, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L723] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L724] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=3, x=0, y=1, y$flush_delayed=3, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L724] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L725] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=3, x=0, y=1, y$flush_delayed=3, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L725] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L726] EXPR 0 weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=3, x=0, y=1, y$flush_delayed=3, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L726] 0 y$r_buff0_thd1 = weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) [L727] EXPR 0 weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=3, x=0, y=1, y$flush_delayed=3, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L727] 0 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L728] 0 __unbuffered_p0_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=3, x=0, y=1, y$flush_delayed=3, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L729] EXPR 0 y$flush_delayed ? y$mem_tmp : y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=3, x=0, y=1, y$flush_delayed=3, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L729] 0 y = y$flush_delayed ? y$mem_tmp : y [L730] 0 y$flush_delayed = (_Bool)0 [L733] 0 __unbuffered_p0_EBX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=3, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L750] 1 x = 1 [L753] 1 __unbuffered_p1_EAX = x [L756] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L757] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L758] 1 y$flush_delayed = weak$$choice2 [L759] 1 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=3, x=1, y=0, y$flush_delayed=3, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L760] EXPR 1 !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 [!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)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=3, x=1, y=0, y$flush_delayed=3, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L760] 1 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) [L761] EXPR 1 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=3, 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))=1, x=1, y=0, y$flush_delayed=3, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L761] 1 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)) [L736] EXPR 0 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_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=3, x=1, y=0, y$flush_delayed=3, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L762] EXPR 1 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=3, 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))=0, x=1, y=0, y$flush_delayed=3, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L762] 1 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)) [L763] EXPR 1 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=3, 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))=1, x=1, y=0, y$flush_delayed=3, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L763] 1 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)) [L764] EXPR 1 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=3, 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))=0, x=1, y=0, y$flush_delayed=3, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L764] 1 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)) [L765] EXPR 1 weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=3, 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))=0, x=1, y=0, y$flush_delayed=3, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L765] 1 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)) [L766] EXPR 1 weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=3, 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))=0, x=1, y=0, y$flush_delayed=3, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L766] 1 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)) [L767] 1 __unbuffered_p1_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=3, x=1, y=0, y$flush_delayed=3, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L768] EXPR 1 y$flush_delayed ? y$mem_tmp : y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=3, x=1, y=0, y$flush_delayed=3, y$flush_delayed ? y$mem_tmp : y=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L768] 1 y = y$flush_delayed ? y$mem_tmp : y [L769] 1 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=3, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L772] EXPR 1 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=3, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L772] EXPR 1 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=3, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y=0] [L772] EXPR 1 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=3, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y)=0, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y=0] [L772] 1 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L773] EXPR 1 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=3, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L773] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L774] EXPR 1 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_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=3, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used=0, y$w_buff1=0, y$w_buff1_used=0] [L774] 1 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 [L736] 0 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L737] EXPR 0 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=3, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L737] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L738] EXPR 0 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=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=3, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L738] 0 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 [L739] EXPR 0 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=3, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L739] 0 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L740] EXPR 0 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=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=3, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L740] 0 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 [L743] 0 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=3, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L775] EXPR 1 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=3, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2=0, y$w_buff1=0, y$w_buff1_used=0] [L775] 1 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L776] EXPR 1 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=3, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2=0, y$w_buff1=0, y$w_buff1_used=0] [L776] 1 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L779] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=3, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L799] -1 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=3, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L803] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=3, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L803] EXPR -1 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=3, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L803] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=3, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L803] -1 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L804] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=3, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L804] -1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L805] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=3, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L805] -1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L806] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=3, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L806] -1 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L807] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=3, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L807] -1 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L810] -1 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=3, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L5] COND TRUE -1 !expression VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=3, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L5] -1 __VERIFIER_error() VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=3, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 308 locations, 3 error locations. UNSAFE Result, 88.9s OverallTime, 37 OverallIterations, 1 TraceHistogramMax, 36.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 15907 SDtfs, 21253 SDslu, 57093 SDs, 0 SdLazy, 12038 SolverSat, 840 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 18.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 491 GetRequests, 105 SyntacticMatches, 34 SemanticMatches, 352 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1048 ImplicationChecksByTransitivity, 14.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=104360occurred in iteration=0, 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: 26.6s AutomataMinimizationTime, 36 MinimizatonAttempts, 304754 StatesRemovedByMinimization, 34 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 11.0s InterpolantComputationTime, 3557 NumberOfCodeBlocks, 3557 NumberOfCodeBlocksAsserted, 37 NumberOfCheckSat, 3406 ConstructedInterpolants, 0 QuantifiedInterpolants, 923472 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 36 InterpolantComputations, 36 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...