./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/pthread-wmm/mix009_power.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/mix009_power.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 3d287fce75dc873494b995778754ff1185af89eb ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.24-0ed9222-m [2019-01-12 23:17:45,647 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-12 23:17:45,649 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-12 23:17:45,661 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-12 23:17:45,662 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-12 23:17:45,663 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-12 23:17:45,665 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-12 23:17:45,667 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-12 23:17:45,669 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-12 23:17:45,670 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-12 23:17:45,671 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-12 23:17:45,671 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-12 23:17:45,672 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-12 23:17:45,674 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-12 23:17:45,675 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-12 23:17:45,676 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-12 23:17:45,677 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-12 23:17:45,679 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-12 23:17:45,681 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-12 23:17:45,683 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-12 23:17:45,685 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-12 23:17:45,686 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-12 23:17:45,689 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-12 23:17:45,689 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-12 23:17:45,689 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-12 23:17:45,691 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-12 23:17:45,692 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-12 23:17:45,693 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-12 23:17:45,694 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-12 23:17:45,695 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-12 23:17:45,695 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-12 23:17:45,697 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-12 23:17:45,697 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-12 23:17:45,697 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-12 23:17:45,698 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-12 23:17:45,699 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-12 23:17:45,700 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-01-12 23:17:45,726 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-12 23:17:45,727 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-12 23:17:45,729 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-12 23:17:45,730 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-12 23:17:45,731 INFO L133 SettingsManager]: * Use SBE=true [2019-01-12 23:17:45,731 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-12 23:17:45,731 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-12 23:17:45,731 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-12 23:17:45,731 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-12 23:17:45,731 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-12 23:17:45,733 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-12 23:17:45,733 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-12 23:17:45,733 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-12 23:17:45,733 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-12 23:17:45,733 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-12 23:17:45,734 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-12 23:17:45,734 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-12 23:17:45,734 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-12 23:17:45,734 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-12 23:17:45,734 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-12 23:17:45,734 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-12 23:17:45,735 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-12 23:17:45,737 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-12 23:17:45,738 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-12 23:17:45,738 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-12 23:17:45,738 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-12 23:17:45,738 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-12 23:17:45,738 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-12 23:17:45,738 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 -> 3d287fce75dc873494b995778754ff1185af89eb [2019-01-12 23:17:45,789 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-12 23:17:45,802 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-12 23:17:45,806 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-12 23:17:45,808 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-12 23:17:45,808 INFO L276 PluginConnector]: CDTParser initialized [2019-01-12 23:17:45,809 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/pthread-wmm/mix009_power.oepc_false-unreach-call.i [2019-01-12 23:17:45,866 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1aa3e8c2a/faa33ee0eaf04cc59b9c26cb053c65b6/FLAG2c3196f29 [2019-01-12 23:17:46,385 INFO L307 CDTParser]: Found 1 translation units. [2019-01-12 23:17:46,386 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/pthread-wmm/mix009_power.oepc_false-unreach-call.i [2019-01-12 23:17:46,407 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1aa3e8c2a/faa33ee0eaf04cc59b9c26cb053c65b6/FLAG2c3196f29 [2019-01-12 23:17:46,695 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1aa3e8c2a/faa33ee0eaf04cc59b9c26cb053c65b6 [2019-01-12 23:17:46,700 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-12 23:17:46,701 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-12 23:17:46,703 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-12 23:17:46,703 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-12 23:17:46,710 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-12 23:17:46,711 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 11:17:46" (1/1) ... [2019-01-12 23:17:46,714 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@38d059b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 11:17:46, skipping insertion in model container [2019-01-12 23:17:46,715 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 11:17:46" (1/1) ... [2019-01-12 23:17:46,723 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-12 23:17:46,792 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-12 23:17:47,314 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 23:17:47,328 INFO L191 MainTranslator]: Completed pre-run [2019-01-12 23:17:47,469 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 23:17:47,560 INFO L195 MainTranslator]: Completed translation [2019-01-12 23:17:47,562 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 11:17:47 WrapperNode [2019-01-12 23:17:47,562 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-12 23:17:47,564 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-12 23:17:47,564 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-12 23:17:47,564 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-12 23:17:47,576 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 11:17:47" (1/1) ... [2019-01-12 23:17:47,611 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 11:17:47" (1/1) ... [2019-01-12 23:17:47,674 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-12 23:17:47,674 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-12 23:17:47,674 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-12 23:17:47,674 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-12 23:17:47,689 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 11:17:47" (1/1) ... [2019-01-12 23:17:47,689 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 11:17:47" (1/1) ... [2019-01-12 23:17:47,702 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 11:17:47" (1/1) ... [2019-01-12 23:17:47,705 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 11:17:47" (1/1) ... [2019-01-12 23:17:47,730 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 11:17:47" (1/1) ... [2019-01-12 23:17:47,739 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 11:17:47" (1/1) ... [2019-01-12 23:17:47,747 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 11:17:47" (1/1) ... [2019-01-12 23:17:47,759 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-12 23:17:47,760 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-12 23:17:47,761 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-12 23:17:47,761 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-12 23:17:47,764 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 11:17:47" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-12 23:17:47,840 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-12 23:17:47,840 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-01-12 23:17:47,840 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-12 23:17:47,841 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-12 23:17:47,841 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-01-12 23:17:47,841 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-01-12 23:17:47,841 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-01-12 23:17:47,841 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-01-12 23:17:47,845 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-01-12 23:17:47,845 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-12 23:17:47,845 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-12 23:17:47,848 WARN L204 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-01-12 23:17:48,912 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-12 23:17:48,912 INFO L286 CfgBuilder]: Removed 8 assue(true) statements. [2019-01-12 23:17:48,914 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 11:17:48 BoogieIcfgContainer [2019-01-12 23:17:48,915 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-12 23:17:48,916 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-12 23:17:48,916 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-12 23:17:48,919 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-12 23:17:48,920 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.01 11:17:46" (1/3) ... [2019-01-12 23:17:48,921 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57216fa6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 11:17:48, skipping insertion in model container [2019-01-12 23:17:48,921 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 11:17:47" (2/3) ... [2019-01-12 23:17:48,921 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57216fa6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 11:17:48, skipping insertion in model container [2019-01-12 23:17:48,921 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 11:17:48" (3/3) ... [2019-01-12 23:17:48,925 INFO L112 eAbstractionObserver]: Analyzing ICFG mix009_power.oepc_false-unreach-call.i [2019-01-12 23:17:48,971 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:17:48,972 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:17:48,972 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:17:48,972 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:17:48,973 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:17:48,973 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:17:48,973 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:17:48,973 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:17:48,974 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:17:48,974 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:17:48,974 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:17:48,975 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:17:48,975 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:17:48,975 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:17:48,975 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:17:48,975 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:17:48,976 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:17:48,976 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:17:48,976 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:17:48,976 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:17:48,976 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:17:48,977 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:17:48,977 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:17:48,977 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:17:48,977 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:17:48,978 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:17:48,978 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:17:48,978 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:17:48,978 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:17:48,978 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:17:48,979 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:17:48,979 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:17:48,979 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:17:48,979 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:17:48,979 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:17:48,980 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:17:48,980 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:17:48,980 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:17:48,983 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet11.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:17:48,983 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet11.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:17:48,984 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:17:48,984 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:17:48,984 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:17:48,984 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:17:48,984 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet11.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:17:48,984 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:17:48,985 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:17:48,985 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet11.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:17:48,985 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:17:48,985 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:17:48,988 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:17:48,988 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:17:48,989 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:17:48,989 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:17:48,990 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:17:48,990 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:17:48,990 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:17:48,990 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:17:48,991 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:17:48,991 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:17:48,991 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:17:48,991 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:17:48,991 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:17:48,992 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:17:48,992 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:17:48,992 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:17:48,992 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:17:48,994 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:17:48,994 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:17:48,994 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:17:48,994 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:17:48,995 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:17:48,995 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:17:48,996 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:17:48,996 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:17:48,996 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:17:48,996 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:17:48,997 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:17:48,997 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:17:48,997 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:17:48,997 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:17:48,997 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:17:48,998 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:17:49,000 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:17:49,000 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:17:49,000 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:17:49,001 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:17:49,001 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:17:49,001 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:17:49,001 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:17:49,002 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:17:49,002 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:17:49,002 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:17:49,002 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:17:49,002 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:17:49,003 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:17:49,005 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:17:49,006 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:17:49,006 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:17:49,007 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:17:49,007 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:17:49,007 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:17:49,007 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:17:49,008 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:17:49,008 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:17:49,009 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:17:49,012 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:17:49,014 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:17:49,014 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:17:49,014 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:17:49,015 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:17:49,016 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:17:49,016 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:17:49,017 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:17:49,018 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:17:49,019 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:17:49,019 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:17:49,019 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:17:49,019 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:17:49,020 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:17:49,020 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:17:49,020 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:17:49,020 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:17:49,020 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:17:49,021 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:17:49,021 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:17:49,021 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:17:49,021 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:17:49,021 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:17:49,025 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:17:49,025 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:17:49,026 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:17:49,026 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:17:49,026 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:17:49,027 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:17:49,027 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:17:49,027 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:17:49,027 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:17:49,027 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:17:49,028 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:17:49,029 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:17:49,030 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:17:49,030 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:17:49,032 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:17:49,032 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:17:49,032 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:17:49,032 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:17:49,033 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:17:49,034 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:17:49,034 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:17:49,034 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:17:49,034 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:17:49,034 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:17:49,035 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:17:49,035 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:17:49,035 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:17:49,035 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:17:49,035 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:17:49,036 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet39.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:17:49,038 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet39.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:17:49,038 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:17:49,038 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:17:49,038 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet39.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:17:49,039 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet39.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:17:49,075 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-01-12 23:17:49,075 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-12 23:17:49,086 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2019-01-12 23:17:49,111 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2019-01-12 23:17:49,144 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-12 23:17:49,145 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-12 23:17:49,145 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-12 23:17:49,145 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-12 23:17:49,145 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-12 23:17:49,145 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-12 23:17:49,147 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-12 23:17:49,147 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-12 23:17:49,147 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-12 23:17:49,160 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 145places, 183 transitions [2019-01-12 23:17:51,699 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 34809 states. [2019-01-12 23:17:51,701 INFO L276 IsEmpty]: Start isEmpty. Operand 34809 states. [2019-01-12 23:17:51,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-01-12 23:17:51,710 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 23:17:51,711 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] [2019-01-12 23:17:51,713 INFO L423 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 23:17:51,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 23:17:51,718 INFO L82 PathProgramCache]: Analyzing trace with hash 787354290, now seen corresponding path program 1 times [2019-01-12 23:17:51,720 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 23:17:51,721 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 23:17:51,779 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:17:51,779 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 23:17:51,779 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:17:51,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 23:17:52,016 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 23:17:52,020 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 23:17:52,021 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 23:17:52,027 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 23:17:52,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 23:17:52,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-12 23:17:52,048 INFO L87 Difference]: Start difference. First operand 34809 states. Second operand 4 states. [2019-01-12 23:17:53,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 23:17:53,590 INFO L93 Difference]: Finished difference Result 60793 states and 234496 transitions. [2019-01-12 23:17:53,592 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 23:17:53,593 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 36 [2019-01-12 23:17:53,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 23:17:53,996 INFO L225 Difference]: With dead ends: 60793 [2019-01-12 23:17:53,996 INFO L226 Difference]: Without dead ends: 44273 [2019-01-12 23:17:53,998 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-12 23:17:54,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44273 states. [2019-01-12 23:17:55,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44273 to 27341. [2019-01-12 23:17:55,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27341 states. [2019-01-12 23:17:55,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27341 states to 27341 states and 105502 transitions. [2019-01-12 23:17:55,748 INFO L78 Accepts]: Start accepts. Automaton has 27341 states and 105502 transitions. Word has length 36 [2019-01-12 23:17:55,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 23:17:55,750 INFO L480 AbstractCegarLoop]: Abstraction has 27341 states and 105502 transitions. [2019-01-12 23:17:55,750 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 23:17:55,750 INFO L276 IsEmpty]: Start isEmpty. Operand 27341 states and 105502 transitions. [2019-01-12 23:17:55,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-01-12 23:17:55,769 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 23:17:55,770 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 23:17:55,770 INFO L423 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 23:17:55,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 23:17:55,770 INFO L82 PathProgramCache]: Analyzing trace with hash 901056929, now seen corresponding path program 1 times [2019-01-12 23:17:55,773 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 23:17:55,773 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 23:17:55,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:17:55,782 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 23:17:55,782 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:17:55,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 23:17:55,946 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 23:17:55,946 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 23:17:55,946 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-12 23:17:55,949 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 23:17:55,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 23:17:55,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-12 23:17:55,950 INFO L87 Difference]: Start difference. First operand 27341 states and 105502 transitions. Second operand 5 states. [2019-01-12 23:17:58,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 23:17:58,871 INFO L93 Difference]: Finished difference Result 64007 states and 235337 transitions. [2019-01-12 23:17:58,872 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-12 23:17:58,872 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 48 [2019-01-12 23:17:58,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 23:17:59,982 INFO L225 Difference]: With dead ends: 64007 [2019-01-12 23:17:59,983 INFO L226 Difference]: Without dead ends: 63455 [2019-01-12 23:17:59,984 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-01-12 23:18:00,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63455 states. [2019-01-12 23:18:01,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63455 to 41423. [2019-01-12 23:18:01,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41423 states. [2019-01-12 23:18:01,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41423 states to 41423 states and 152332 transitions. [2019-01-12 23:18:01,335 INFO L78 Accepts]: Start accepts. Automaton has 41423 states and 152332 transitions. Word has length 48 [2019-01-12 23:18:01,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 23:18:01,336 INFO L480 AbstractCegarLoop]: Abstraction has 41423 states and 152332 transitions. [2019-01-12 23:18:01,336 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 23:18:01,337 INFO L276 IsEmpty]: Start isEmpty. Operand 41423 states and 152332 transitions. [2019-01-12 23:18:01,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-01-12 23:18:01,345 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 23:18:01,345 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 23:18:01,345 INFO L423 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 23:18:01,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 23:18:01,346 INFO L82 PathProgramCache]: Analyzing trace with hash 2027995578, now seen corresponding path program 1 times [2019-01-12 23:18:01,346 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 23:18:01,346 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 23:18:01,351 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:18:01,354 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 23:18:01,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:18:01,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 23:18:01,570 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 23:18:01,571 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 23:18:01,571 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-12 23:18:01,571 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-12 23:18:01,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-12 23:18:01,572 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-01-12 23:18:01,572 INFO L87 Difference]: Start difference. First operand 41423 states and 152332 transitions. Second operand 6 states. [2019-01-12 23:18:03,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 23:18:03,108 INFO L93 Difference]: Finished difference Result 52773 states and 191027 transitions. [2019-01-12 23:18:03,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-12 23:18:03,109 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 49 [2019-01-12 23:18:03,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 23:18:03,234 INFO L225 Difference]: With dead ends: 52773 [2019-01-12 23:18:03,235 INFO L226 Difference]: Without dead ends: 52261 [2019-01-12 23:18:03,235 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2019-01-12 23:18:03,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52261 states. [2019-01-12 23:18:04,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52261 to 45377. [2019-01-12 23:18:04,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45377 states. [2019-01-12 23:18:05,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45377 states to 45377 states and 166020 transitions. [2019-01-12 23:18:05,473 INFO L78 Accepts]: Start accepts. Automaton has 45377 states and 166020 transitions. Word has length 49 [2019-01-12 23:18:05,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 23:18:05,474 INFO L480 AbstractCegarLoop]: Abstraction has 45377 states and 166020 transitions. [2019-01-12 23:18:05,474 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-12 23:18:05,474 INFO L276 IsEmpty]: Start isEmpty. Operand 45377 states and 166020 transitions. [2019-01-12 23:18:05,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-01-12 23:18:05,485 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 23:18:05,485 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 23:18:05,485 INFO L423 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 23:18:05,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 23:18:05,485 INFO L82 PathProgramCache]: Analyzing trace with hash -39217920, now seen corresponding path program 1 times [2019-01-12 23:18:05,486 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 23:18:05,486 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 23:18:05,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:18:05,490 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 23:18:05,490 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:18:05,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 23:18:05,546 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 23:18:05,547 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 23:18:05,547 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 23:18:05,547 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 23:18:05,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 23:18:05,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 23:18:05,548 INFO L87 Difference]: Start difference. First operand 45377 states and 166020 transitions. Second operand 3 states. [2019-01-12 23:18:05,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 23:18:05,877 INFO L93 Difference]: Finished difference Result 65253 states and 235816 transitions. [2019-01-12 23:18:05,878 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 23:18:05,878 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2019-01-12 23:18:05,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 23:18:06,032 INFO L225 Difference]: With dead ends: 65253 [2019-01-12 23:18:06,032 INFO L226 Difference]: Without dead ends: 65253 [2019-01-12 23:18:06,032 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 23:18:06,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65253 states. [2019-01-12 23:18:07,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65253 to 50947. [2019-01-12 23:18:07,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50947 states. [2019-01-12 23:18:07,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50947 states to 50947 states and 184327 transitions. [2019-01-12 23:18:07,208 INFO L78 Accepts]: Start accepts. Automaton has 50947 states and 184327 transitions. Word has length 51 [2019-01-12 23:18:07,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 23:18:07,208 INFO L480 AbstractCegarLoop]: Abstraction has 50947 states and 184327 transitions. [2019-01-12 23:18:07,209 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 23:18:07,209 INFO L276 IsEmpty]: Start isEmpty. Operand 50947 states and 184327 transitions. [2019-01-12 23:18:07,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-01-12 23:18:07,228 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 23:18:07,228 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 23:18:07,228 INFO L423 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 23:18:07,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 23:18:07,229 INFO L82 PathProgramCache]: Analyzing trace with hash -1723497845, now seen corresponding path program 1 times [2019-01-12 23:18:07,229 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 23:18:07,229 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 23:18:07,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:18:07,233 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 23:18:07,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:18:07,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 23:18:07,584 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 23:18:07,585 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 23:18:07,585 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-12 23:18:07,585 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-12 23:18:07,585 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-12 23:18:07,585 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-01-12 23:18:07,587 INFO L87 Difference]: Start difference. First operand 50947 states and 184327 transitions. Second operand 7 states. [2019-01-12 23:18:12,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 23:18:12,059 INFO L93 Difference]: Finished difference Result 83876 states and 290140 transitions. [2019-01-12 23:18:12,060 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-12 23:18:12,060 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 55 [2019-01-12 23:18:12,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 23:18:12,255 INFO L225 Difference]: With dead ends: 83876 [2019-01-12 23:18:12,255 INFO L226 Difference]: Without dead ends: 83876 [2019-01-12 23:18:12,256 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-01-12 23:18:12,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83876 states. [2019-01-12 23:18:13,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83876 to 66523. [2019-01-12 23:18:13,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66523 states. [2019-01-12 23:18:13,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66523 states to 66523 states and 234927 transitions. [2019-01-12 23:18:13,694 INFO L78 Accepts]: Start accepts. Automaton has 66523 states and 234927 transitions. Word has length 55 [2019-01-12 23:18:13,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 23:18:13,695 INFO L480 AbstractCegarLoop]: Abstraction has 66523 states and 234927 transitions. [2019-01-12 23:18:13,695 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-12 23:18:13,695 INFO L276 IsEmpty]: Start isEmpty. Operand 66523 states and 234927 transitions. [2019-01-12 23:18:13,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-01-12 23:18:13,715 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 23:18:13,716 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 23:18:13,716 INFO L423 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 23:18:13,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 23:18:13,717 INFO L82 PathProgramCache]: Analyzing trace with hash -835994164, now seen corresponding path program 1 times [2019-01-12 23:18:13,717 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 23:18:13,717 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 23:18:13,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:18:13,721 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 23:18:13,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:18:13,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 23:18:13,886 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 23:18:13,886 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 23:18:13,886 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 23:18:13,887 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 23:18:13,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 23:18:13,887 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-12 23:18:13,887 INFO L87 Difference]: Start difference. First operand 66523 states and 234927 transitions. Second operand 4 states. [2019-01-12 23:18:14,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 23:18:14,803 INFO L93 Difference]: Finished difference Result 14673 states and 46636 transitions. [2019-01-12 23:18:14,803 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-12 23:18:14,803 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 55 [2019-01-12 23:18:14,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 23:18:14,827 INFO L225 Difference]: With dead ends: 14673 [2019-01-12 23:18:14,828 INFO L226 Difference]: Without dead ends: 13087 [2019-01-12 23:18:14,828 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-12 23:18:14,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13087 states. [2019-01-12 23:18:14,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13087 to 13038. [2019-01-12 23:18:14,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13038 states. [2019-01-12 23:18:15,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13038 states to 13038 states and 41162 transitions. [2019-01-12 23:18:15,009 INFO L78 Accepts]: Start accepts. Automaton has 13038 states and 41162 transitions. Word has length 55 [2019-01-12 23:18:15,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 23:18:15,010 INFO L480 AbstractCegarLoop]: Abstraction has 13038 states and 41162 transitions. [2019-01-12 23:18:15,011 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 23:18:15,011 INFO L276 IsEmpty]: Start isEmpty. Operand 13038 states and 41162 transitions. [2019-01-12 23:18:15,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-01-12 23:18:15,013 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 23:18:15,013 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 23:18:15,013 INFO L423 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 23:18:15,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 23:18:15,014 INFO L82 PathProgramCache]: Analyzing trace with hash -557670517, now seen corresponding path program 1 times [2019-01-12 23:18:15,014 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 23:18:15,014 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 23:18:15,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:18:15,016 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 23:18:15,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:18:15,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 23:18:15,154 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 23:18:15,155 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 23:18:15,155 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-12 23:18:15,155 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-12 23:18:15,155 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-12 23:18:15,155 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-01-12 23:18:15,156 INFO L87 Difference]: Start difference. First operand 13038 states and 41162 transitions. Second operand 7 states. [2019-01-12 23:18:15,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 23:18:15,790 INFO L93 Difference]: Finished difference Result 16342 states and 50892 transitions. [2019-01-12 23:18:15,791 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-12 23:18:15,791 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 55 [2019-01-12 23:18:15,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 23:18:15,817 INFO L225 Difference]: With dead ends: 16342 [2019-01-12 23:18:15,817 INFO L226 Difference]: Without dead ends: 16270 [2019-01-12 23:18:15,817 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2019-01-12 23:18:15,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16270 states. [2019-01-12 23:18:15,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16270 to 13596. [2019-01-12 23:18:15,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13596 states. [2019-01-12 23:18:16,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13596 states to 13596 states and 42815 transitions. [2019-01-12 23:18:16,022 INFO L78 Accepts]: Start accepts. Automaton has 13596 states and 42815 transitions. Word has length 55 [2019-01-12 23:18:16,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 23:18:16,022 INFO L480 AbstractCegarLoop]: Abstraction has 13596 states and 42815 transitions. [2019-01-12 23:18:16,022 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-12 23:18:16,022 INFO L276 IsEmpty]: Start isEmpty. Operand 13596 states and 42815 transitions. [2019-01-12 23:18:16,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-01-12 23:18:16,026 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 23:18:16,027 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 23:18:16,027 INFO L423 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 23:18:16,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 23:18:16,027 INFO L82 PathProgramCache]: Analyzing trace with hash -3940633, now seen corresponding path program 1 times [2019-01-12 23:18:16,027 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 23:18:16,028 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 23:18:16,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:18:16,030 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 23:18:16,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:18:16,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 23:18:16,234 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 23:18:16,234 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 23:18:16,234 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 23:18:16,235 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 23:18:16,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 23:18:16,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-12 23:18:16,235 INFO L87 Difference]: Start difference. First operand 13596 states and 42815 transitions. Second operand 4 states. [2019-01-12 23:18:16,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 23:18:16,483 INFO L93 Difference]: Finished difference Result 15779 states and 49765 transitions. [2019-01-12 23:18:16,484 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-12 23:18:16,484 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 63 [2019-01-12 23:18:16,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 23:18:16,510 INFO L225 Difference]: With dead ends: 15779 [2019-01-12 23:18:16,510 INFO L226 Difference]: Without dead ends: 15779 [2019-01-12 23:18:16,511 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-12 23:18:16,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15779 states. [2019-01-12 23:18:16,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15779 to 14376. [2019-01-12 23:18:16,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14376 states. [2019-01-12 23:18:16,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14376 states to 14376 states and 45279 transitions. [2019-01-12 23:18:16,720 INFO L78 Accepts]: Start accepts. Automaton has 14376 states and 45279 transitions. Word has length 63 [2019-01-12 23:18:16,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 23:18:16,721 INFO L480 AbstractCegarLoop]: Abstraction has 14376 states and 45279 transitions. [2019-01-12 23:18:16,721 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 23:18:16,721 INFO L276 IsEmpty]: Start isEmpty. Operand 14376 states and 45279 transitions. [2019-01-12 23:18:16,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-01-12 23:18:16,725 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 23:18:16,726 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 23:18:16,726 INFO L423 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 23:18:16,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 23:18:16,726 INFO L82 PathProgramCache]: Analyzing trace with hash 1738869702, now seen corresponding path program 1 times [2019-01-12 23:18:16,726 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 23:18:16,727 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 23:18:16,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:18:16,728 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 23:18:16,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:18:16,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 23:18:16,998 WARN L181 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2019-01-12 23:18:17,294 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 23:18:17,295 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 23:18:17,295 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-01-12 23:18:17,295 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-12 23:18:17,295 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-12 23:18:17,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-01-12 23:18:17,296 INFO L87 Difference]: Start difference. First operand 14376 states and 45279 transitions. Second operand 8 states. [2019-01-12 23:18:18,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 23:18:18,450 INFO L93 Difference]: Finished difference Result 19042 states and 58902 transitions. [2019-01-12 23:18:18,450 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-01-12 23:18:18,451 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 63 [2019-01-12 23:18:18,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 23:18:18,480 INFO L225 Difference]: With dead ends: 19042 [2019-01-12 23:18:18,481 INFO L226 Difference]: Without dead ends: 18971 [2019-01-12 23:18:18,481 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2019-01-12 23:18:18,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18971 states. [2019-01-12 23:18:18,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18971 to 16646. [2019-01-12 23:18:18,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16646 states. [2019-01-12 23:18:18,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16646 states to 16646 states and 51931 transitions. [2019-01-12 23:18:18,724 INFO L78 Accepts]: Start accepts. Automaton has 16646 states and 51931 transitions. Word has length 63 [2019-01-12 23:18:18,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 23:18:18,724 INFO L480 AbstractCegarLoop]: Abstraction has 16646 states and 51931 transitions. [2019-01-12 23:18:18,724 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-12 23:18:18,724 INFO L276 IsEmpty]: Start isEmpty. Operand 16646 states and 51931 transitions. [2019-01-12 23:18:18,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-01-12 23:18:18,732 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 23:18:18,732 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] [2019-01-12 23:18:18,732 INFO L423 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 23:18:18,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 23:18:18,733 INFO L82 PathProgramCache]: Analyzing trace with hash -1697664519, now seen corresponding path program 1 times [2019-01-12 23:18:18,733 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 23:18:18,733 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 23:18:18,735 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:18:18,735 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 23:18:18,735 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:18:18,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 23:18:18,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 23:18:18,973 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 23:18:18,973 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 23:18:18,973 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 23:18:18,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 23:18:18,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-12 23:18:18,976 INFO L87 Difference]: Start difference. First operand 16646 states and 51931 transitions. Second operand 4 states. [2019-01-12 23:18:19,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 23:18:19,369 INFO L93 Difference]: Finished difference Result 20582 states and 63398 transitions. [2019-01-12 23:18:19,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 23:18:19,370 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 67 [2019-01-12 23:18:19,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 23:18:19,403 INFO L225 Difference]: With dead ends: 20582 [2019-01-12 23:18:19,403 INFO L226 Difference]: Without dead ends: 20582 [2019-01-12 23:18:19,403 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-12 23:18:19,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20582 states. [2019-01-12 23:18:19,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20582 to 18532. [2019-01-12 23:18:19,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18532 states. [2019-01-12 23:18:19,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18532 states to 18532 states and 57288 transitions. [2019-01-12 23:18:19,668 INFO L78 Accepts]: Start accepts. Automaton has 18532 states and 57288 transitions. Word has length 67 [2019-01-12 23:18:19,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 23:18:19,668 INFO L480 AbstractCegarLoop]: Abstraction has 18532 states and 57288 transitions. [2019-01-12 23:18:19,668 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 23:18:19,668 INFO L276 IsEmpty]: Start isEmpty. Operand 18532 states and 57288 transitions. [2019-01-12 23:18:19,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-01-12 23:18:19,677 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 23:18:19,677 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] [2019-01-12 23:18:19,678 INFO L423 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 23:18:19,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 23:18:19,678 INFO L82 PathProgramCache]: Analyzing trace with hash 520093434, now seen corresponding path program 1 times [2019-01-12 23:18:19,678 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 23:18:19,678 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 23:18:19,680 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:18:19,680 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 23:18:19,680 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:18:19,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 23:18:19,791 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 23:18:19,791 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 23:18:19,791 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 23:18:19,791 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 23:18:19,793 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 23:18:19,793 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 23:18:19,793 INFO L87 Difference]: Start difference. First operand 18532 states and 57288 transitions. Second operand 3 states. [2019-01-12 23:18:20,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 23:18:20,737 INFO L93 Difference]: Finished difference Result 19140 states and 58939 transitions. [2019-01-12 23:18:20,738 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 23:18:20,738 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2019-01-12 23:18:20,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 23:18:20,781 INFO L225 Difference]: With dead ends: 19140 [2019-01-12 23:18:20,781 INFO L226 Difference]: Without dead ends: 19140 [2019-01-12 23:18:20,781 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 23:18:20,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19140 states. [2019-01-12 23:18:21,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19140 to 18856. [2019-01-12 23:18:21,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18856 states. [2019-01-12 23:18:21,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18856 states to 18856 states and 58160 transitions. [2019-01-12 23:18:21,076 INFO L78 Accepts]: Start accepts. Automaton has 18856 states and 58160 transitions. Word has length 67 [2019-01-12 23:18:21,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 23:18:21,076 INFO L480 AbstractCegarLoop]: Abstraction has 18856 states and 58160 transitions. [2019-01-12 23:18:21,076 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 23:18:21,076 INFO L276 IsEmpty]: Start isEmpty. Operand 18856 states and 58160 transitions. [2019-01-12 23:18:21,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-01-12 23:18:21,087 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 23:18:21,087 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 23:18:21,087 INFO L423 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 23:18:21,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 23:18:21,088 INFO L82 PathProgramCache]: Analyzing trace with hash -981974209, now seen corresponding path program 1 times [2019-01-12 23:18:21,088 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 23:18:21,088 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 23:18:21,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:18:21,090 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 23:18:21,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:18:21,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 23:18:21,168 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 23:18:21,168 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 23:18:21,168 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 23:18:21,168 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 23:18:21,168 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 23:18:21,169 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 23:18:21,169 INFO L87 Difference]: Start difference. First operand 18856 states and 58160 transitions. Second operand 3 states. [2019-01-12 23:18:21,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 23:18:21,419 INFO L93 Difference]: Finished difference Result 24076 states and 74215 transitions. [2019-01-12 23:18:21,420 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 23:18:21,420 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 69 [2019-01-12 23:18:21,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 23:18:21,460 INFO L225 Difference]: With dead ends: 24076 [2019-01-12 23:18:21,460 INFO L226 Difference]: Without dead ends: 24076 [2019-01-12 23:18:21,460 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 23:18:21,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24076 states. [2019-01-12 23:18:22,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24076 to 23284. [2019-01-12 23:18:22,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23284 states. [2019-01-12 23:18:22,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23284 states to 23284 states and 71849 transitions. [2019-01-12 23:18:22,090 INFO L78 Accepts]: Start accepts. Automaton has 23284 states and 71849 transitions. Word has length 69 [2019-01-12 23:18:22,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 23:18:22,090 INFO L480 AbstractCegarLoop]: Abstraction has 23284 states and 71849 transitions. [2019-01-12 23:18:22,091 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 23:18:22,091 INFO L276 IsEmpty]: Start isEmpty. Operand 23284 states and 71849 transitions. [2019-01-12 23:18:22,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-01-12 23:18:22,103 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 23:18:22,103 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 23:18:22,103 INFO L423 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 23:18:22,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 23:18:22,104 INFO L82 PathProgramCache]: Analyzing trace with hash 814977150, now seen corresponding path program 1 times [2019-01-12 23:18:22,104 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 23:18:22,104 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 23:18:22,106 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:18:22,106 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 23:18:22,106 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:18:22,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 23:18:22,286 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 23:18:22,287 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 23:18:22,287 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-12 23:18:22,287 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-12 23:18:22,287 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-12 23:18:22,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-01-12 23:18:22,288 INFO L87 Difference]: Start difference. First operand 23284 states and 71849 transitions. Second operand 6 states. [2019-01-12 23:18:23,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 23:18:23,498 INFO L93 Difference]: Finished difference Result 27964 states and 85091 transitions. [2019-01-12 23:18:23,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-12 23:18:23,499 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 69 [2019-01-12 23:18:23,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 23:18:23,548 INFO L225 Difference]: With dead ends: 27964 [2019-01-12 23:18:23,548 INFO L226 Difference]: Without dead ends: 27964 [2019-01-12 23:18:23,548 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 23:18:23,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27964 states. [2019-01-12 23:18:23,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27964 to 26476. [2019-01-12 23:18:23,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26476 states. [2019-01-12 23:18:23,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26476 states to 26476 states and 81094 transitions. [2019-01-12 23:18:23,934 INFO L78 Accepts]: Start accepts. Automaton has 26476 states and 81094 transitions. Word has length 69 [2019-01-12 23:18:23,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 23:18:23,935 INFO L480 AbstractCegarLoop]: Abstraction has 26476 states and 81094 transitions. [2019-01-12 23:18:23,935 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-12 23:18:23,935 INFO L276 IsEmpty]: Start isEmpty. Operand 26476 states and 81094 transitions. [2019-01-12 23:18:23,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-01-12 23:18:23,950 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 23:18:23,951 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 23:18:23,951 INFO L423 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 23:18:23,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 23:18:23,951 INFO L82 PathProgramCache]: Analyzing trace with hash -1262232193, now seen corresponding path program 1 times [2019-01-12 23:18:23,951 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 23:18:23,952 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 23:18:23,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:18:23,954 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 23:18:23,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:18:23,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 23:18:24,281 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 23:18:24,282 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 23:18:24,282 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-12 23:18:24,282 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-12 23:18:24,282 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-12 23:18:24,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-01-12 23:18:24,283 INFO L87 Difference]: Start difference. First operand 26476 states and 81094 transitions. Second operand 6 states. [2019-01-12 23:18:24,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 23:18:24,939 INFO L93 Difference]: Finished difference Result 30144 states and 89716 transitions. [2019-01-12 23:18:24,940 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-12 23:18:24,940 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 69 [2019-01-12 23:18:24,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 23:18:24,989 INFO L225 Difference]: With dead ends: 30144 [2019-01-12 23:18:24,989 INFO L226 Difference]: Without dead ends: 30144 [2019-01-12 23:18:24,990 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2019-01-12 23:18:25,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30144 states. [2019-01-12 23:18:25,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30144 to 26872. [2019-01-12 23:18:25,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26872 states. [2019-01-12 23:18:25,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26872 states to 26872 states and 81197 transitions. [2019-01-12 23:18:25,390 INFO L78 Accepts]: Start accepts. Automaton has 26872 states and 81197 transitions. Word has length 69 [2019-01-12 23:18:25,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 23:18:25,391 INFO L480 AbstractCegarLoop]: Abstraction has 26872 states and 81197 transitions. [2019-01-12 23:18:25,391 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-12 23:18:25,391 INFO L276 IsEmpty]: Start isEmpty. Operand 26872 states and 81197 transitions. [2019-01-12 23:18:25,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-01-12 23:18:25,405 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 23:18:25,405 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 23:18:25,405 INFO L423 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 23:18:25,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 23:18:25,406 INFO L82 PathProgramCache]: Analyzing trace with hash -1050881280, now seen corresponding path program 1 times [2019-01-12 23:18:25,406 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 23:18:25,406 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 23:18:25,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:18:25,408 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 23:18:25,408 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:18:25,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 23:18:25,767 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 23:18:25,768 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 23:18:25,768 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-12 23:18:25,768 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 23:18:25,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 23:18:25,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-12 23:18:25,769 INFO L87 Difference]: Start difference. First operand 26872 states and 81197 transitions. Second operand 5 states. [2019-01-12 23:18:26,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 23:18:26,336 INFO L93 Difference]: Finished difference Result 32055 states and 96368 transitions. [2019-01-12 23:18:26,337 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-12 23:18:26,337 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 69 [2019-01-12 23:18:26,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 23:18:26,392 INFO L225 Difference]: With dead ends: 32055 [2019-01-12 23:18:26,392 INFO L226 Difference]: Without dead ends: 32055 [2019-01-12 23:18:26,392 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-01-12 23:18:26,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32055 states. [2019-01-12 23:18:26,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32055 to 29288. [2019-01-12 23:18:26,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29288 states. [2019-01-12 23:18:26,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29288 states to 29288 states and 87955 transitions. [2019-01-12 23:18:26,836 INFO L78 Accepts]: Start accepts. Automaton has 29288 states and 87955 transitions. Word has length 69 [2019-01-12 23:18:26,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 23:18:26,836 INFO L480 AbstractCegarLoop]: Abstraction has 29288 states and 87955 transitions. [2019-01-12 23:18:26,836 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 23:18:26,836 INFO L276 IsEmpty]: Start isEmpty. Operand 29288 states and 87955 transitions. [2019-01-12 23:18:26,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-01-12 23:18:26,850 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 23:18:26,850 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 23:18:26,851 INFO L423 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 23:18:26,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 23:18:26,851 INFO L82 PathProgramCache]: Analyzing trace with hash 936600480, now seen corresponding path program 1 times [2019-01-12 23:18:26,851 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 23:18:26,851 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 23:18:26,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:18:26,855 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 23:18:26,855 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:18:26,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 23:18:26,971 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 23:18:26,971 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 23:18:26,971 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 23:18:26,971 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 23:18:26,972 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 23:18:26,972 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 23:18:26,972 INFO L87 Difference]: Start difference. First operand 29288 states and 87955 transitions. Second operand 3 states. [2019-01-12 23:18:27,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 23:18:27,348 INFO L93 Difference]: Finished difference Result 41748 states and 124592 transitions. [2019-01-12 23:18:27,349 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 23:18:27,349 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 69 [2019-01-12 23:18:27,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 23:18:27,436 INFO L225 Difference]: With dead ends: 41748 [2019-01-12 23:18:27,437 INFO L226 Difference]: Without dead ends: 41748 [2019-01-12 23:18:27,437 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 23:18:27,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41748 states. [2019-01-12 23:18:28,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41748 to 31196. [2019-01-12 23:18:28,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31196 states. [2019-01-12 23:18:28,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31196 states to 31196 states and 94070 transitions. [2019-01-12 23:18:28,166 INFO L78 Accepts]: Start accepts. Automaton has 31196 states and 94070 transitions. Word has length 69 [2019-01-12 23:18:28,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 23:18:28,166 INFO L480 AbstractCegarLoop]: Abstraction has 31196 states and 94070 transitions. [2019-01-12 23:18:28,167 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 23:18:28,167 INFO L276 IsEmpty]: Start isEmpty. Operand 31196 states and 94070 transitions. [2019-01-12 23:18:28,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-01-12 23:18:28,178 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 23:18:28,178 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 23:18:28,178 INFO L423 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 23:18:28,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 23:18:28,179 INFO L82 PathProgramCache]: Analyzing trace with hash -870853983, now seen corresponding path program 1 times [2019-01-12 23:18:28,179 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 23:18:28,179 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 23:18:28,180 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:18:28,181 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 23:18:28,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:18:28,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 23:18:28,500 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 23:18:28,500 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 23:18:28,501 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-12 23:18:28,501 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-12 23:18:28,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-12 23:18:28,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-01-12 23:18:28,502 INFO L87 Difference]: Start difference. First operand 31196 states and 94070 transitions. Second operand 7 states. [2019-01-12 23:18:29,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 23:18:29,203 INFO L93 Difference]: Finished difference Result 29386 states and 84354 transitions. [2019-01-12 23:18:29,203 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-12 23:18:29,203 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 69 [2019-01-12 23:18:29,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 23:18:29,251 INFO L225 Difference]: With dead ends: 29386 [2019-01-12 23:18:29,251 INFO L226 Difference]: Without dead ends: 29386 [2019-01-12 23:18:29,251 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2019-01-12 23:18:29,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29386 states. [2019-01-12 23:18:29,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29386 to 24927. [2019-01-12 23:18:29,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24927 states. [2019-01-12 23:18:29,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24927 states to 24927 states and 71599 transitions. [2019-01-12 23:18:29,629 INFO L78 Accepts]: Start accepts. Automaton has 24927 states and 71599 transitions. Word has length 69 [2019-01-12 23:18:29,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 23:18:29,629 INFO L480 AbstractCegarLoop]: Abstraction has 24927 states and 71599 transitions. [2019-01-12 23:18:29,629 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-12 23:18:29,629 INFO L276 IsEmpty]: Start isEmpty. Operand 24927 states and 71599 transitions. [2019-01-12 23:18:29,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-01-12 23:18:29,639 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 23:18:29,639 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 23:18:29,640 INFO L423 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 23:18:29,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 23:18:29,640 INFO L82 PathProgramCache]: Analyzing trace with hash 16649698, now seen corresponding path program 1 times [2019-01-12 23:18:29,640 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 23:18:29,640 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 23:18:29,643 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:18:29,643 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 23:18:29,643 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:18:29,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 23:18:29,784 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 23:18:29,784 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 23:18:29,784 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-12 23:18:29,784 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 23:18:29,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 23:18:29,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-01-12 23:18:29,785 INFO L87 Difference]: Start difference. First operand 24927 states and 71599 transitions. Second operand 5 states. [2019-01-12 23:18:29,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 23:18:29,845 INFO L93 Difference]: Finished difference Result 7463 states and 17981 transitions. [2019-01-12 23:18:29,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-12 23:18:29,846 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 69 [2019-01-12 23:18:29,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 23:18:29,855 INFO L225 Difference]: With dead ends: 7463 [2019-01-12 23:18:29,855 INFO L226 Difference]: Without dead ends: 6138 [2019-01-12 23:18:29,856 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 23:18:29,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6138 states. [2019-01-12 23:18:29,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6138 to 5532. [2019-01-12 23:18:29,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5532 states. [2019-01-12 23:18:29,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5532 states to 5532 states and 12870 transitions. [2019-01-12 23:18:29,921 INFO L78 Accepts]: Start accepts. Automaton has 5532 states and 12870 transitions. Word has length 69 [2019-01-12 23:18:29,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 23:18:29,921 INFO L480 AbstractCegarLoop]: Abstraction has 5532 states and 12870 transitions. [2019-01-12 23:18:29,921 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 23:18:29,922 INFO L276 IsEmpty]: Start isEmpty. Operand 5532 states and 12870 transitions. [2019-01-12 23:18:29,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-01-12 23:18:29,927 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 23:18:29,927 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 23:18:29,927 INFO L423 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 23:18:29,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 23:18:29,927 INFO L82 PathProgramCache]: Analyzing trace with hash 916580311, now seen corresponding path program 1 times [2019-01-12 23:18:29,928 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 23:18:29,928 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 23:18:29,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:18:29,929 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 23:18:29,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:18:29,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 23:18:30,010 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 23:18:30,010 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 23:18:30,010 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 23:18:30,011 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 23:18:30,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 23:18:30,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 23:18:30,011 INFO L87 Difference]: Start difference. First operand 5532 states and 12870 transitions. Second operand 3 states. [2019-01-12 23:18:30,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 23:18:30,134 INFO L93 Difference]: Finished difference Result 7168 states and 16476 transitions. [2019-01-12 23:18:30,135 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 23:18:30,135 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 69 [2019-01-12 23:18:30,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 23:18:30,144 INFO L225 Difference]: With dead ends: 7168 [2019-01-12 23:18:30,144 INFO L226 Difference]: Without dead ends: 7168 [2019-01-12 23:18:30,144 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 23:18:30,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7168 states. [2019-01-12 23:18:30,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7168 to 5471. [2019-01-12 23:18:30,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5471 states. [2019-01-12 23:18:30,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5471 states to 5471 states and 12410 transitions. [2019-01-12 23:18:30,208 INFO L78 Accepts]: Start accepts. Automaton has 5471 states and 12410 transitions. Word has length 69 [2019-01-12 23:18:30,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 23:18:30,208 INFO L480 AbstractCegarLoop]: Abstraction has 5471 states and 12410 transitions. [2019-01-12 23:18:30,208 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 23:18:30,208 INFO L276 IsEmpty]: Start isEmpty. Operand 5471 states and 12410 transitions. [2019-01-12 23:18:30,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-01-12 23:18:30,214 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 23:18:30,214 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] [2019-01-12 23:18:30,214 INFO L423 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 23:18:30,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 23:18:30,215 INFO L82 PathProgramCache]: Analyzing trace with hash -1596601910, now seen corresponding path program 1 times [2019-01-12 23:18:30,215 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 23:18:30,215 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 23:18:30,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:18:30,217 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 23:18:30,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:18:30,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 23:18:30,498 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 23:18:30,498 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 23:18:30,498 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-12 23:18:30,499 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 23:18:30,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 23:18:30,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-12 23:18:30,499 INFO L87 Difference]: Start difference. First operand 5471 states and 12410 transitions. Second operand 5 states. [2019-01-12 23:18:30,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 23:18:30,692 INFO L93 Difference]: Finished difference Result 6625 states and 15015 transitions. [2019-01-12 23:18:30,693 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-12 23:18:30,694 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 75 [2019-01-12 23:18:30,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 23:18:30,703 INFO L225 Difference]: With dead ends: 6625 [2019-01-12 23:18:30,703 INFO L226 Difference]: Without dead ends: 6625 [2019-01-12 23:18:30,703 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-01-12 23:18:30,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6625 states. [2019-01-12 23:18:30,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6625 to 5915. [2019-01-12 23:18:30,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5915 states. [2019-01-12 23:18:30,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5915 states to 5915 states and 13414 transitions. [2019-01-12 23:18:30,767 INFO L78 Accepts]: Start accepts. Automaton has 5915 states and 13414 transitions. Word has length 75 [2019-01-12 23:18:30,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 23:18:30,767 INFO L480 AbstractCegarLoop]: Abstraction has 5915 states and 13414 transitions. [2019-01-12 23:18:30,767 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 23:18:30,767 INFO L276 IsEmpty]: Start isEmpty. Operand 5915 states and 13414 transitions. [2019-01-12 23:18:30,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-01-12 23:18:30,773 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 23:18:30,774 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] [2019-01-12 23:18:30,774 INFO L423 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 23:18:30,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 23:18:30,774 INFO L82 PathProgramCache]: Analyzing trace with hash 146208425, now seen corresponding path program 1 times [2019-01-12 23:18:30,774 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 23:18:30,774 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 23:18:30,776 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:18:30,776 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 23:18:30,776 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:18:30,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 23:18:31,039 WARN L181 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2019-01-12 23:18:31,135 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 23:18:31,135 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 23:18:31,135 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-01-12 23:18:31,136 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-12 23:18:31,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-12 23:18:31,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-01-12 23:18:31,136 INFO L87 Difference]: Start difference. First operand 5915 states and 13414 transitions. Second operand 9 states. [2019-01-12 23:18:31,933 WARN L181 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2019-01-12 23:18:32,451 WARN L181 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2019-01-12 23:18:33,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 23:18:33,126 INFO L93 Difference]: Finished difference Result 7377 states and 16563 transitions. [2019-01-12 23:18:33,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-01-12 23:18:33,128 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 75 [2019-01-12 23:18:33,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 23:18:33,137 INFO L225 Difference]: With dead ends: 7377 [2019-01-12 23:18:33,137 INFO L226 Difference]: Without dead ends: 7275 [2019-01-12 23:18:33,138 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=83, Invalid=259, Unknown=0, NotChecked=0, Total=342 [2019-01-12 23:18:33,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7275 states. [2019-01-12 23:18:33,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7275 to 6012. [2019-01-12 23:18:33,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6012 states. [2019-01-12 23:18:33,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6012 states to 6012 states and 13507 transitions. [2019-01-12 23:18:33,207 INFO L78 Accepts]: Start accepts. Automaton has 6012 states and 13507 transitions. Word has length 75 [2019-01-12 23:18:33,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 23:18:33,207 INFO L480 AbstractCegarLoop]: Abstraction has 6012 states and 13507 transitions. [2019-01-12 23:18:33,207 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-12 23:18:33,208 INFO L276 IsEmpty]: Start isEmpty. Operand 6012 states and 13507 transitions. [2019-01-12 23:18:33,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-01-12 23:18:33,216 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 23:18:33,216 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] [2019-01-12 23:18:33,216 INFO L423 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 23:18:33,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 23:18:33,216 INFO L82 PathProgramCache]: Analyzing trace with hash 1820489000, now seen corresponding path program 1 times [2019-01-12 23:18:33,217 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 23:18:33,217 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 23:18:33,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:18:33,221 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 23:18:33,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:18:33,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 23:18:33,975 WARN L181 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 9 [2019-01-12 23:18:34,004 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 23:18:34,004 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 23:18:34,004 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-12 23:18:34,005 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-12 23:18:34,005 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-12 23:18:34,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2019-01-12 23:18:34,005 INFO L87 Difference]: Start difference. First operand 6012 states and 13507 transitions. Second operand 7 states. [2019-01-12 23:18:34,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 23:18:34,875 INFO L93 Difference]: Finished difference Result 7492 states and 16836 transitions. [2019-01-12 23:18:34,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-12 23:18:34,876 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 96 [2019-01-12 23:18:34,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 23:18:34,885 INFO L225 Difference]: With dead ends: 7492 [2019-01-12 23:18:34,886 INFO L226 Difference]: Without dead ends: 7492 [2019-01-12 23:18:34,886 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2019-01-12 23:18:34,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7492 states. [2019-01-12 23:18:34,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7492 to 6152. [2019-01-12 23:18:34,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6152 states. [2019-01-12 23:18:34,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6152 states to 6152 states and 13895 transitions. [2019-01-12 23:18:34,957 INFO L78 Accepts]: Start accepts. Automaton has 6152 states and 13895 transitions. Word has length 96 [2019-01-12 23:18:34,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 23:18:34,957 INFO L480 AbstractCegarLoop]: Abstraction has 6152 states and 13895 transitions. [2019-01-12 23:18:34,958 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-12 23:18:34,958 INFO L276 IsEmpty]: Start isEmpty. Operand 6152 states and 13895 transitions. [2019-01-12 23:18:34,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-01-12 23:18:34,965 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 23:18:34,965 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 23:18:34,966 INFO L423 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 23:18:34,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 23:18:34,966 INFO L82 PathProgramCache]: Analyzing trace with hash 914288555, now seen corresponding path program 1 times [2019-01-12 23:18:34,966 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 23:18:34,966 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 23:18:34,971 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:18:34,971 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 23:18:34,971 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:18:34,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 23:18:35,176 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 23:18:35,177 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 23:18:35,177 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 23:18:35,177 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 23:18:35,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 23:18:35,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-12 23:18:35,180 INFO L87 Difference]: Start difference. First operand 6152 states and 13895 transitions. Second operand 4 states. [2019-01-12 23:18:35,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 23:18:35,377 INFO L93 Difference]: Finished difference Result 7319 states and 16393 transitions. [2019-01-12 23:18:35,378 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 23:18:35,378 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 96 [2019-01-12 23:18:35,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 23:18:35,386 INFO L225 Difference]: With dead ends: 7319 [2019-01-12 23:18:35,386 INFO L226 Difference]: Without dead ends: 7319 [2019-01-12 23:18:35,387 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 23:18:35,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7319 states. [2019-01-12 23:18:35,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7319 to 6509. [2019-01-12 23:18:35,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6509 states. [2019-01-12 23:18:35,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6509 states to 6509 states and 14665 transitions. [2019-01-12 23:18:35,460 INFO L78 Accepts]: Start accepts. Automaton has 6509 states and 14665 transitions. Word has length 96 [2019-01-12 23:18:35,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 23:18:35,460 INFO L480 AbstractCegarLoop]: Abstraction has 6509 states and 14665 transitions. [2019-01-12 23:18:35,460 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 23:18:35,460 INFO L276 IsEmpty]: Start isEmpty. Operand 6509 states and 14665 transitions. [2019-01-12 23:18:35,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-01-12 23:18:35,467 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 23:18:35,467 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] [2019-01-12 23:18:35,467 INFO L423 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 23:18:35,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 23:18:35,468 INFO L82 PathProgramCache]: Analyzing trace with hash 1593425393, now seen corresponding path program 1 times [2019-01-12 23:18:35,468 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 23:18:35,468 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 23:18:35,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:18:35,469 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 23:18:35,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:18:35,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 23:18:35,799 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 23:18:35,800 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 23:18:35,800 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-12 23:18:35,801 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 23:18:35,801 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 23:18:35,801 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-12 23:18:35,801 INFO L87 Difference]: Start difference. First operand 6509 states and 14665 transitions. Second operand 5 states. [2019-01-12 23:18:36,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 23:18:36,637 INFO L93 Difference]: Finished difference Result 7016 states and 15753 transitions. [2019-01-12 23:18:36,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-12 23:18:36,637 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 98 [2019-01-12 23:18:36,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 23:18:36,646 INFO L225 Difference]: With dead ends: 7016 [2019-01-12 23:18:36,646 INFO L226 Difference]: Without dead ends: 7016 [2019-01-12 23:18:36,646 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-01-12 23:18:36,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7016 states. [2019-01-12 23:18:36,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7016 to 5405. [2019-01-12 23:18:36,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5405 states. [2019-01-12 23:18:36,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5405 states to 5405 states and 12181 transitions. [2019-01-12 23:18:36,707 INFO L78 Accepts]: Start accepts. Automaton has 5405 states and 12181 transitions. Word has length 98 [2019-01-12 23:18:36,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 23:18:36,707 INFO L480 AbstractCegarLoop]: Abstraction has 5405 states and 12181 transitions. [2019-01-12 23:18:36,707 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 23:18:36,707 INFO L276 IsEmpty]: Start isEmpty. Operand 5405 states and 12181 transitions. [2019-01-12 23:18:36,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-01-12 23:18:36,713 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 23:18:36,713 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] [2019-01-12 23:18:36,713 INFO L423 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 23:18:36,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 23:18:36,714 INFO L82 PathProgramCache]: Analyzing trace with hash 1604741520, now seen corresponding path program 1 times [2019-01-12 23:18:36,714 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 23:18:36,714 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 23:18:36,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:18:36,716 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 23:18:36,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:18:36,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 23:18:36,832 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 23:18:36,832 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 23:18:36,832 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 23:18:36,833 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 23:18:36,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 23:18:36,833 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-12 23:18:36,833 INFO L87 Difference]: Start difference. First operand 5405 states and 12181 transitions. Second operand 4 states. [2019-01-12 23:18:37,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 23:18:37,099 INFO L93 Difference]: Finished difference Result 6953 states and 15553 transitions. [2019-01-12 23:18:37,100 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-12 23:18:37,100 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 98 [2019-01-12 23:18:37,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 23:18:37,110 INFO L225 Difference]: With dead ends: 6953 [2019-01-12 23:18:37,110 INFO L226 Difference]: Without dead ends: 6886 [2019-01-12 23:18:37,110 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-12 23:18:37,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6886 states. [2019-01-12 23:18:37,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6886 to 6454. [2019-01-12 23:18:37,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6454 states. [2019-01-12 23:18:37,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6454 states to 6454 states and 14500 transitions. [2019-01-12 23:18:37,181 INFO L78 Accepts]: Start accepts. Automaton has 6454 states and 14500 transitions. Word has length 98 [2019-01-12 23:18:37,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 23:18:37,181 INFO L480 AbstractCegarLoop]: Abstraction has 6454 states and 14500 transitions. [2019-01-12 23:18:37,181 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 23:18:37,181 INFO L276 IsEmpty]: Start isEmpty. Operand 6454 states and 14500 transitions. [2019-01-12 23:18:37,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-01-12 23:18:37,188 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 23:18:37,188 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 23:18:37,189 INFO L423 AbstractCegarLoop]: === Iteration 26 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 23:18:37,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 23:18:37,189 INFO L82 PathProgramCache]: Analyzing trace with hash -472467823, now seen corresponding path program 1 times [2019-01-12 23:18:37,189 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 23:18:37,189 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 23:18:37,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:18:37,191 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 23:18:37,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:18:37,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 23:18:37,432 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 23:18:37,433 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 23:18:37,433 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-01-12 23:18:37,433 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-01-12 23:18:37,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-01-12 23:18:37,434 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2019-01-12 23:18:37,434 INFO L87 Difference]: Start difference. First operand 6454 states and 14500 transitions. Second operand 13 states. [2019-01-12 23:18:38,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 23:18:38,733 INFO L93 Difference]: Finished difference Result 9565 states and 21168 transitions. [2019-01-12 23:18:38,735 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-01-12 23:18:38,735 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 98 [2019-01-12 23:18:38,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 23:18:38,746 INFO L225 Difference]: With dead ends: 9565 [2019-01-12 23:18:38,747 INFO L226 Difference]: Without dead ends: 9565 [2019-01-12 23:18:38,747 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 155 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=155, Invalid=715, Unknown=0, NotChecked=0, Total=870 [2019-01-12 23:18:38,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9565 states. [2019-01-12 23:18:38,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9565 to 6928. [2019-01-12 23:18:38,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6928 states. [2019-01-12 23:18:38,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6928 states to 6928 states and 15470 transitions. [2019-01-12 23:18:38,851 INFO L78 Accepts]: Start accepts. Automaton has 6928 states and 15470 transitions. Word has length 98 [2019-01-12 23:18:38,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 23:18:38,851 INFO L480 AbstractCegarLoop]: Abstraction has 6928 states and 15470 transitions. [2019-01-12 23:18:38,851 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-01-12 23:18:38,852 INFO L276 IsEmpty]: Start isEmpty. Operand 6928 states and 15470 transitions. [2019-01-12 23:18:38,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-01-12 23:18:38,860 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 23:18:38,860 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] [2019-01-12 23:18:38,860 INFO L423 AbstractCegarLoop]: === Iteration 27 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 23:18:38,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 23:18:38,861 INFO L82 PathProgramCache]: Analyzing trace with hash 626386771, now seen corresponding path program 1 times [2019-01-12 23:18:38,861 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 23:18:38,862 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 23:18:38,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:18:38,863 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 23:18:38,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:18:38,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 23:18:39,190 WARN L181 SmtUtils]: Spent 227.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2019-01-12 23:18:39,341 WARN L181 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2019-01-12 23:18:39,444 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 23:18:39,445 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 23:18:39,445 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-01-12 23:18:39,445 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-12 23:18:39,446 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-12 23:18:39,446 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-01-12 23:18:39,446 INFO L87 Difference]: Start difference. First operand 6928 states and 15470 transitions. Second operand 11 states. [2019-01-12 23:18:41,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 23:18:41,682 INFO L93 Difference]: Finished difference Result 12915 states and 28923 transitions. [2019-01-12 23:18:41,683 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-01-12 23:18:41,683 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 98 [2019-01-12 23:18:41,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 23:18:41,695 INFO L225 Difference]: With dead ends: 12915 [2019-01-12 23:18:41,695 INFO L226 Difference]: Without dead ends: 9002 [2019-01-12 23:18:41,695 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=110, Invalid=490, Unknown=0, NotChecked=0, Total=600 [2019-01-12 23:18:41,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9002 states. [2019-01-12 23:18:41,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9002 to 6858. [2019-01-12 23:18:41,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6858 states. [2019-01-12 23:18:41,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6858 states to 6858 states and 15258 transitions. [2019-01-12 23:18:41,779 INFO L78 Accepts]: Start accepts. Automaton has 6858 states and 15258 transitions. Word has length 98 [2019-01-12 23:18:41,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 23:18:41,779 INFO L480 AbstractCegarLoop]: Abstraction has 6858 states and 15258 transitions. [2019-01-12 23:18:41,779 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-12 23:18:41,780 INFO L276 IsEmpty]: Start isEmpty. Operand 6858 states and 15258 transitions. [2019-01-12 23:18:41,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-01-12 23:18:41,787 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 23:18:41,787 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] [2019-01-12 23:18:41,787 INFO L423 AbstractCegarLoop]: === Iteration 28 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 23:18:41,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 23:18:41,787 INFO L82 PathProgramCache]: Analyzing trace with hash 2014235787, now seen corresponding path program 1 times [2019-01-12 23:18:41,788 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 23:18:41,788 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 23:18:41,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:18:41,789 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 23:18:41,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:18:41,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 23:18:42,173 WARN L181 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 10 [2019-01-12 23:18:42,545 WARN L181 SmtUtils]: Spent 272.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 16 [2019-01-12 23:18:42,556 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 23:18:42,556 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 23:18:42,556 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-12 23:18:42,557 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-12 23:18:42,557 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-12 23:18:42,557 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-01-12 23:18:42,557 INFO L87 Difference]: Start difference. First operand 6858 states and 15258 transitions. Second operand 6 states. [2019-01-12 23:18:42,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 23:18:42,831 INFO L93 Difference]: Finished difference Result 7653 states and 16827 transitions. [2019-01-12 23:18:42,832 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-12 23:18:42,832 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 98 [2019-01-12 23:18:42,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 23:18:42,842 INFO L225 Difference]: With dead ends: 7653 [2019-01-12 23:18:42,842 INFO L226 Difference]: Without dead ends: 7605 [2019-01-12 23:18:42,843 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-01-12 23:18:42,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7605 states. [2019-01-12 23:18:42,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7605 to 6789. [2019-01-12 23:18:42,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6789 states. [2019-01-12 23:18:42,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6789 states to 6789 states and 14950 transitions. [2019-01-12 23:18:42,916 INFO L78 Accepts]: Start accepts. Automaton has 6789 states and 14950 transitions. Word has length 98 [2019-01-12 23:18:42,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 23:18:42,917 INFO L480 AbstractCegarLoop]: Abstraction has 6789 states and 14950 transitions. [2019-01-12 23:18:42,917 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-12 23:18:42,917 INFO L276 IsEmpty]: Start isEmpty. Operand 6789 states and 14950 transitions. [2019-01-12 23:18:42,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-01-12 23:18:42,924 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 23:18:42,924 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 23:18:42,925 INFO L423 AbstractCegarLoop]: === Iteration 29 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 23:18:42,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 23:18:42,925 INFO L82 PathProgramCache]: Analyzing trace with hash -1172552224, now seen corresponding path program 1 times [2019-01-12 23:18:42,925 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 23:18:42,925 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 23:18:42,927 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:18:42,927 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 23:18:42,927 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:18:42,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 23:18:43,219 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 23:18:43,219 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 23:18:43,219 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-12 23:18:43,220 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 23:18:43,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 23:18:43,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-12 23:18:43,220 INFO L87 Difference]: Start difference. First operand 6789 states and 14950 transitions. Second operand 5 states. [2019-01-12 23:18:43,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 23:18:43,474 INFO L93 Difference]: Finished difference Result 8130 states and 17797 transitions. [2019-01-12 23:18:43,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-12 23:18:43,475 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 98 [2019-01-12 23:18:43,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 23:18:43,486 INFO L225 Difference]: With dead ends: 8130 [2019-01-12 23:18:43,486 INFO L226 Difference]: Without dead ends: 8057 [2019-01-12 23:18:43,486 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-01-12 23:18:43,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8057 states. [2019-01-12 23:18:43,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8057 to 6601. [2019-01-12 23:18:43,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6601 states. [2019-01-12 23:18:43,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6601 states to 6601 states and 14570 transitions. [2019-01-12 23:18:43,565 INFO L78 Accepts]: Start accepts. Automaton has 6601 states and 14570 transitions. Word has length 98 [2019-01-12 23:18:43,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 23:18:43,565 INFO L480 AbstractCegarLoop]: Abstraction has 6601 states and 14570 transitions. [2019-01-12 23:18:43,565 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 23:18:43,565 INFO L276 IsEmpty]: Start isEmpty. Operand 6601 states and 14570 transitions. [2019-01-12 23:18:43,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-01-12 23:18:43,573 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 23:18:43,573 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] [2019-01-12 23:18:43,573 INFO L423 AbstractCegarLoop]: === Iteration 30 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 23:18:43,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 23:18:43,573 INFO L82 PathProgramCache]: Analyzing trace with hash 984662048, now seen corresponding path program 1 times [2019-01-12 23:18:43,573 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 23:18:43,574 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 23:18:43,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:18:43,575 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 23:18:43,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:18:43,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 23:18:43,781 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 23:18:43,782 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 23:18:43,782 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-12 23:18:43,782 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-12 23:18:43,782 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-12 23:18:43,782 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-01-12 23:18:43,783 INFO L87 Difference]: Start difference. First operand 6601 states and 14570 transitions. Second operand 7 states. [2019-01-12 23:18:44,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 23:18:44,286 INFO L93 Difference]: Finished difference Result 8824 states and 19117 transitions. [2019-01-12 23:18:44,287 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-01-12 23:18:44,287 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 98 [2019-01-12 23:18:44,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 23:18:44,298 INFO L225 Difference]: With dead ends: 8824 [2019-01-12 23:18:44,298 INFO L226 Difference]: Without dead ends: 8824 [2019-01-12 23:18:44,298 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2019-01-12 23:18:44,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8824 states. [2019-01-12 23:18:44,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8824 to 7209. [2019-01-12 23:18:44,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7209 states. [2019-01-12 23:18:44,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7209 states to 7209 states and 15883 transitions. [2019-01-12 23:18:44,382 INFO L78 Accepts]: Start accepts. Automaton has 7209 states and 15883 transitions. Word has length 98 [2019-01-12 23:18:44,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 23:18:44,383 INFO L480 AbstractCegarLoop]: Abstraction has 7209 states and 15883 transitions. [2019-01-12 23:18:44,383 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-12 23:18:44,383 INFO L276 IsEmpty]: Start isEmpty. Operand 7209 states and 15883 transitions. [2019-01-12 23:18:44,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-01-12 23:18:44,390 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 23:18:44,390 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] [2019-01-12 23:18:44,391 INFO L423 AbstractCegarLoop]: === Iteration 31 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 23:18:44,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 23:18:44,391 INFO L82 PathProgramCache]: Analyzing trace with hash -1053394241, now seen corresponding path program 1 times [2019-01-12 23:18:44,391 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 23:18:44,391 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 23:18:44,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:18:44,393 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 23:18:44,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:18:44,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 23:18:44,621 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 23:18:44,621 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 23:18:44,622 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-12 23:18:44,622 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-12 23:18:44,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-12 23:18:44,622 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-01-12 23:18:44,623 INFO L87 Difference]: Start difference. First operand 7209 states and 15883 transitions. Second operand 6 states. [2019-01-12 23:18:44,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 23:18:44,836 INFO L93 Difference]: Finished difference Result 7518 states and 16482 transitions. [2019-01-12 23:18:44,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-12 23:18:44,837 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 98 [2019-01-12 23:18:44,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 23:18:44,846 INFO L225 Difference]: With dead ends: 7518 [2019-01-12 23:18:44,846 INFO L226 Difference]: Without dead ends: 7518 [2019-01-12 23:18:44,847 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-01-12 23:18:44,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7518 states. [2019-01-12 23:18:44,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7518 to 7084. [2019-01-12 23:18:44,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7084 states. [2019-01-12 23:18:44,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7084 states to 7084 states and 15596 transitions. [2019-01-12 23:18:44,922 INFO L78 Accepts]: Start accepts. Automaton has 7084 states and 15596 transitions. Word has length 98 [2019-01-12 23:18:44,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 23:18:44,922 INFO L480 AbstractCegarLoop]: Abstraction has 7084 states and 15596 transitions. [2019-01-12 23:18:44,922 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-12 23:18:44,922 INFO L276 IsEmpty]: Start isEmpty. Operand 7084 states and 15596 transitions. [2019-01-12 23:18:44,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-01-12 23:18:44,929 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 23:18:44,930 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 23:18:44,930 INFO L423 AbstractCegarLoop]: === Iteration 32 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 23:18:44,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 23:18:44,930 INFO L82 PathProgramCache]: Analyzing trace with hash 1091552204, now seen corresponding path program 1 times [2019-01-12 23:18:44,931 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 23:18:44,931 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 23:18:44,932 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:18:44,932 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 23:18:44,932 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:18:44,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 23:18:46,465 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 23:18:46,465 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 23:18:46,465 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-01-12 23:18:46,466 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-12 23:18:46,466 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-12 23:18:46,466 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2019-01-12 23:18:46,466 INFO L87 Difference]: Start difference. First operand 7084 states and 15596 transitions. Second operand 12 states. [2019-01-12 23:18:47,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 23:18:47,424 INFO L93 Difference]: Finished difference Result 9971 states and 21825 transitions. [2019-01-12 23:18:47,425 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-01-12 23:18:47,425 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 98 [2019-01-12 23:18:47,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 23:18:47,437 INFO L225 Difference]: With dead ends: 9971 [2019-01-12 23:18:47,437 INFO L226 Difference]: Without dead ends: 9971 [2019-01-12 23:18:47,438 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=104, Invalid=402, Unknown=0, NotChecked=0, Total=506 [2019-01-12 23:18:47,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9971 states. [2019-01-12 23:18:47,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9971 to 7136. [2019-01-12 23:18:47,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7136 states. [2019-01-12 23:18:47,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7136 states to 7136 states and 15719 transitions. [2019-01-12 23:18:47,531 INFO L78 Accepts]: Start accepts. Automaton has 7136 states and 15719 transitions. Word has length 98 [2019-01-12 23:18:47,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 23:18:47,531 INFO L480 AbstractCegarLoop]: Abstraction has 7136 states and 15719 transitions. [2019-01-12 23:18:47,531 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-12 23:18:47,532 INFO L276 IsEmpty]: Start isEmpty. Operand 7136 states and 15719 transitions. [2019-01-12 23:18:47,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-01-12 23:18:47,539 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 23:18:47,539 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] [2019-01-12 23:18:47,540 INFO L423 AbstractCegarLoop]: === Iteration 33 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 23:18:47,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 23:18:47,540 INFO L82 PathProgramCache]: Analyzing trace with hash 1405112171, now seen corresponding path program 2 times [2019-01-12 23:18:47,540 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 23:18:47,540 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 23:18:47,541 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:18:47,542 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 23:18:47,542 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:18:47,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-12 23:18:47,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-12 23:18:47,631 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-01-12 23:18:47,827 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2019-01-12 23:18:47,829 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.01 11:18:47 BasicIcfg [2019-01-12 23:18:47,829 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-12 23:18:47,830 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-12 23:18:47,830 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-12 23:18:47,830 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-12 23:18:47,831 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 11:17:48" (3/4) ... [2019-01-12 23:18:47,836 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2019-01-12 23:18:48,017 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-12 23:18:48,018 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-12 23:18:48,019 INFO L168 Benchmark]: Toolchain (without parser) took 61318.40 ms. Allocated memory was 1.0 GB in the beginning and 4.4 GB in the end (delta: 3.3 GB). Free memory was 954.0 MB in the beginning and 3.1 GB in the end (delta: -2.1 GB). Peak memory consumption was 1.2 GB. Max. memory is 11.5 GB. [2019-01-12 23:18:48,019 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-12 23:18:48,020 INFO L168 Benchmark]: CACSL2BoogieTranslator took 859.39 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 119.0 MB). Free memory was 948.7 MB in the beginning and 1.1 GB in the end (delta: -144.5 MB). Peak memory consumption was 27.2 MB. Max. memory is 11.5 GB. [2019-01-12 23:18:48,023 INFO L168 Benchmark]: Boogie Procedure Inliner took 109.94 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2019-01-12 23:18:48,023 INFO L168 Benchmark]: Boogie Preprocessor took 85.50 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-12 23:18:48,023 INFO L168 Benchmark]: RCFGBuilder took 1154.64 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 45.7 MB). Peak memory consumption was 45.7 MB. Max. memory is 11.5 GB. [2019-01-12 23:18:48,023 INFO L168 Benchmark]: TraceAbstraction took 58913.47 ms. Allocated memory was 1.1 GB in the beginning and 4.4 GB in the end (delta: 3.2 GB). Free memory was 1.0 GB in the beginning and 3.1 GB in the end (delta: -2.1 GB). Peak memory consumption was 1.1 GB. Max. memory is 11.5 GB. [2019-01-12 23:18:48,024 INFO L168 Benchmark]: Witness Printer took 187.95 ms. Allocated memory is still 4.4 GB. Free memory was 3.1 GB in the beginning and 3.1 GB in the end (delta: 49.0 MB). Peak memory consumption was 49.0 MB. Max. memory is 11.5 GB. [2019-01-12 23:18:48,029 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 859.39 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 119.0 MB). Free memory was 948.7 MB in the beginning and 1.1 GB in the end (delta: -144.5 MB). Peak memory consumption was 27.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 109.94 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 85.50 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 1154.64 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 45.7 MB). Peak memory consumption was 45.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 58913.47 ms. Allocated memory was 1.1 GB in the beginning and 4.4 GB in the end (delta: 3.2 GB). Free memory was 1.0 GB in the beginning and 3.1 GB in the end (delta: -2.1 GB). Peak memory consumption was 1.1 GB. Max. memory is 11.5 GB. * Witness Printer took 187.95 ms. Allocated memory is still 4.4 GB. Free memory was 3.1 GB in the beginning and 3.1 GB in the end (delta: 49.0 MB). Peak memory consumption was 49.0 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L671] -1 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L673] -1 int __unbuffered_p0_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0] [L675] -1 int __unbuffered_p0_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0] [L677] -1 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0] [L679] -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] [L680] -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] [L681] -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] [L683] -1 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L685] -1 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 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0] [L688] -1 _Bool z$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, z=0, z$flush_delayed=0] [L689] -1 int z$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, z=0, z$flush_delayed=0, z$mem_tmp=0] [L690] -1 _Bool z$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, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0] [L691] -1 _Bool z$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, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0] [L692] -1 _Bool z$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, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0] [L693] -1 _Bool z$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, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0] [L694] -1 _Bool z$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, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0] [L695] -1 _Bool z$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, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0] [L696] -1 _Bool z$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, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0] [L697] -1 int *z$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, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}] [L698] -1 int z$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, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0] [L699] -1 _Bool z$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, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0] [L700] -1 int z$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, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0] [L701] -1 _Bool z$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, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L702] -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, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L703] -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, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L785] -1 pthread_t t243; 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, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L786] FCALL, FORK -1 pthread_create(&t243, ((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, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L707] 0 z$w_buff1 = z$w_buff0 [L708] 0 z$w_buff0 = 1 [L709] 0 z$w_buff1_used = z$w_buff0_used [L710] 0 z$w_buff0_used = (_Bool)1 [L4] COND FALSE 0 !(!expression) 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, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L787] -1 pthread_t t244; 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, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L712] 0 z$r_buff1_thd0 = z$r_buff0_thd0 [L713] 0 z$r_buff1_thd1 = z$r_buff0_thd1 [L714] 0 z$r_buff1_thd2 = z$r_buff0_thd2 [L715] 0 z$r_buff0_thd1 = (_Bool)1 [L718] 0 x = 1 [L721] 0 __unbuffered_p0_EAX = x [L724] 0 __unbuffered_p0_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __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=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L788] FCALL, FORK -1 pthread_create(&t244, ((void *)0), P1, ((void *)0)) 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=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L741] 1 y = 1 [L744] 1 __unbuffered_p1_EAX = y [L747] 1 weak$$choice0 = __VERIFIER_nondet_pointer() [L748] 1 weak$$choice2 = __VERIFIER_nondet_pointer() [L749] 1 z$flush_delayed = weak$$choice2 [L750] 1 z$mem_tmp = z 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=0, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L751] EXPR 1 !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1) VAL [!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$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=0, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L751] 1 z = !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1) [L752] EXPR 1 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$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=0, weak$$choice2=1, weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0))=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L752] 1 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) [L727] EXPR 0 z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) 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=0, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L753] EXPR 1 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$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=0, weak$$choice2=1, weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L753] 1 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) [L754] EXPR 1 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$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=0, weak$$choice2=1, weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used))=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L754] 1 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used)) [L755] EXPR 1 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$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=0, weak$$choice2=1, weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L755] 1 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L756] EXPR 1 weak$$choice2 ? z$r_buff0_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$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=0, weak$$choice2=1, weak$$choice2 ? z$r_buff0_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L756] 1 z$r_buff0_thd2 = weak$$choice2 ? z$r_buff0_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2)) [L757] EXPR 1 weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$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=0, weak$$choice2=1, weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L757] 1 z$r_buff1_thd2 = weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L758] 1 __unbuffered_p1_EBX = z 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=0, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L727] 0 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L728] EXPR 0 z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$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=0, weak$$choice2=1, x=1, y=1, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L728] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L729] EXPR 0 z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$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=0, weak$$choice2=1, x=1, y=1, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L729] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L730] EXPR 0 z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$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=0, weak$$choice2=1, x=1, y=1, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L759] EXPR 1 z$flush_delayed ? z$mem_tmp : z 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=0, weak$$choice2=1, x=1, y=1, z=1, z$flush_delayed=1, z$flush_delayed ? z$mem_tmp : z=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L759] 1 z = z$flush_delayed ? z$mem_tmp : z [L760] 1 z$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=0, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L763] EXPR 1 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) 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=0, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L763] EXPR 1 z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z 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=0, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z=0] [L763] EXPR 1 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) 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=0, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z)=0, z$w_buff1=0, z$w_buff1_used=0, z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z=0] [L763] 1 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L764] EXPR 1 z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$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=0, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L764] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L730] 0 z$r_buff0_thd1 = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L765] EXPR 1 z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$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=0, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used=0, z$w_buff1=0, z$w_buff1_used=0] [L731] EXPR 0 z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$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=0, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used=0, z$w_buff1=0, z$w_buff1_used=0] [L765] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L766] EXPR 1 z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$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=0, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2=0, z$w_buff1=0, z$w_buff1_used=0] [L766] 1 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L767] EXPR 1 z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2=0, z$w_buff1=0, z$w_buff1_used=0] [L767] 1 z$r_buff1_thd2 = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 [L770] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L731] 0 z$r_buff1_thd1 = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 [L734] 0 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L790] -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=0, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L794] EXPR -1 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) 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=0, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L794] EXPR -1 z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z 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=0, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L794] EXPR -1 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) 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=0, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L794] -1 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L795] EXPR -1 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$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=0, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L795] -1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L796] EXPR -1 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$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=0, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L796] -1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L797] EXPR -1 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$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=0, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L797] -1 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L798] EXPR -1 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$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=0, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L798] -1 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L801] -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=0, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L4] 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=0, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L4] -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=0, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 225 locations, 3 error locations. UNSAFE Result, 58.6s OverallTime, 33 OverallIterations, 1 TraceHistogramMax, 31.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 8977 SDtfs, 10814 SDslu, 20774 SDs, 0 SdLazy, 10283 SolverSat, 588 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 16.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 347 GetRequests, 86 SyntacticMatches, 27 SemanticMatches, 234 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 443 ImplicationChecksByTransitivity, 11.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=66523occurred in iteration=5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 13.4s AutomataMinimizationTime, 32 MinimizatonAttempts, 130028 StatesRemovedByMinimization, 32 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 9.2s InterpolantComputationTime, 2483 NumberOfCodeBlocks, 2483 NumberOfCodeBlocksAsserted, 33 NumberOfCheckSat, 2353 ConstructedInterpolants, 0 QuantifiedInterpolants, 519466 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 32 InterpolantComputations, 32 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...