./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/pthread-wmm/safe029_pso.oepc_false-unreach-call.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 91b1670e 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/safe029_pso.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 26b2b2357b814182a8d4879b997bcd0cb02065f5 .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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-91b1670 [2018-11-28 20:37:45,514 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-28 20:37:45,519 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-28 20:37:45,540 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-28 20:37:45,541 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-28 20:37:45,543 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-28 20:37:45,545 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-28 20:37:45,548 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-28 20:37:45,551 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-28 20:37:45,554 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-28 20:37:45,557 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-28 20:37:45,558 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-28 20:37:45,559 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-28 20:37:45,563 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-28 20:37:45,564 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-28 20:37:45,564 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-28 20:37:45,566 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-28 20:37:45,568 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-28 20:37:45,570 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-28 20:37:45,572 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-28 20:37:45,573 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-28 20:37:45,575 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-28 20:37:45,578 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-28 20:37:45,579 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-28 20:37:45,579 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-28 20:37:45,580 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-28 20:37:45,581 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-28 20:37:45,582 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-28 20:37:45,583 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-28 20:37:45,585 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-28 20:37:45,585 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-28 20:37:45,586 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-28 20:37:45,586 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-28 20:37:45,587 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-28 20:37:45,588 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-28 20:37:45,589 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-28 20:37:45,589 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-28 20:37:45,606 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-28 20:37:45,606 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-28 20:37:45,607 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-28 20:37:45,607 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-28 20:37:45,609 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-28 20:37:45,609 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-28 20:37:45,609 INFO L133 SettingsManager]: * Use SBE=true [2018-11-28 20:37:45,609 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-28 20:37:45,609 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-28 20:37:45,610 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-28 20:37:45,610 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-28 20:37:45,611 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-28 20:37:45,611 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-28 20:37:45,611 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-28 20:37:45,611 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-28 20:37:45,611 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-28 20:37:45,611 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-28 20:37:45,612 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-28 20:37:45,612 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-28 20:37:45,612 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-28 20:37:45,612 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-28 20:37:45,612 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-28 20:37:45,612 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-28 20:37:45,614 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-28 20:37:45,614 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-28 20:37:45,614 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-28 20:37:45,614 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-28 20:37:45,615 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-28 20:37:45,615 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-28 20:37:45,615 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-28 20:37:45,616 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 -> 26b2b2357b814182a8d4879b997bcd0cb02065f5 [2018-11-28 20:37:45,653 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-28 20:37:45,667 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-28 20:37:45,671 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-28 20:37:45,673 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-28 20:37:45,674 INFO L276 PluginConnector]: CDTParser initialized [2018-11-28 20:37:45,674 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/pthread-wmm/safe029_pso.oepc_false-unreach-call.i [2018-11-28 20:37:45,735 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e238b3b05/401f8ab1d7f1452a928ffb2cca1c03b3/FLAG5f5968645 [2018-11-28 20:37:46,391 INFO L307 CDTParser]: Found 1 translation units. [2018-11-28 20:37:46,392 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/pthread-wmm/safe029_pso.oepc_false-unreach-call.i [2018-11-28 20:37:46,412 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e238b3b05/401f8ab1d7f1452a928ffb2cca1c03b3/FLAG5f5968645 [2018-11-28 20:37:46,627 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e238b3b05/401f8ab1d7f1452a928ffb2cca1c03b3 [2018-11-28 20:37:46,630 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-28 20:37:46,632 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-28 20:37:46,635 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-28 20:37:46,635 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-28 20:37:46,642 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-28 20:37:46,644 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 08:37:46" (1/1) ... [2018-11-28 20:37:46,649 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@12aeca62 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:37:46, skipping insertion in model container [2018-11-28 20:37:46,650 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 08:37:46" (1/1) ... [2018-11-28 20:37:46,659 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-28 20:37:46,724 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-28 20:37:47,266 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 20:37:47,287 INFO L191 MainTranslator]: Completed pre-run [2018-11-28 20:37:47,494 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 20:37:47,592 INFO L195 MainTranslator]: Completed translation [2018-11-28 20:37:47,593 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:37:47 WrapperNode [2018-11-28 20:37:47,593 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-28 20:37:47,595 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-28 20:37:47,595 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-28 20:37:47,595 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-28 20:37:47,607 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:37:47" (1/1) ... [2018-11-28 20:37:47,637 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:37:47" (1/1) ... [2018-11-28 20:37:47,681 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-28 20:37:47,683 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-28 20:37:47,684 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-28 20:37:47,684 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-28 20:37:47,694 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:37:47" (1/1) ... [2018-11-28 20:37:47,695 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:37:47" (1/1) ... [2018-11-28 20:37:47,700 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:37:47" (1/1) ... [2018-11-28 20:37:47,701 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:37:47" (1/1) ... [2018-11-28 20:37:47,714 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:37:47" (1/1) ... [2018-11-28 20:37:47,719 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:37:47" (1/1) ... [2018-11-28 20:37:47,723 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:37:47" (1/1) ... [2018-11-28 20:37:47,729 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-28 20:37:47,730 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-28 20:37:47,730 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-28 20:37:47,730 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-28 20:37:47,732 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:37: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 [2018-11-28 20:37:47,790 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-28 20:37:47,791 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-28 20:37:47,791 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2018-11-28 20:37:47,791 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-28 20:37:47,791 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2018-11-28 20:37:47,791 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2018-11-28 20:37:47,792 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2018-11-28 20:37:47,793 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2018-11-28 20:37:47,793 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2018-11-28 20:37:47,793 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-28 20:37:47,793 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-28 20:37:47,795 WARN L198 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2018-11-28 20:37:48,986 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-28 20:37:48,987 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-11-28 20:37:48,987 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 08:37:48 BoogieIcfgContainer [2018-11-28 20:37:48,988 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-28 20:37:48,989 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-28 20:37:48,990 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-28 20:37:48,993 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-28 20:37:48,994 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 08:37:46" (1/3) ... [2018-11-28 20:37:48,994 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@bc8410f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 08:37:48, skipping insertion in model container [2018-11-28 20:37:48,995 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:37:47" (2/3) ... [2018-11-28 20:37:48,996 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@bc8410f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 08:37:48, skipping insertion in model container [2018-11-28 20:37:48,996 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 08:37:48" (3/3) ... [2018-11-28 20:37:48,999 INFO L112 eAbstractionObserver]: Analyzing ICFG safe029_pso.oepc_false-unreach-call.i [2018-11-28 20:37:49,041 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:37:49,041 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:37:49,042 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:37:49,042 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:37:49,042 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:37:49,042 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:37:49,042 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:37:49,043 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:37:49,043 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:37:49,043 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:37:49,043 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:37:49,044 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:37:49,044 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:37:49,044 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:37:49,044 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:37:49,045 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:37:49,045 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:37:49,045 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:37:49,045 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:37:49,045 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:37:49,046 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:37:49,046 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:37:49,046 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:37:49,046 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:37:49,047 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:37:49,047 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:37:49,047 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:37:49,047 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:37:49,047 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:37:49,048 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:37:49,048 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:37:49,048 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:37:49,049 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:37:49,049 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:37:49,049 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:37:49,049 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:37:49,049 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:37:49,050 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:37:49,050 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:37:49,050 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:37:49,050 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:37:49,051 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:37:49,051 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:37:49,051 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:37:49,051 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:37:49,052 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:37:49,052 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:37:49,052 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:37:49,052 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:37:49,053 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:37:49,053 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:37:49,053 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:37:49,053 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:37:49,053 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:37:49,054 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:37:49,054 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:37:49,054 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:37:49,054 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:37:49,055 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:37:49,055 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:37:49,055 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:37:49,055 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:37:49,055 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:37:49,056 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:37:49,056 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:37:49,056 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:37:49,056 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet16.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:37:49,057 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet16.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:37:49,057 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:37:49,057 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:37:49,057 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet16.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:37:49,057 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet16.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:37:49,083 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2018-11-28 20:37:49,084 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-28 20:37:49,092 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-11-28 20:37:49,110 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2018-11-28 20:37:49,140 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-28 20:37:49,141 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-28 20:37:49,141 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-28 20:37:49,141 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-28 20:37:49,141 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-28 20:37:49,141 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-28 20:37:49,142 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-28 20:37:49,142 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-28 20:37:49,142 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-28 20:37:49,157 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 140places, 178 transitions [2018-11-28 20:37:50,860 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 25102 states. [2018-11-28 20:37:50,862 INFO L276 IsEmpty]: Start isEmpty. Operand 25102 states. [2018-11-28 20:37:50,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-28 20:37:50,872 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:37:50,873 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] [2018-11-28 20:37:50,877 INFO L423 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:37:50,884 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:37:50,884 INFO L82 PathProgramCache]: Analyzing trace with hash 2024635459, now seen corresponding path program 1 times [2018-11-28 20:37:50,887 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:37:50,888 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:37:50,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:37:50,959 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:37:50,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:37:51,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:37:51,273 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 20:37:51,276 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:37:51,277 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 20:37:51,282 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 20:37:51,300 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 20:37:51,301 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 20:37:51,304 INFO L87 Difference]: Start difference. First operand 25102 states. Second operand 4 states. [2018-11-28 20:37:52,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:37:52,726 INFO L93 Difference]: Finished difference Result 45394 states and 177648 transitions. [2018-11-28 20:37:52,726 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 20:37:52,729 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 31 [2018-11-28 20:37:52,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:37:53,126 INFO L225 Difference]: With dead ends: 45394 [2018-11-28 20:37:53,127 INFO L226 Difference]: Without dead ends: 40634 [2018-11-28 20:37:53,129 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 20:37:53,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40634 states. [2018-11-28 20:37:54,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40634 to 23668. [2018-11-28 20:37:54,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23668 states. [2018-11-28 20:37:55,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23668 states to 23668 states and 92565 transitions. [2018-11-28 20:37:55,030 INFO L78 Accepts]: Start accepts. Automaton has 23668 states and 92565 transitions. Word has length 31 [2018-11-28 20:37:55,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:37:55,032 INFO L480 AbstractCegarLoop]: Abstraction has 23668 states and 92565 transitions. [2018-11-28 20:37:55,032 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 20:37:55,032 INFO L276 IsEmpty]: Start isEmpty. Operand 23668 states and 92565 transitions. [2018-11-28 20:37:55,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-11-28 20:37:55,049 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:37:55,049 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] [2018-11-28 20:37:55,050 INFO L423 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:37:55,050 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:37:55,050 INFO L82 PathProgramCache]: Analyzing trace with hash -1263924681, now seen corresponding path program 1 times [2018-11-28 20:37:55,051 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:37:55,051 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:37:55,064 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:37:55,067 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:37:55,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:37:55,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:37:55,282 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 20:37:55,282 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:37:55,282 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 20:37:55,285 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 20:37:55,285 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 20:37:55,285 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 20:37:55,285 INFO L87 Difference]: Start difference. First operand 23668 states and 92565 transitions. Second operand 5 states. [2018-11-28 20:37:58,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:37:58,240 INFO L93 Difference]: Finished difference Result 64836 states and 241395 transitions. [2018-11-28 20:37:58,241 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-28 20:37:58,241 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 42 [2018-11-28 20:37:58,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:37:58,570 INFO L225 Difference]: With dead ends: 64836 [2018-11-28 20:37:58,570 INFO L226 Difference]: Without dead ends: 64676 [2018-11-28 20:37:58,571 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-11-28 20:37:58,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64676 states. [2018-11-28 20:38:00,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64676 to 37148. [2018-11-28 20:38:00,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37148 states. [2018-11-28 20:38:00,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37148 states to 37148 states and 138310 transitions. [2018-11-28 20:38:00,280 INFO L78 Accepts]: Start accepts. Automaton has 37148 states and 138310 transitions. Word has length 42 [2018-11-28 20:38:00,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:38:00,281 INFO L480 AbstractCegarLoop]: Abstraction has 37148 states and 138310 transitions. [2018-11-28 20:38:00,281 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 20:38:00,282 INFO L276 IsEmpty]: Start isEmpty. Operand 37148 states and 138310 transitions. [2018-11-28 20:38:00,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-11-28 20:38:00,286 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:38:00,287 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] [2018-11-28 20:38:00,287 INFO L423 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:38:00,287 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:38:00,287 INFO L82 PathProgramCache]: Analyzing trace with hash 555727520, now seen corresponding path program 1 times [2018-11-28 20:38:00,287 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:38:00,288 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:38:00,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:38:00,294 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:38:00,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:38:00,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:38:00,426 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 20:38:00,426 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:38:00,426 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 20:38:00,427 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 20:38:00,427 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 20:38:00,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 20:38:00,427 INFO L87 Difference]: Start difference. First operand 37148 states and 138310 transitions. Second operand 4 states. [2018-11-28 20:38:00,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:38:00,551 INFO L93 Difference]: Finished difference Result 12370 states and 41203 transitions. [2018-11-28 20:38:00,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 20:38:00,552 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 43 [2018-11-28 20:38:00,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:38:00,620 INFO L225 Difference]: With dead ends: 12370 [2018-11-28 20:38:00,621 INFO L226 Difference]: Without dead ends: 11849 [2018-11-28 20:38:00,621 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-28 20:38:00,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11849 states. [2018-11-28 20:38:00,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11849 to 11849. [2018-11-28 20:38:00,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11849 states. [2018-11-28 20:38:00,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11849 states to 11849 states and 39648 transitions. [2018-11-28 20:38:00,907 INFO L78 Accepts]: Start accepts. Automaton has 11849 states and 39648 transitions. Word has length 43 [2018-11-28 20:38:00,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:38:00,907 INFO L480 AbstractCegarLoop]: Abstraction has 11849 states and 39648 transitions. [2018-11-28 20:38:00,907 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 20:38:00,907 INFO L276 IsEmpty]: Start isEmpty. Operand 11849 states and 39648 transitions. [2018-11-28 20:38:00,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-11-28 20:38:00,916 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:38:00,916 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 20:38:00,917 INFO L423 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:38:00,917 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:38:00,917 INFO L82 PathProgramCache]: Analyzing trace with hash -2022717967, now seen corresponding path program 1 times [2018-11-28 20:38:00,917 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:38:00,917 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:38:00,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:38:00,931 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:38:00,931 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:38:00,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:38:01,110 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 20:38:01,110 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:38:01,110 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 20:38:01,111 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 20:38:01,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 20:38:01,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 20:38:01,111 INFO L87 Difference]: Start difference. First operand 11849 states and 39648 transitions. Second operand 4 states. [2018-11-28 20:38:01,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:38:01,643 INFO L93 Difference]: Finished difference Result 17025 states and 55723 transitions. [2018-11-28 20:38:01,643 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 20:38:01,644 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 56 [2018-11-28 20:38:01,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:38:01,678 INFO L225 Difference]: With dead ends: 17025 [2018-11-28 20:38:01,678 INFO L226 Difference]: Without dead ends: 17025 [2018-11-28 20:38:01,679 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-28 20:38:01,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17025 states. [2018-11-28 20:38:01,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17025 to 12885. [2018-11-28 20:38:01,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12885 states. [2018-11-28 20:38:02,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12885 states to 12885 states and 42750 transitions. [2018-11-28 20:38:02,030 INFO L78 Accepts]: Start accepts. Automaton has 12885 states and 42750 transitions. Word has length 56 [2018-11-28 20:38:02,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:38:02,032 INFO L480 AbstractCegarLoop]: Abstraction has 12885 states and 42750 transitions. [2018-11-28 20:38:02,032 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 20:38:02,032 INFO L276 IsEmpty]: Start isEmpty. Operand 12885 states and 42750 transitions. [2018-11-28 20:38:02,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-11-28 20:38:02,045 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:38:02,045 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 20:38:02,045 INFO L423 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:38:02,045 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:38:02,047 INFO L82 PathProgramCache]: Analyzing trace with hash 1977003375, now seen corresponding path program 1 times [2018-11-28 20:38:02,047 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:38:02,047 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:38:02,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:38:02,050 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:38:02,051 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:38:02,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:38:02,202 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 20:38:02,202 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:38:02,202 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 20:38:02,203 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 20:38:02,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 20:38:02,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 20:38:02,205 INFO L87 Difference]: Start difference. First operand 12885 states and 42750 transitions. Second operand 4 states. [2018-11-28 20:38:03,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:38:03,302 INFO L93 Difference]: Finished difference Result 18380 states and 60007 transitions. [2018-11-28 20:38:03,303 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 20:38:03,303 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 56 [2018-11-28 20:38:03,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:38:03,343 INFO L225 Difference]: With dead ends: 18380 [2018-11-28 20:38:03,343 INFO L226 Difference]: Without dead ends: 18380 [2018-11-28 20:38:03,344 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-28 20:38:03,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18380 states. [2018-11-28 20:38:03,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18380 to 16341. [2018-11-28 20:38:03,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16341 states. [2018-11-28 20:38:04,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16341 states to 16341 states and 53832 transitions. [2018-11-28 20:38:04,049 INFO L78 Accepts]: Start accepts. Automaton has 16341 states and 53832 transitions. Word has length 56 [2018-11-28 20:38:04,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:38:04,049 INFO L480 AbstractCegarLoop]: Abstraction has 16341 states and 53832 transitions. [2018-11-28 20:38:04,049 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 20:38:04,049 INFO L276 IsEmpty]: Start isEmpty. Operand 16341 states and 53832 transitions. [2018-11-28 20:38:04,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-11-28 20:38:04,060 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:38:04,060 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] [2018-11-28 20:38:04,061 INFO L423 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:38:04,061 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:38:04,061 INFO L82 PathProgramCache]: Analyzing trace with hash -964654224, now seen corresponding path program 1 times [2018-11-28 20:38:04,061 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:38:04,061 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:38:04,064 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:38:04,064 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:38:04,064 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:38:04,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:38:04,292 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 20:38:04,292 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:38:04,293 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 20:38:04,293 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 20:38:04,293 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 20:38:04,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-28 20:38:04,294 INFO L87 Difference]: Start difference. First operand 16341 states and 53832 transitions. Second operand 6 states. [2018-11-28 20:38:04,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:38:04,925 INFO L93 Difference]: Finished difference Result 17857 states and 58003 transitions. [2018-11-28 20:38:04,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-28 20:38:04,926 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 56 [2018-11-28 20:38:04,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:38:04,960 INFO L225 Difference]: With dead ends: 17857 [2018-11-28 20:38:04,960 INFO L226 Difference]: Without dead ends: 17857 [2018-11-28 20:38:04,961 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 4 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-11-28 20:38:05,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17857 states. [2018-11-28 20:38:05,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17857 to 16903. [2018-11-28 20:38:05,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16903 states. [2018-11-28 20:38:05,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16903 states to 16903 states and 55361 transitions. [2018-11-28 20:38:05,270 INFO L78 Accepts]: Start accepts. Automaton has 16903 states and 55361 transitions. Word has length 56 [2018-11-28 20:38:05,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:38:05,270 INFO L480 AbstractCegarLoop]: Abstraction has 16903 states and 55361 transitions. [2018-11-28 20:38:05,270 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 20:38:05,270 INFO L276 IsEmpty]: Start isEmpty. Operand 16903 states and 55361 transitions. [2018-11-28 20:38:05,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-11-28 20:38:05,279 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:38:05,279 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] [2018-11-28 20:38:05,280 INFO L423 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:38:05,280 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:38:05,280 INFO L82 PathProgramCache]: Analyzing trace with hash -1258057231, now seen corresponding path program 1 times [2018-11-28 20:38:05,280 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:38:05,280 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:38:05,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:38:05,285 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:38:05,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:38:05,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:38:05,479 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 20:38:05,480 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:38:05,480 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 20:38:05,480 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 20:38:05,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 20:38:05,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-28 20:38:05,481 INFO L87 Difference]: Start difference. First operand 16903 states and 55361 transitions. Second operand 6 states. [2018-11-28 20:38:06,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:38:06,384 INFO L93 Difference]: Finished difference Result 23475 states and 75946 transitions. [2018-11-28 20:38:06,384 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-28 20:38:06,384 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 56 [2018-11-28 20:38:06,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:38:06,427 INFO L225 Difference]: With dead ends: 23475 [2018-11-28 20:38:06,427 INFO L226 Difference]: Without dead ends: 23443 [2018-11-28 20:38:06,427 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2018-11-28 20:38:06,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23443 states. [2018-11-28 20:38:06,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23443 to 18807. [2018-11-28 20:38:06,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18807 states. [2018-11-28 20:38:07,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18807 states to 18807 states and 61305 transitions. [2018-11-28 20:38:07,239 INFO L78 Accepts]: Start accepts. Automaton has 18807 states and 61305 transitions. Word has length 56 [2018-11-28 20:38:07,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:38:07,239 INFO L480 AbstractCegarLoop]: Abstraction has 18807 states and 61305 transitions. [2018-11-28 20:38:07,239 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 20:38:07,239 INFO L276 IsEmpty]: Start isEmpty. Operand 18807 states and 61305 transitions. [2018-11-28 20:38:07,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-11-28 20:38:07,264 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:38:07,265 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] [2018-11-28 20:38:07,265 INFO L423 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:38:07,265 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:38:07,265 INFO L82 PathProgramCache]: Analyzing trace with hash -2076609247, now seen corresponding path program 1 times [2018-11-28 20:38:07,266 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:38:07,266 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:38:07,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:38:07,268 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:38:07,268 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:38:07,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:38:07,756 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 20:38:07,756 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:38:07,757 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-28 20:38:07,757 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-28 20:38:07,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-28 20:38:07,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-28 20:38:07,758 INFO L87 Difference]: Start difference. First operand 18807 states and 61305 transitions. Second operand 7 states. [2018-11-28 20:38:08,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:38:08,701 INFO L93 Difference]: Finished difference Result 24535 states and 79153 transitions. [2018-11-28 20:38:08,703 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-28 20:38:08,703 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 70 [2018-11-28 20:38:08,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:38:08,755 INFO L225 Difference]: With dead ends: 24535 [2018-11-28 20:38:08,755 INFO L226 Difference]: Without dead ends: 24471 [2018-11-28 20:38:08,756 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=83, Invalid=259, Unknown=0, NotChecked=0, Total=342 [2018-11-28 20:38:08,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24471 states. [2018-11-28 20:38:09,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24471 to 20899. [2018-11-28 20:38:09,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20899 states. [2018-11-28 20:38:09,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20899 states to 20899 states and 67710 transitions. [2018-11-28 20:38:09,158 INFO L78 Accepts]: Start accepts. Automaton has 20899 states and 67710 transitions. Word has length 70 [2018-11-28 20:38:09,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:38:09,159 INFO L480 AbstractCegarLoop]: Abstraction has 20899 states and 67710 transitions. [2018-11-28 20:38:09,159 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-28 20:38:09,159 INFO L276 IsEmpty]: Start isEmpty. Operand 20899 states and 67710 transitions. [2018-11-28 20:38:09,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-11-28 20:38:09,186 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:38:09,186 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 20:38:09,186 INFO L423 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:38:09,186 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:38:09,186 INFO L82 PathProgramCache]: Analyzing trace with hash -1643744653, now seen corresponding path program 1 times [2018-11-28 20:38:09,187 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:38:09,187 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:38:09,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:38:09,188 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:38:09,189 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:38:09,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:38:09,282 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 20:38:09,282 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:38:09,283 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 20:38:09,283 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 20:38:09,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 20:38:09,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 20:38:09,283 INFO L87 Difference]: Start difference. First operand 20899 states and 67710 transitions. Second operand 3 states. [2018-11-28 20:38:09,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:38:09,673 INFO L93 Difference]: Finished difference Result 24947 states and 79522 transitions. [2018-11-28 20:38:09,674 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 20:38:09,674 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 72 [2018-11-28 20:38:09,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:38:09,721 INFO L225 Difference]: With dead ends: 24947 [2018-11-28 20:38:09,722 INFO L226 Difference]: Without dead ends: 24947 [2018-11-28 20:38:09,722 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 20:38:09,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24947 states. [2018-11-28 20:38:10,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24947 to 22467. [2018-11-28 20:38:10,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22467 states. [2018-11-28 20:38:10,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22467 states to 22467 states and 72190 transitions. [2018-11-28 20:38:10,103 INFO L78 Accepts]: Start accepts. Automaton has 22467 states and 72190 transitions. Word has length 72 [2018-11-28 20:38:10,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:38:10,103 INFO L480 AbstractCegarLoop]: Abstraction has 22467 states and 72190 transitions. [2018-11-28 20:38:10,103 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 20:38:10,104 INFO L276 IsEmpty]: Start isEmpty. Operand 22467 states and 72190 transitions. [2018-11-28 20:38:10,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-11-28 20:38:10,134 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:38:10,134 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] [2018-11-28 20:38:10,134 INFO L423 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:38:10,135 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:38:10,135 INFO L82 PathProgramCache]: Analyzing trace with hash -671189007, now seen corresponding path program 1 times [2018-11-28 20:38:10,135 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:38:10,135 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:38:10,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:38:10,137 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:38:10,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:38:10,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:38:10,386 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 20:38:10,387 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:38:10,387 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 20:38:10,387 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 20:38:10,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 20:38:10,387 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 20:38:10,388 INFO L87 Difference]: Start difference. First operand 22467 states and 72190 transitions. Second operand 4 states. [2018-11-28 20:38:11,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:38:11,103 INFO L93 Difference]: Finished difference Result 34667 states and 110116 transitions. [2018-11-28 20:38:11,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 20:38:11,104 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 76 [2018-11-28 20:38:11,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:38:11,169 INFO L225 Difference]: With dead ends: 34667 [2018-11-28 20:38:11,170 INFO L226 Difference]: Without dead ends: 34471 [2018-11-28 20:38:11,170 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-28 20:38:11,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34471 states. [2018-11-28 20:38:11,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34471 to 29099. [2018-11-28 20:38:11,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29099 states. [2018-11-28 20:38:11,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29099 states to 29099 states and 93336 transitions. [2018-11-28 20:38:11,792 INFO L78 Accepts]: Start accepts. Automaton has 29099 states and 93336 transitions. Word has length 76 [2018-11-28 20:38:11,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:38:11,793 INFO L480 AbstractCegarLoop]: Abstraction has 29099 states and 93336 transitions. [2018-11-28 20:38:11,793 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 20:38:11,793 INFO L276 IsEmpty]: Start isEmpty. Operand 29099 states and 93336 transitions. [2018-11-28 20:38:11,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-11-28 20:38:11,833 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:38:11,833 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] [2018-11-28 20:38:11,833 INFO L423 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:38:11,834 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:38:11,834 INFO L82 PathProgramCache]: Analyzing trace with hash 573575474, now seen corresponding path program 1 times [2018-11-28 20:38:11,834 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:38:11,834 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:38:11,836 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:38:11,836 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:38:11,836 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:38:11,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:38:12,129 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 20:38:12,130 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:38:12,130 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 20:38:12,130 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 20:38:12,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 20:38:12,131 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-11-28 20:38:12,131 INFO L87 Difference]: Start difference. First operand 29099 states and 93336 transitions. Second operand 6 states. [2018-11-28 20:38:13,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:38:13,600 INFO L93 Difference]: Finished difference Result 52152 states and 164833 transitions. [2018-11-28 20:38:13,601 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-28 20:38:13,601 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 76 [2018-11-28 20:38:13,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:38:13,704 INFO L225 Difference]: With dead ends: 52152 [2018-11-28 20:38:13,704 INFO L226 Difference]: Without dead ends: 51912 [2018-11-28 20:38:13,705 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2018-11-28 20:38:13,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51912 states. [2018-11-28 20:38:14,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51912 to 43712. [2018-11-28 20:38:14,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43712 states. [2018-11-28 20:38:14,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43712 states to 43712 states and 140003 transitions. [2018-11-28 20:38:14,458 INFO L78 Accepts]: Start accepts. Automaton has 43712 states and 140003 transitions. Word has length 76 [2018-11-28 20:38:14,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:38:14,458 INFO L480 AbstractCegarLoop]: Abstraction has 43712 states and 140003 transitions. [2018-11-28 20:38:14,458 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 20:38:14,459 INFO L276 IsEmpty]: Start isEmpty. Operand 43712 states and 140003 transitions. [2018-11-28 20:38:14,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-11-28 20:38:14,507 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:38:14,507 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] [2018-11-28 20:38:14,507 INFO L423 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:38:14,507 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:38:14,507 INFO L82 PathProgramCache]: Analyzing trace with hash -270896397, now seen corresponding path program 1 times [2018-11-28 20:38:14,508 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:38:14,508 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:38:14,509 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:38:14,509 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:38:14,510 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:38:14,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:38:14,628 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 20:38:14,628 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:38:14,629 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 20:38:14,629 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 20:38:14,629 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 20:38:14,629 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-28 20:38:14,630 INFO L87 Difference]: Start difference. First operand 43712 states and 140003 transitions. Second operand 5 states. [2018-11-28 20:38:14,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:38:14,674 INFO L93 Difference]: Finished difference Result 5456 states and 14431 transitions. [2018-11-28 20:38:14,675 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 20:38:14,675 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 76 [2018-11-28 20:38:14,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:38:14,681 INFO L225 Difference]: With dead ends: 5456 [2018-11-28 20:38:14,681 INFO L226 Difference]: Without dead ends: 4832 [2018-11-28 20:38:14,682 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-11-28 20:38:14,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4832 states. [2018-11-28 20:38:14,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4832 to 4684. [2018-11-28 20:38:14,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4684 states. [2018-11-28 20:38:14,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4684 states to 4684 states and 12409 transitions. [2018-11-28 20:38:14,731 INFO L78 Accepts]: Start accepts. Automaton has 4684 states and 12409 transitions. Word has length 76 [2018-11-28 20:38:14,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:38:14,732 INFO L480 AbstractCegarLoop]: Abstraction has 4684 states and 12409 transitions. [2018-11-28 20:38:14,732 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 20:38:14,732 INFO L276 IsEmpty]: Start isEmpty. Operand 4684 states and 12409 transitions. [2018-11-28 20:38:14,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-11-28 20:38:14,737 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:38:14,737 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] [2018-11-28 20:38:14,737 INFO L423 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:38:14,737 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:38:14,737 INFO L82 PathProgramCache]: Analyzing trace with hash -1415378869, now seen corresponding path program 1 times [2018-11-28 20:38:14,737 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:38:14,738 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:38:14,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:38:14,739 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:38:14,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:38:14,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:38:14,908 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 20:38:14,908 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:38:14,908 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 20:38:14,909 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 20:38:14,909 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 20:38:14,909 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 20:38:14,909 INFO L87 Difference]: Start difference. First operand 4684 states and 12409 transitions. Second operand 5 states. [2018-11-28 20:38:15,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:38:15,191 INFO L93 Difference]: Finished difference Result 5468 states and 14247 transitions. [2018-11-28 20:38:15,192 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-28 20:38:15,192 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 89 [2018-11-28 20:38:15,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:38:15,200 INFO L225 Difference]: With dead ends: 5468 [2018-11-28 20:38:15,201 INFO L226 Difference]: Without dead ends: 5440 [2018-11-28 20:38:15,201 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-11-28 20:38:15,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5440 states. [2018-11-28 20:38:15,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5440 to 5316. [2018-11-28 20:38:15,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5316 states. [2018-11-28 20:38:15,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5316 states to 5316 states and 13901 transitions. [2018-11-28 20:38:15,263 INFO L78 Accepts]: Start accepts. Automaton has 5316 states and 13901 transitions. Word has length 89 [2018-11-28 20:38:15,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:38:15,263 INFO L480 AbstractCegarLoop]: Abstraction has 5316 states and 13901 transitions. [2018-11-28 20:38:15,263 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 20:38:15,263 INFO L276 IsEmpty]: Start isEmpty. Operand 5316 states and 13901 transitions. [2018-11-28 20:38:15,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-11-28 20:38:15,271 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:38:15,271 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] [2018-11-28 20:38:15,271 INFO L423 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:38:15,272 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:38:15,272 INFO L82 PathProgramCache]: Analyzing trace with hash -282188276, now seen corresponding path program 1 times [2018-11-28 20:38:15,272 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:38:15,272 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:38:15,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:38:15,274 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:38:15,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:38:15,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:38:15,381 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 20:38:15,381 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:38:15,382 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 20:38:15,382 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 20:38:15,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 20:38:15,382 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 20:38:15,383 INFO L87 Difference]: Start difference. First operand 5316 states and 13901 transitions. Second operand 3 states. [2018-11-28 20:38:15,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:38:15,620 INFO L93 Difference]: Finished difference Result 5440 states and 14174 transitions. [2018-11-28 20:38:15,621 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 20:38:15,622 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 89 [2018-11-28 20:38:15,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:38:15,629 INFO L225 Difference]: With dead ends: 5440 [2018-11-28 20:38:15,629 INFO L226 Difference]: Without dead ends: 5440 [2018-11-28 20:38:15,630 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 20:38:15,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5440 states. [2018-11-28 20:38:15,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5440 to 5384. [2018-11-28 20:38:15,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5384 states. [2018-11-28 20:38:15,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5384 states to 5384 states and 14051 transitions. [2018-11-28 20:38:15,688 INFO L78 Accepts]: Start accepts. Automaton has 5384 states and 14051 transitions. Word has length 89 [2018-11-28 20:38:15,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:38:15,689 INFO L480 AbstractCegarLoop]: Abstraction has 5384 states and 14051 transitions. [2018-11-28 20:38:15,689 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 20:38:15,689 INFO L276 IsEmpty]: Start isEmpty. Operand 5384 states and 14051 transitions. [2018-11-28 20:38:15,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-11-28 20:38:15,696 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:38:15,696 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 20:38:15,696 INFO L423 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:38:15,697 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:38:15,697 INFO L82 PathProgramCache]: Analyzing trace with hash -203880528, now seen corresponding path program 1 times [2018-11-28 20:38:15,697 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:38:15,697 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:38:15,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:38:15,699 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:38:15,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:38:15,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:38:15,821 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 20:38:15,821 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:38:15,821 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 20:38:15,821 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 20:38:15,822 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 20:38:15,822 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-28 20:38:15,822 INFO L87 Difference]: Start difference. First operand 5384 states and 14051 transitions. Second operand 4 states. [2018-11-28 20:38:15,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:38:15,981 INFO L93 Difference]: Finished difference Result 9734 states and 25760 transitions. [2018-11-28 20:38:15,982 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 20:38:15,982 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 91 [2018-11-28 20:38:15,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:38:15,996 INFO L225 Difference]: With dead ends: 9734 [2018-11-28 20:38:15,996 INFO L226 Difference]: Without dead ends: 9706 [2018-11-28 20:38:15,997 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-28 20:38:16,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9706 states. [2018-11-28 20:38:16,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9706 to 5140. [2018-11-28 20:38:16,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5140 states. [2018-11-28 20:38:16,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5140 states to 5140 states and 13376 transitions. [2018-11-28 20:38:16,071 INFO L78 Accepts]: Start accepts. Automaton has 5140 states and 13376 transitions. Word has length 91 [2018-11-28 20:38:16,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:38:16,071 INFO L480 AbstractCegarLoop]: Abstraction has 5140 states and 13376 transitions. [2018-11-28 20:38:16,071 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 20:38:16,071 INFO L276 IsEmpty]: Start isEmpty. Operand 5140 states and 13376 transitions. [2018-11-28 20:38:16,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-11-28 20:38:16,076 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:38:16,077 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] [2018-11-28 20:38:16,077 INFO L423 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:38:16,077 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:38:16,077 INFO L82 PathProgramCache]: Analyzing trace with hash -1904621007, now seen corresponding path program 1 times [2018-11-28 20:38:16,077 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:38:16,077 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:38:16,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:38:16,079 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:38:16,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:38:16,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:38:16,237 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 20:38:16,237 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:38:16,237 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 20:38:16,238 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 20:38:16,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 20:38:16,238 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-28 20:38:16,238 INFO L87 Difference]: Start difference. First operand 5140 states and 13376 transitions. Second operand 6 states. [2018-11-28 20:38:16,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:38:16,606 INFO L93 Difference]: Finished difference Result 5643 states and 14543 transitions. [2018-11-28 20:38:16,607 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 20:38:16,607 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 91 [2018-11-28 20:38:16,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:38:16,615 INFO L225 Difference]: With dead ends: 5643 [2018-11-28 20:38:16,615 INFO L226 Difference]: Without dead ends: 5643 [2018-11-28 20:38:16,616 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-28 20:38:16,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5643 states. [2018-11-28 20:38:16,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5643 to 5222. [2018-11-28 20:38:16,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5222 states. [2018-11-28 20:38:16,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5222 states to 5222 states and 13576 transitions. [2018-11-28 20:38:16,676 INFO L78 Accepts]: Start accepts. Automaton has 5222 states and 13576 transitions. Word has length 91 [2018-11-28 20:38:16,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:38:16,676 INFO L480 AbstractCegarLoop]: Abstraction has 5222 states and 13576 transitions. [2018-11-28 20:38:16,676 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 20:38:16,676 INFO L276 IsEmpty]: Start isEmpty. Operand 5222 states and 13576 transitions. [2018-11-28 20:38:16,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-11-28 20:38:16,683 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:38:16,684 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] [2018-11-28 20:38:16,684 INFO L423 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:38:16,684 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:38:16,684 INFO L82 PathProgramCache]: Analyzing trace with hash -935039984, now seen corresponding path program 1 times [2018-11-28 20:38:16,684 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:38:16,684 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:38:16,686 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:38:16,686 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:38:16,686 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:38:16,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:38:17,011 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 20:38:17,011 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:38:17,011 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-28 20:38:17,012 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-28 20:38:17,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-28 20:38:17,012 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-11-28 20:38:17,012 INFO L87 Difference]: Start difference. First operand 5222 states and 13576 transitions. Second operand 7 states. [2018-11-28 20:38:17,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:38:17,580 INFO L93 Difference]: Finished difference Result 5203 states and 13406 transitions. [2018-11-28 20:38:17,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-28 20:38:17,581 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 91 [2018-11-28 20:38:17,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:38:17,587 INFO L225 Difference]: With dead ends: 5203 [2018-11-28 20:38:17,587 INFO L226 Difference]: Without dead ends: 5178 [2018-11-28 20:38:17,587 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2018-11-28 20:38:17,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5178 states. [2018-11-28 20:38:17,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5178 to 4801. [2018-11-28 20:38:17,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4801 states. [2018-11-28 20:38:17,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4801 states to 4801 states and 12542 transitions. [2018-11-28 20:38:17,640 INFO L78 Accepts]: Start accepts. Automaton has 4801 states and 12542 transitions. Word has length 91 [2018-11-28 20:38:17,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:38:17,640 INFO L480 AbstractCegarLoop]: Abstraction has 4801 states and 12542 transitions. [2018-11-28 20:38:17,640 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-28 20:38:17,640 INFO L276 IsEmpty]: Start isEmpty. Operand 4801 states and 12542 transitions. [2018-11-28 20:38:17,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-11-28 20:38:17,646 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:38:17,646 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] [2018-11-28 20:38:17,646 INFO L423 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:38:17,646 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:38:17,646 INFO L82 PathProgramCache]: Analyzing trace with hash -359042702, now seen corresponding path program 2 times [2018-11-28 20:38:17,647 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:38:17,647 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:38:17,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:38:17,648 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:38:17,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:38:17,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:38:17,827 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 20:38:17,827 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:38:17,827 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-28 20:38:17,828 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-28 20:38:17,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-28 20:38:17,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2018-11-28 20:38:17,828 INFO L87 Difference]: Start difference. First operand 4801 states and 12542 transitions. Second operand 7 states. [2018-11-28 20:38:18,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:38:18,119 INFO L93 Difference]: Finished difference Result 5254 states and 13455 transitions. [2018-11-28 20:38:18,120 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-28 20:38:18,120 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 91 [2018-11-28 20:38:18,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:38:18,128 INFO L225 Difference]: With dead ends: 5254 [2018-11-28 20:38:18,128 INFO L226 Difference]: Without dead ends: 5254 [2018-11-28 20:38:18,129 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=81, Unknown=0, NotChecked=0, Total=132 [2018-11-28 20:38:18,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5254 states. [2018-11-28 20:38:18,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5254 to 5000. [2018-11-28 20:38:18,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5000 states. [2018-11-28 20:38:18,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5000 states to 5000 states and 12931 transitions. [2018-11-28 20:38:18,193 INFO L78 Accepts]: Start accepts. Automaton has 5000 states and 12931 transitions. Word has length 91 [2018-11-28 20:38:18,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:38:18,193 INFO L480 AbstractCegarLoop]: Abstraction has 5000 states and 12931 transitions. [2018-11-28 20:38:18,193 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-28 20:38:18,193 INFO L276 IsEmpty]: Start isEmpty. Operand 5000 states and 12931 transitions. [2018-11-28 20:38:18,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-11-28 20:38:18,199 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:38:18,200 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 20:38:18,200 INFO L423 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:38:18,200 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:38:18,200 INFO L82 PathProgramCache]: Analyzing trace with hash -234969455, now seen corresponding path program 1 times [2018-11-28 20:38:18,200 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:38:18,200 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:38:18,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:38:18,202 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 20:38:18,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:38:18,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:38:18,653 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 20:38:18,653 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:38:18,653 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 20:38:18,654 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 20:38:18,654 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 20:38:18,654 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-28 20:38:18,654 INFO L87 Difference]: Start difference. First operand 5000 states and 12931 transitions. Second operand 6 states. [2018-11-28 20:38:18,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:38:18,945 INFO L93 Difference]: Finished difference Result 4465 states and 11620 transitions. [2018-11-28 20:38:18,946 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-28 20:38:18,946 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 91 [2018-11-28 20:38:18,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:38:18,953 INFO L225 Difference]: With dead ends: 4465 [2018-11-28 20:38:18,953 INFO L226 Difference]: Without dead ends: 4465 [2018-11-28 20:38:18,954 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-11-28 20:38:18,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4465 states. [2018-11-28 20:38:19,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4465 to 4329. [2018-11-28 20:38:19,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4329 states. [2018-11-28 20:38:19,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4329 states to 4329 states and 11320 transitions. [2018-11-28 20:38:19,037 INFO L78 Accepts]: Start accepts. Automaton has 4329 states and 11320 transitions. Word has length 91 [2018-11-28 20:38:19,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:38:19,038 INFO L480 AbstractCegarLoop]: Abstraction has 4329 states and 11320 transitions. [2018-11-28 20:38:19,038 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 20:38:19,038 INFO L276 IsEmpty]: Start isEmpty. Operand 4329 states and 11320 transitions. [2018-11-28 20:38:19,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-11-28 20:38:19,043 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:38:19,043 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] [2018-11-28 20:38:19,044 INFO L423 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:38:19,044 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:38:19,044 INFO L82 PathProgramCache]: Analyzing trace with hash -82841607, now seen corresponding path program 1 times [2018-11-28 20:38:19,044 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:38:19,044 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:38:19,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:38:19,046 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:38:19,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:38:19,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:38:19,636 WARN L180 SmtUtils]: Spent 288.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 10 [2018-11-28 20:38:19,802 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 20:38:19,802 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:38:19,802 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 20:38:19,804 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 20:38:19,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 20:38:19,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-11-28 20:38:19,805 INFO L87 Difference]: Start difference. First operand 4329 states and 11320 transitions. Second operand 6 states. [2018-11-28 20:38:20,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:38:20,906 INFO L93 Difference]: Finished difference Result 5842 states and 14969 transitions. [2018-11-28 20:38:20,907 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 20:38:20,907 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 91 [2018-11-28 20:38:20,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:38:20,916 INFO L225 Difference]: With dead ends: 5842 [2018-11-28 20:38:20,916 INFO L226 Difference]: Without dead ends: 5810 [2018-11-28 20:38:20,916 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-11-28 20:38:20,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5810 states. [2018-11-28 20:38:20,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5810 to 4662. [2018-11-28 20:38:20,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4662 states. [2018-11-28 20:38:20,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4662 states to 4662 states and 12102 transitions. [2018-11-28 20:38:20,980 INFO L78 Accepts]: Start accepts. Automaton has 4662 states and 12102 transitions. Word has length 91 [2018-11-28 20:38:20,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:38:20,980 INFO L480 AbstractCegarLoop]: Abstraction has 4662 states and 12102 transitions. [2018-11-28 20:38:20,981 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 20:38:20,981 INFO L276 IsEmpty]: Start isEmpty. Operand 4662 states and 12102 transitions. [2018-11-28 20:38:20,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-11-28 20:38:20,987 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:38:20,987 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] [2018-11-28 20:38:20,987 INFO L423 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:38:20,987 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:38:20,988 INFO L82 PathProgramCache]: Analyzing trace with hash -365992071, now seen corresponding path program 1 times [2018-11-28 20:38:20,988 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:38:20,988 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:38:20,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:38:20,990 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:38:20,990 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:38:21,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:38:21,103 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 20:38:21,103 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:38:21,104 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-28 20:38:21,104 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-28 20:38:21,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-28 20:38:21,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-11-28 20:38:21,105 INFO L87 Difference]: Start difference. First operand 4662 states and 12102 transitions. Second operand 7 states. [2018-11-28 20:38:21,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:38:21,568 INFO L93 Difference]: Finished difference Result 8422 states and 22444 transitions. [2018-11-28 20:38:21,569 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-28 20:38:21,569 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 91 [2018-11-28 20:38:21,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:38:21,581 INFO L225 Difference]: With dead ends: 8422 [2018-11-28 20:38:21,581 INFO L226 Difference]: Without dead ends: 8422 [2018-11-28 20:38:21,581 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2018-11-28 20:38:21,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8422 states. [2018-11-28 20:38:21,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8422 to 5098. [2018-11-28 20:38:21,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5098 states. [2018-11-28 20:38:21,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5098 states to 5098 states and 13248 transitions. [2018-11-28 20:38:21,658 INFO L78 Accepts]: Start accepts. Automaton has 5098 states and 13248 transitions. Word has length 91 [2018-11-28 20:38:21,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:38:21,659 INFO L480 AbstractCegarLoop]: Abstraction has 5098 states and 13248 transitions. [2018-11-28 20:38:21,659 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-28 20:38:21,659 INFO L276 IsEmpty]: Start isEmpty. Operand 5098 states and 13248 transitions. [2018-11-28 20:38:21,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-11-28 20:38:21,665 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:38:21,665 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] [2018-11-28 20:38:21,665 INFO L423 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:38:21,665 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:38:21,665 INFO L82 PathProgramCache]: Analyzing trace with hash 878772410, now seen corresponding path program 1 times [2018-11-28 20:38:21,666 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:38:21,666 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:38:21,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:38:21,668 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:38:21,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:38:21,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:38:21,958 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 20:38:21,958 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:38:21,959 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 20:38:21,959 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 20:38:21,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 20:38:21,959 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-28 20:38:21,961 INFO L87 Difference]: Start difference. First operand 5098 states and 13248 transitions. Second operand 6 states. [2018-11-28 20:38:22,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:38:22,042 INFO L93 Difference]: Finished difference Result 7868 states and 20976 transitions. [2018-11-28 20:38:22,042 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 20:38:22,042 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 91 [2018-11-28 20:38:22,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:38:22,057 INFO L225 Difference]: With dead ends: 7868 [2018-11-28 20:38:22,057 INFO L226 Difference]: Without dead ends: 7868 [2018-11-28 20:38:22,058 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-28 20:38:22,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7868 states. [2018-11-28 20:38:22,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7868 to 4778. [2018-11-28 20:38:22,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4778 states. [2018-11-28 20:38:22,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4778 states to 4778 states and 12390 transitions. [2018-11-28 20:38:22,130 INFO L78 Accepts]: Start accepts. Automaton has 4778 states and 12390 transitions. Word has length 91 [2018-11-28 20:38:22,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:38:22,130 INFO L480 AbstractCegarLoop]: Abstraction has 4778 states and 12390 transitions. [2018-11-28 20:38:22,130 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 20:38:22,130 INFO L276 IsEmpty]: Start isEmpty. Operand 4778 states and 12390 transitions. [2018-11-28 20:38:22,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-11-28 20:38:22,136 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:38:22,136 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] [2018-11-28 20:38:22,136 INFO L423 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:38:22,136 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:38:22,138 INFO L82 PathProgramCache]: Analyzing trace with hash 1359488826, now seen corresponding path program 1 times [2018-11-28 20:38:22,138 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:38:22,139 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:38:22,140 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:38:22,140 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:38:22,141 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:38:22,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:38:22,419 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 20:38:22,419 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:38:22,419 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 20:38:22,420 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 20:38:22,420 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 20:38:22,420 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-28 20:38:22,420 INFO L87 Difference]: Start difference. First operand 4778 states and 12390 transitions. Second operand 6 states. [2018-11-28 20:38:22,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:38:22,664 INFO L93 Difference]: Finished difference Result 4138 states and 10518 transitions. [2018-11-28 20:38:22,665 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 20:38:22,665 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 91 [2018-11-28 20:38:22,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:38:22,672 INFO L225 Difference]: With dead ends: 4138 [2018-11-28 20:38:22,672 INFO L226 Difference]: Without dead ends: 4138 [2018-11-28 20:38:22,673 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-11-28 20:38:22,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4138 states. [2018-11-28 20:38:22,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4138 to 3539. [2018-11-28 20:38:22,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3539 states. [2018-11-28 20:38:22,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3539 states to 3539 states and 9138 transitions. [2018-11-28 20:38:22,715 INFO L78 Accepts]: Start accepts. Automaton has 3539 states and 9138 transitions. Word has length 91 [2018-11-28 20:38:22,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:38:22,715 INFO L480 AbstractCegarLoop]: Abstraction has 3539 states and 9138 transitions. [2018-11-28 20:38:22,715 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 20:38:22,715 INFO L276 IsEmpty]: Start isEmpty. Operand 3539 states and 9138 transitions. [2018-11-28 20:38:22,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-11-28 20:38:22,720 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:38:22,720 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 20:38:22,720 INFO L423 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:38:22,720 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:38:22,720 INFO L82 PathProgramCache]: Analyzing trace with hash 1413527866, now seen corresponding path program 1 times [2018-11-28 20:38:22,721 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:38:22,721 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:38:22,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:38:22,722 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:38:22,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:38:22,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:38:23,055 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 20:38:23,055 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:38:23,056 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 20:38:23,056 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 20:38:23,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 20:38:23,056 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-28 20:38:23,057 INFO L87 Difference]: Start difference. First operand 3539 states and 9138 transitions. Second operand 6 states. [2018-11-28 20:38:24,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:38:24,109 INFO L93 Difference]: Finished difference Result 3752 states and 9543 transitions. [2018-11-28 20:38:24,110 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 20:38:24,110 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 93 [2018-11-28 20:38:24,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:38:24,117 INFO L225 Difference]: With dead ends: 3752 [2018-11-28 20:38:24,118 INFO L226 Difference]: Without dead ends: 3707 [2018-11-28 20:38:24,119 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-11-28 20:38:24,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3707 states. [2018-11-28 20:38:24,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3707 to 3647. [2018-11-28 20:38:24,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3647 states. [2018-11-28 20:38:24,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3647 states to 3647 states and 9343 transitions. [2018-11-28 20:38:24,177 INFO L78 Accepts]: Start accepts. Automaton has 3647 states and 9343 transitions. Word has length 93 [2018-11-28 20:38:24,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:38:24,177 INFO L480 AbstractCegarLoop]: Abstraction has 3647 states and 9343 transitions. [2018-11-28 20:38:24,177 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 20:38:24,177 INFO L276 IsEmpty]: Start isEmpty. Operand 3647 states and 9343 transitions. [2018-11-28 20:38:24,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-11-28 20:38:24,184 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:38:24,184 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 20:38:24,185 INFO L423 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:38:24,185 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:38:24,185 INFO L82 PathProgramCache]: Analyzing trace with hash -522132421, now seen corresponding path program 1 times [2018-11-28 20:38:24,185 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:38:24,187 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:38:24,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:38:24,190 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:38:24,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:38:24,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:38:24,781 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 20:38:24,781 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:38:24,781 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-28 20:38:24,783 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-28 20:38:24,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-28 20:38:24,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-28 20:38:24,783 INFO L87 Difference]: Start difference. First operand 3647 states and 9343 transitions. Second operand 7 states. [2018-11-28 20:38:25,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:38:25,332 INFO L93 Difference]: Finished difference Result 5475 states and 13755 transitions. [2018-11-28 20:38:25,334 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-28 20:38:25,334 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 93 [2018-11-28 20:38:25,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:38:25,342 INFO L225 Difference]: With dead ends: 5475 [2018-11-28 20:38:25,342 INFO L226 Difference]: Without dead ends: 5443 [2018-11-28 20:38:25,342 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2018-11-28 20:38:25,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5443 states. [2018-11-28 20:38:25,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5443 to 4208. [2018-11-28 20:38:25,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4208 states. [2018-11-28 20:38:25,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4208 states to 4208 states and 10724 transitions. [2018-11-28 20:38:25,398 INFO L78 Accepts]: Start accepts. Automaton has 4208 states and 10724 transitions. Word has length 93 [2018-11-28 20:38:25,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:38:25,398 INFO L480 AbstractCegarLoop]: Abstraction has 4208 states and 10724 transitions. [2018-11-28 20:38:25,399 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-28 20:38:25,399 INFO L276 IsEmpty]: Start isEmpty. Operand 4208 states and 10724 transitions. [2018-11-28 20:38:25,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-11-28 20:38:25,403 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:38:25,404 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] [2018-11-28 20:38:25,404 INFO L423 AbstractCegarLoop]: === Iteration 26 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:38:25,404 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:38:25,404 INFO L82 PathProgramCache]: Analyzing trace with hash 722632060, now seen corresponding path program 1 times [2018-11-28 20:38:25,404 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:38:25,405 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:38:25,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:38:25,406 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:38:25,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:38:25,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:38:25,590 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 20:38:25,591 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:38:25,591 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 20:38:25,591 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 20:38:25,591 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 20:38:25,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-28 20:38:25,592 INFO L87 Difference]: Start difference. First operand 4208 states and 10724 transitions. Second operand 6 states. [2018-11-28 20:38:25,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:38:25,740 INFO L93 Difference]: Finished difference Result 4061 states and 10272 transitions. [2018-11-28 20:38:25,741 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-28 20:38:25,741 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 93 [2018-11-28 20:38:25,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:38:25,746 INFO L225 Difference]: With dead ends: 4061 [2018-11-28 20:38:25,746 INFO L226 Difference]: Without dead ends: 4061 [2018-11-28 20:38:25,747 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2018-11-28 20:38:25,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4061 states. [2018-11-28 20:38:25,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4061 to 3919. [2018-11-28 20:38:25,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3919 states. [2018-11-28 20:38:25,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3919 states to 3919 states and 10003 transitions. [2018-11-28 20:38:25,792 INFO L78 Accepts]: Start accepts. Automaton has 3919 states and 10003 transitions. Word has length 93 [2018-11-28 20:38:25,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:38:25,792 INFO L480 AbstractCegarLoop]: Abstraction has 3919 states and 10003 transitions. [2018-11-28 20:38:25,792 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 20:38:25,792 INFO L276 IsEmpty]: Start isEmpty. Operand 3919 states and 10003 transitions. [2018-11-28 20:38:25,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-11-28 20:38:25,797 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:38:25,797 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] [2018-11-28 20:38:25,797 INFO L423 AbstractCegarLoop]: === Iteration 27 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:38:25,797 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:38:25,797 INFO L82 PathProgramCache]: Analyzing trace with hash -192366660, now seen corresponding path program 1 times [2018-11-28 20:38:25,798 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:38:25,798 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:38:25,799 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:38:25,799 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:38:25,799 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:38:25,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:38:25,935 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 20:38:25,936 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:38:25,936 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 20:38:25,936 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 20:38:25,936 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 20:38:25,936 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 20:38:25,937 INFO L87 Difference]: Start difference. First operand 3919 states and 10003 transitions. Second operand 5 states. [2018-11-28 20:38:26,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:38:26,143 INFO L93 Difference]: Finished difference Result 4463 states and 11347 transitions. [2018-11-28 20:38:26,144 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 20:38:26,144 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 93 [2018-11-28 20:38:26,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:38:26,151 INFO L225 Difference]: With dead ends: 4463 [2018-11-28 20:38:26,151 INFO L226 Difference]: Without dead ends: 4431 [2018-11-28 20:38:26,151 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-11-28 20:38:26,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4431 states. [2018-11-28 20:38:26,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4431 to 3678. [2018-11-28 20:38:26,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3678 states. [2018-11-28 20:38:26,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3678 states to 3678 states and 9382 transitions. [2018-11-28 20:38:26,197 INFO L78 Accepts]: Start accepts. Automaton has 3678 states and 9382 transitions. Word has length 93 [2018-11-28 20:38:26,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:38:26,198 INFO L480 AbstractCegarLoop]: Abstraction has 3678 states and 9382 transitions. [2018-11-28 20:38:26,198 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 20:38:26,198 INFO L276 IsEmpty]: Start isEmpty. Operand 3678 states and 9382 transitions. [2018-11-28 20:38:26,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-11-28 20:38:26,202 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:38:26,202 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] [2018-11-28 20:38:26,202 INFO L423 AbstractCegarLoop]: === Iteration 28 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:38:26,203 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:38:26,203 INFO L82 PathProgramCache]: Analyzing trace with hash 1052397821, now seen corresponding path program 1 times [2018-11-28 20:38:26,203 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:38:26,203 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:38:26,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:38:26,204 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:38:26,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:38:26,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:38:26,375 WARN L180 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-11-28 20:38:26,408 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 20:38:26,408 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:38:26,409 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-28 20:38:26,409 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-28 20:38:26,409 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-28 20:38:26,409 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-28 20:38:26,410 INFO L87 Difference]: Start difference. First operand 3678 states and 9382 transitions. Second operand 7 states. [2018-11-28 20:38:26,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:38:26,710 INFO L93 Difference]: Finished difference Result 5538 states and 14274 transitions. [2018-11-28 20:38:26,711 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-28 20:38:26,711 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 93 [2018-11-28 20:38:26,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:38:26,715 INFO L225 Difference]: With dead ends: 5538 [2018-11-28 20:38:26,715 INFO L226 Difference]: Without dead ends: 2009 [2018-11-28 20:38:26,715 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2018-11-28 20:38:26,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2009 states. [2018-11-28 20:38:26,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2009 to 2009. [2018-11-28 20:38:26,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2009 states. [2018-11-28 20:38:26,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2009 states to 2009 states and 5170 transitions. [2018-11-28 20:38:26,736 INFO L78 Accepts]: Start accepts. Automaton has 2009 states and 5170 transitions. Word has length 93 [2018-11-28 20:38:26,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:38:26,736 INFO L480 AbstractCegarLoop]: Abstraction has 2009 states and 5170 transitions. [2018-11-28 20:38:26,736 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-28 20:38:26,736 INFO L276 IsEmpty]: Start isEmpty. Operand 2009 states and 5170 transitions. [2018-11-28 20:38:26,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-11-28 20:38:26,739 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:38:26,739 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] [2018-11-28 20:38:26,739 INFO L423 AbstractCegarLoop]: === Iteration 29 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:38:26,739 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:38:26,739 INFO L82 PathProgramCache]: Analyzing trace with hash -1042938802, now seen corresponding path program 1 times [2018-11-28 20:38:26,739 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:38:26,740 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:38:26,741 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:38:26,741 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:38:26,741 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:38:26,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:38:26,891 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 20:38:26,891 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:38:26,892 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-28 20:38:26,892 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-28 20:38:26,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-28 20:38:26,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-11-28 20:38:26,892 INFO L87 Difference]: Start difference. First operand 2009 states and 5170 transitions. Second operand 7 states. [2018-11-28 20:38:27,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:38:27,220 INFO L93 Difference]: Finished difference Result 2023 states and 5202 transitions. [2018-11-28 20:38:27,221 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 20:38:27,222 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 93 [2018-11-28 20:38:27,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:38:27,225 INFO L225 Difference]: With dead ends: 2023 [2018-11-28 20:38:27,225 INFO L226 Difference]: Without dead ends: 2023 [2018-11-28 20:38:27,225 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-11-28 20:38:27,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2023 states. [2018-11-28 20:38:27,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2023 to 1985. [2018-11-28 20:38:27,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1985 states. [2018-11-28 20:38:27,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1985 states to 1985 states and 5122 transitions. [2018-11-28 20:38:27,248 INFO L78 Accepts]: Start accepts. Automaton has 1985 states and 5122 transitions. Word has length 93 [2018-11-28 20:38:27,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:38:27,248 INFO L480 AbstractCegarLoop]: Abstraction has 1985 states and 5122 transitions. [2018-11-28 20:38:27,248 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-28 20:38:27,248 INFO L276 IsEmpty]: Start isEmpty. Operand 1985 states and 5122 transitions. [2018-11-28 20:38:27,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-11-28 20:38:27,251 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:38:27,251 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] [2018-11-28 20:38:27,251 INFO L423 AbstractCegarLoop]: === Iteration 30 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:38:27,251 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:38:27,252 INFO L82 PathProgramCache]: Analyzing trace with hash 1157749772, now seen corresponding path program 2 times [2018-11-28 20:38:27,252 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:38:27,252 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:38:27,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:38:27,253 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:38:27,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:38:27,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:38:27,765 WARN L180 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-11-28 20:38:28,140 WARN L180 SmtUtils]: Spent 246.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 15 [2018-11-28 20:38:28,361 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 20:38:28,362 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:38:28,362 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-28 20:38:28,362 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-28 20:38:28,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-28 20:38:28,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-11-28 20:38:28,363 INFO L87 Difference]: Start difference. First operand 1985 states and 5122 transitions. Second operand 8 states. [2018-11-28 20:38:28,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:38:28,853 INFO L93 Difference]: Finished difference Result 2330 states and 5862 transitions. [2018-11-28 20:38:28,854 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-28 20:38:28,854 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 93 [2018-11-28 20:38:28,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:38:28,858 INFO L225 Difference]: With dead ends: 2330 [2018-11-28 20:38:28,858 INFO L226 Difference]: Without dead ends: 2301 [2018-11-28 20:38:28,859 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2018-11-28 20:38:28,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2301 states. [2018-11-28 20:38:28,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2301 to 1977. [2018-11-28 20:38:28,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1977 states. [2018-11-28 20:38:28,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1977 states to 1977 states and 5096 transitions. [2018-11-28 20:38:28,884 INFO L78 Accepts]: Start accepts. Automaton has 1977 states and 5096 transitions. Word has length 93 [2018-11-28 20:38:28,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:38:28,884 INFO L480 AbstractCegarLoop]: Abstraction has 1977 states and 5096 transitions. [2018-11-28 20:38:28,884 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-28 20:38:28,884 INFO L276 IsEmpty]: Start isEmpty. Operand 1977 states and 5096 transitions. [2018-11-28 20:38:28,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-11-28 20:38:28,887 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:38:28,887 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] [2018-11-28 20:38:28,887 INFO L423 AbstractCegarLoop]: === Iteration 31 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:38:28,887 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:38:28,887 INFO L82 PathProgramCache]: Analyzing trace with hash -777910515, now seen corresponding path program 2 times [2018-11-28 20:38:28,887 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:38:28,888 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:38:28,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:38:28,889 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 20:38:28,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:38:28,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:38:29,064 WARN L180 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-11-28 20:38:29,145 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 20:38:29,145 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:38:29,146 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-11-28 20:38:29,146 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-28 20:38:29,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-28 20:38:29,146 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-11-28 20:38:29,147 INFO L87 Difference]: Start difference. First operand 1977 states and 5096 transitions. Second operand 12 states. [2018-11-28 20:38:29,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:38:29,735 INFO L93 Difference]: Finished difference Result 3769 states and 9808 transitions. [2018-11-28 20:38:29,736 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-11-28 20:38:29,736 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 93 [2018-11-28 20:38:29,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:38:29,740 INFO L225 Difference]: With dead ends: 3769 [2018-11-28 20:38:29,740 INFO L226 Difference]: Without dead ends: 2633 [2018-11-28 20:38:29,741 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=100, Invalid=550, Unknown=0, NotChecked=0, Total=650 [2018-11-28 20:38:29,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2633 states. [2018-11-28 20:38:29,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2633 to 2481. [2018-11-28 20:38:29,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2481 states. [2018-11-28 20:38:29,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2481 states to 2481 states and 6234 transitions. [2018-11-28 20:38:29,768 INFO L78 Accepts]: Start accepts. Automaton has 2481 states and 6234 transitions. Word has length 93 [2018-11-28 20:38:29,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:38:29,769 INFO L480 AbstractCegarLoop]: Abstraction has 2481 states and 6234 transitions. [2018-11-28 20:38:29,769 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-28 20:38:29,769 INFO L276 IsEmpty]: Start isEmpty. Operand 2481 states and 6234 transitions. [2018-11-28 20:38:29,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-11-28 20:38:29,772 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:38:29,772 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] [2018-11-28 20:38:29,772 INFO L423 AbstractCegarLoop]: === Iteration 32 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:38:29,772 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:38:29,773 INFO L82 PathProgramCache]: Analyzing trace with hash 45507955, now seen corresponding path program 3 times [2018-11-28 20:38:29,773 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:38:29,773 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:38:29,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:38:29,774 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 20:38:29,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:38:29,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 20:38:29,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 20:38:29,857 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-11-28 20:38:30,022 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-11-28 20:38:30,025 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 08:38:30 BasicIcfg [2018-11-28 20:38:30,025 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-28 20:38:30,026 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-28 20:38:30,026 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-28 20:38:30,026 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-28 20:38:30,026 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 08:37:48" (3/4) ... [2018-11-28 20:38:30,032 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-11-28 20:38:30,191 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2018-11-28 20:38:30,192 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-28 20:38:30,195 INFO L168 Benchmark]: Toolchain (without parser) took 43562.04 ms. Allocated memory was 1.0 GB in the beginning and 3.0 GB in the end (delta: 2.0 GB). Free memory was 947.3 MB in the beginning and 1.2 GB in the end (delta: -248.1 MB). Peak memory consumption was 1.7 GB. Max. memory is 11.5 GB. [2018-11-28 20:38:30,196 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 20:38:30,196 INFO L168 Benchmark]: CACSL2BoogieTranslator took 959.08 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 98.6 MB). Free memory was 941.9 MB in the beginning and 1.1 GB in the end (delta: -129.7 MB). Peak memory consumption was 25.7 MB. Max. memory is 11.5 GB. [2018-11-28 20:38:30,198 INFO L168 Benchmark]: Boogie Procedure Inliner took 87.86 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: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 11.5 GB. [2018-11-28 20:38:30,198 INFO L168 Benchmark]: Boogie Preprocessor took 46.83 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. [2018-11-28 20:38:30,199 INFO L168 Benchmark]: RCFGBuilder took 1257.89 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: 46.5 MB). Peak memory consumption was 46.5 MB. Max. memory is 11.5 GB. [2018-11-28 20:38:30,199 INFO L168 Benchmark]: TraceAbstraction took 41035.86 ms. Allocated memory was 1.1 GB in the beginning and 3.0 GB in the end (delta: 1.9 GB). Free memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: -177.2 MB). Peak memory consumption was 1.7 GB. Max. memory is 11.5 GB. [2018-11-28 20:38:30,199 INFO L168 Benchmark]: Witness Printer took 166.26 ms. Allocated memory is still 3.0 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 20:38:30,204 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.20 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 959.08 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 98.6 MB). Free memory was 941.9 MB in the beginning and 1.1 GB in the end (delta: -129.7 MB). Peak memory consumption was 25.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 87.86 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: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 46.83 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 1257.89 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: 46.5 MB). Peak memory consumption was 46.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 41035.86 ms. Allocated memory was 1.1 GB in the beginning and 3.0 GB in the end (delta: 1.9 GB). Free memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: -177.2 MB). Peak memory consumption was 1.7 GB. Max. memory is 11.5 GB. * Witness Printer took 166.26 ms. Allocated memory is still 3.0 GB. Free memory is still 1.2 GB. There was no memory consumed. 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] [L672] -1 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0] [L673] -1 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0] [L675] -1 int x = 0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L677] -1 int y = 0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L678] -1 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L679] -1 int y$mem_tmp; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L680] -1 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0] [L681] -1 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0] [L682] -1 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0] [L683] -1 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0] [L684] -1 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0] [L685] -1 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0] [L686] -1 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0] [L687] -1 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}] [L688] -1 int y$w_buff0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0] [L689] -1 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0] [L690] -1 int y$w_buff1; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0] [L691] -1 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L692] -1 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L693] -1 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L753] -1 pthread_t t2479; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L754] FCALL, FORK -1 pthread_create(&t2479, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L755] -1 pthread_t t2480; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L756] FCALL, FORK -1 pthread_create(&t2480, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L697] 0 y$w_buff1 = y$w_buff0 [L698] 0 y$w_buff0 = 2 [L699] 0 y$w_buff1_used = y$w_buff0_used [L700] 0 y$w_buff0_used = (_Bool)1 [L4] COND FALSE 0 !(!expression) VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L702] 0 y$r_buff1_thd0 = y$r_buff0_thd0 [L703] 0 y$r_buff1_thd1 = y$r_buff0_thd1 [L704] 0 y$r_buff1_thd2 = y$r_buff0_thd2 [L705] 0 y$r_buff0_thd1 = (_Bool)1 [L708] 0 x = 1 VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L711] EXPR 0 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L725] 1 x = 2 [L728] 1 y = 1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L711] 0 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L712] EXPR 0 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L731] EXPR 1 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L712] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L731] EXPR 1 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y=2] [L731] EXPR 1 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y)=2, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y=2] [L731] 1 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L732] EXPR 1 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L732] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L733] EXPR 1 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used=0, y$w_buff1=0, y$w_buff1_used=0] [L733] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L734] EXPR 1 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2=0, y$w_buff1=0, y$w_buff1_used=0] [L734] 1 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L735] EXPR 1 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2=0, y$w_buff1=0, y$w_buff1_used=0] [L735] 1 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L738] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L713] EXPR 0 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L713] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L714] EXPR 0 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 VAL [__unbuffered_cnt=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L714] 0 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L715] EXPR 0 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 VAL [__unbuffered_cnt=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L715] 0 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L718] 0 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L758] -1 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L762] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L762] EXPR -1 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L762] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L762] -1 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L763] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L763] -1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L764] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L764] -1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L765] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L765] -1 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L766] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L766] -1 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L769] -1 weak$$choice0 = __VERIFIER_nondet_pointer() [L770] -1 weak$$choice2 = __VERIFIER_nondet_pointer() [L771] -1 y$flush_delayed = weak$$choice2 [L772] -1 y$mem_tmp = y VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L773] EXPR -1 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L773] -1 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L774] EXPR -1 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L774] -1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L775] EXPR -1 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L775] -1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L776] EXPR -1 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L776] -1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L777] EXPR -1 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L777] -1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L778] EXPR -1 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L778] -1 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L779] EXPR -1 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L779] -1 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L780] -1 main$tmp_guard1 = !(x == 2 && y == 2) VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L781] EXPR -1 y$flush_delayed ? y$mem_tmp : y VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L781] -1 y = y$flush_delayed ? y$mem_tmp : y [L782] -1 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L4] COND TRUE -1 !expression VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L4] -1 __VERIFIER_error() VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 178 locations, 3 error locations. UNSAFE Result, 40.8s OverallTime, 32 OverallIterations, 1 TraceHistogramMax, 20.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 7242 SDtfs, 6538 SDslu, 16475 SDs, 0 SdLazy, 6749 SolverSat, 396 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 12.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 316 GetRequests, 87 SyntacticMatches, 17 SemanticMatches, 212 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 245 ImplicationChecksByTransitivity, 8.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=43712occurred in iteration=11, 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: 9.2s AutomataMinimizationTime, 31 MinimizatonAttempts, 92834 StatesRemovedByMinimization, 29 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 7.8s InterpolantComputationTime, 2544 NumberOfCodeBlocks, 2544 NumberOfCodeBlocksAsserted, 32 NumberOfCheckSat, 2420 ConstructedInterpolants, 0 QuantifiedInterpolants, 484218 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 31 InterpolantComputations, 31 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...