./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/pthread-wmm/mix054_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/mix054_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 247fffb4c4c4e8dbb064b88db3e3880682574298 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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:15:08,493 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-28 20:15:08,495 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-28 20:15:08,507 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-28 20:15:08,507 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-28 20:15:08,508 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-28 20:15:08,510 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-28 20:15:08,512 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-28 20:15:08,514 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-28 20:15:08,515 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-28 20:15:08,516 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-28 20:15:08,516 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-28 20:15:08,518 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-28 20:15:08,519 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-28 20:15:08,520 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-28 20:15:08,521 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-28 20:15:08,522 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-28 20:15:08,524 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-28 20:15:08,526 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-28 20:15:08,528 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-28 20:15:08,529 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-28 20:15:08,530 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-28 20:15:08,533 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-28 20:15:08,533 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-28 20:15:08,534 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-28 20:15:08,535 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-28 20:15:08,536 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-28 20:15:08,537 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-28 20:15:08,538 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-28 20:15:08,540 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-28 20:15:08,540 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-28 20:15:08,541 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-28 20:15:08,541 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-28 20:15:08,541 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-28 20:15:08,542 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-28 20:15:08,544 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-28 20:15:08,544 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:15:08,559 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-28 20:15:08,559 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-28 20:15:08,560 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-28 20:15:08,560 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-28 20:15:08,561 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-28 20:15:08,562 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-28 20:15:08,562 INFO L133 SettingsManager]: * Use SBE=true [2018-11-28 20:15:08,562 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-28 20:15:08,562 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-28 20:15:08,562 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-28 20:15:08,562 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-28 20:15:08,563 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-28 20:15:08,563 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-28 20:15:08,563 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-28 20:15:08,563 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-28 20:15:08,563 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-28 20:15:08,563 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-28 20:15:08,565 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-28 20:15:08,565 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-28 20:15:08,565 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-28 20:15:08,566 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-28 20:15:08,566 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-28 20:15:08,566 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-28 20:15:08,567 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-28 20:15:08,567 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-28 20:15:08,567 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-28 20:15:08,567 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-28 20:15:08,567 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-28 20:15:08,567 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-28 20:15:08,569 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-28 20:15:08,569 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 -> 247fffb4c4c4e8dbb064b88db3e3880682574298 [2018-11-28 20:15:08,622 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-28 20:15:08,639 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-28 20:15:08,647 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-28 20:15:08,649 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-28 20:15:08,649 INFO L276 PluginConnector]: CDTParser initialized [2018-11-28 20:15:08,650 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/pthread-wmm/mix054_pso.oepc_false-unreach-call.i [2018-11-28 20:15:08,722 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b8b1b8667/6fd4d12289544ee69cee325f36b08208/FLAGf5b3b7e2f [2018-11-28 20:15:09,296 INFO L307 CDTParser]: Found 1 translation units. [2018-11-28 20:15:09,298 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/pthread-wmm/mix054_pso.oepc_false-unreach-call.i [2018-11-28 20:15:09,318 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b8b1b8667/6fd4d12289544ee69cee325f36b08208/FLAGf5b3b7e2f [2018-11-28 20:15:09,509 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b8b1b8667/6fd4d12289544ee69cee325f36b08208 [2018-11-28 20:15:09,512 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-28 20:15:09,514 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-28 20:15:09,515 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-28 20:15:09,515 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-28 20:15:09,519 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-28 20:15:09,520 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 08:15:09" (1/1) ... [2018-11-28 20:15:09,523 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:15:09, skipping insertion in model container [2018-11-28 20:15:09,524 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 08:15:09" (1/1) ... [2018-11-28 20:15:09,532 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-28 20:15:09,588 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-28 20:15:10,109 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 20:15:10,125 INFO L191 MainTranslator]: Completed pre-run [2018-11-28 20:15:10,273 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 20:15:10,371 INFO L195 MainTranslator]: Completed translation [2018-11-28 20:15:10,371 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:15:10 WrapperNode [2018-11-28 20:15:10,372 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-28 20:15:10,373 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-28 20:15:10,373 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-28 20:15:10,373 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-28 20:15:10,383 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:15:10" (1/1) ... [2018-11-28 20:15:10,403 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:15:10" (1/1) ... [2018-11-28 20:15:10,435 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-28 20:15:10,436 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-28 20:15:10,436 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-28 20:15:10,436 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-28 20:15:10,447 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:15:10" (1/1) ... [2018-11-28 20:15:10,447 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:15:10" (1/1) ... [2018-11-28 20:15:10,452 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:15:10" (1/1) ... [2018-11-28 20:15:10,452 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:15:10" (1/1) ... [2018-11-28 20:15:10,464 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:15:10" (1/1) ... [2018-11-28 20:15:10,469 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:15:10" (1/1) ... [2018-11-28 20:15:10,473 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:15:10" (1/1) ... [2018-11-28 20:15:10,477 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-28 20:15:10,478 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-28 20:15:10,478 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-28 20:15:10,478 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-28 20:15:10,479 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:15:10" (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:15:10,536 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-28 20:15:10,537 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-28 20:15:10,537 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2018-11-28 20:15:10,537 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-28 20:15:10,537 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2018-11-28 20:15:10,537 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2018-11-28 20:15:10,538 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2018-11-28 20:15:10,538 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2018-11-28 20:15:10,538 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2018-11-28 20:15:10,538 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-28 20:15:10,538 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-28 20:15:10,540 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:15:11,680 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-28 20:15:11,681 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-11-28 20:15:11,682 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 08:15:11 BoogieIcfgContainer [2018-11-28 20:15:11,682 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-28 20:15:11,683 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-28 20:15:11,683 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-28 20:15:11,690 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-28 20:15:11,690 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 08:15:09" (1/3) ... [2018-11-28 20:15:11,691 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@532b42ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 08:15:11, skipping insertion in model container [2018-11-28 20:15:11,692 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:15:10" (2/3) ... [2018-11-28 20:15:11,692 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@532b42ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 08:15:11, skipping insertion in model container [2018-11-28 20:15:11,692 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 08:15:11" (3/3) ... [2018-11-28 20:15:11,695 INFO L112 eAbstractionObserver]: Analyzing ICFG mix054_pso.oepc_false-unreach-call.i [2018-11-28 20:15:11,751 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:15:11,751 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:15:11,751 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:15:11,751 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:15:11,752 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:15:11,752 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:15:11,752 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:15:11,754 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:15:11,755 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:15:11,755 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:15:11,755 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:15:11,756 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:15:11,758 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:15:11,758 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:15:11,758 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:15:11,761 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:15:11,761 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:15:11,761 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:15:11,761 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:15:11,762 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:15:11,762 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:15:11,762 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:15:11,762 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:15:11,763 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:15:11,763 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:15:11,763 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:15:11,764 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:15:11,764 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:15:11,764 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:15:11,764 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:15:11,765 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:15:11,765 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:15:11,765 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:15:11,765 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:15:11,765 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:15:11,766 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:15:11,766 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:15:11,767 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:15:11,768 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet11.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:15:11,768 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet11.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:15:11,768 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:15:11,768 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:15:11,768 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:15:11,770 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:15:11,770 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet11.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:15:11,770 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:15:11,770 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:15:11,770 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet11.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:15:11,771 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:15:11,771 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:15:11,771 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:15:11,771 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:15:11,775 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:15:11,775 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:15:11,776 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:15:11,776 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:15:11,776 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:15:11,777 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:15:11,777 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:15:11,777 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:15:11,777 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:15:11,777 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:15:11,778 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:15:11,778 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:15:11,778 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:15:11,779 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:15:11,779 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:15:11,779 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:15:11,779 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:15:11,779 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:15:11,780 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:15:11,780 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:15:11,780 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:15:11,780 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:15:11,781 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:15:11,782 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:15:11,782 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:15:11,782 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:15:11,782 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:15:11,783 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:15:11,783 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:15:11,784 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:15:11,784 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:15:11,784 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:15:11,784 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:15:11,784 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:15:11,785 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:15:11,785 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:15:11,785 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:15:11,786 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:15:11,786 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:15:11,786 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:15:11,786 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:15:11,787 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:15:11,787 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:15:11,787 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:15:11,787 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:15:11,787 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:15:11,789 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:15:11,789 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:15:11,789 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:15:11,790 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:15:11,790 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:15:11,790 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:15:11,790 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:15:11,790 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:15:11,791 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:15:11,791 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:15:11,791 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:15:11,791 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:15:11,791 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:15:11,792 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:15:11,792 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:15:11,792 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:15:11,792 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:15:11,797 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:15:11,798 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:15:11,798 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:15:11,798 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:15:11,798 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:15:11,798 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:15:11,799 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:15:11,799 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:15:11,799 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:15:11,801 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:15:11,801 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:15:11,801 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:15:11,803 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:15:11,803 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:15:11,803 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:15:11,803 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:15:11,804 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:15:11,804 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:15:11,805 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:15:11,805 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:15:11,805 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:15:11,805 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:15:11,805 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:15:11,806 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:15:11,806 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:15:11,806 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:15:11,806 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:15:11,806 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:15:11,809 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:15:11,810 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:15:11,810 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:15:11,810 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:15:11,810 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:15:11,811 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:15:11,811 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:15:11,811 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:15:11,811 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:15:11,813 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:15:11,814 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:15:11,814 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:15:11,814 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:15:11,814 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:15:11,815 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:15:11,816 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet39.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:15:11,816 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet39.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:15:11,817 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:15:11,817 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:15:11,817 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet39.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:15:11,817 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet39.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:15:11,850 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2018-11-28 20:15:11,850 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-28 20:15:11,862 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-11-28 20:15:11,882 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2018-11-28 20:15:11,911 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-28 20:15:11,912 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-28 20:15:11,912 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-28 20:15:11,912 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-28 20:15:11,913 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-28 20:15:11,913 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-28 20:15:11,914 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-28 20:15:11,914 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-28 20:15:11,914 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-28 20:15:11,936 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 141places, 179 transitions [2018-11-28 20:15:14,405 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 34805 states. [2018-11-28 20:15:14,407 INFO L276 IsEmpty]: Start isEmpty. Operand 34805 states. [2018-11-28 20:15:14,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-28 20:15:14,416 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:15:14,417 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] [2018-11-28 20:15:14,420 INFO L423 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:15:14,428 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:15:14,430 INFO L82 PathProgramCache]: Analyzing trace with hash 1272153477, now seen corresponding path program 1 times [2018-11-28 20:15:14,432 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:15:14,433 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:15:14,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:15:14,499 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:15:14,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:15:14,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:15:14,766 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:15:14,770 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:15:14,770 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 20:15:14,775 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 20:15:14,794 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 20:15:14,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 20:15:14,799 INFO L87 Difference]: Start difference. First operand 34805 states. Second operand 4 states. [2018-11-28 20:15:16,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:15:16,348 INFO L93 Difference]: Finished difference Result 60789 states and 234492 transitions. [2018-11-28 20:15:16,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 20:15:16,353 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 32 [2018-11-28 20:15:16,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:15:16,727 INFO L225 Difference]: With dead ends: 60789 [2018-11-28 20:15:16,727 INFO L226 Difference]: Without dead ends: 44269 [2018-11-28 20:15:16,729 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 20:15:17,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44269 states. [2018-11-28 20:15:18,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44269 to 27337. [2018-11-28 20:15:18,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27337 states. [2018-11-28 20:15:18,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27337 states to 27337 states and 105498 transitions. [2018-11-28 20:15:18,606 INFO L78 Accepts]: Start accepts. Automaton has 27337 states and 105498 transitions. Word has length 32 [2018-11-28 20:15:18,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:15:18,606 INFO L480 AbstractCegarLoop]: Abstraction has 27337 states and 105498 transitions. [2018-11-28 20:15:18,606 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 20:15:18,607 INFO L276 IsEmpty]: Start isEmpty. Operand 27337 states and 105498 transitions. [2018-11-28 20:15:18,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-11-28 20:15:18,623 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:15:18,623 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 20:15:18,624 INFO L423 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:15:18,624 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:15:18,624 INFO L82 PathProgramCache]: Analyzing trace with hash 1559910934, now seen corresponding path program 1 times [2018-11-28 20:15:18,624 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:15:18,624 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:15:18,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:15:18,638 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:15:18,639 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:15:18,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:15:18,789 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:15:18,790 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:15:18,790 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 20:15:18,792 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 20:15:18,793 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 20:15:18,793 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 20:15:18,793 INFO L87 Difference]: Start difference. First operand 27337 states and 105498 transitions. Second operand 4 states. [2018-11-28 20:15:19,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:15:19,132 INFO L93 Difference]: Finished difference Result 8527 states and 28343 transitions. [2018-11-28 20:15:19,132 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 20:15:19,133 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 44 [2018-11-28 20:15:19,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:15:19,164 INFO L225 Difference]: With dead ends: 8527 [2018-11-28 20:15:19,164 INFO L226 Difference]: Without dead ends: 7465 [2018-11-28 20:15:19,165 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:15:19,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7465 states. [2018-11-28 20:15:19,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7465 to 7465. [2018-11-28 20:15:19,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7465 states. [2018-11-28 20:15:19,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7465 states to 7465 states and 24635 transitions. [2018-11-28 20:15:19,397 INFO L78 Accepts]: Start accepts. Automaton has 7465 states and 24635 transitions. Word has length 44 [2018-11-28 20:15:19,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:15:19,398 INFO L480 AbstractCegarLoop]: Abstraction has 7465 states and 24635 transitions. [2018-11-28 20:15:19,398 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 20:15:19,398 INFO L276 IsEmpty]: Start isEmpty. Operand 7465 states and 24635 transitions. [2018-11-28 20:15:19,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-11-28 20:15:19,400 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:15:19,401 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 20:15:19,401 INFO L423 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:15:19,401 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:15:19,401 INFO L82 PathProgramCache]: Analyzing trace with hash -1459656693, now seen corresponding path program 1 times [2018-11-28 20:15:19,401 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:15:19,402 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:15:19,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:15:19,410 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:15:19,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:15:19,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:15:19,760 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:15:19,760 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:15:19,761 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 20:15:19,761 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 20:15:19,763 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 20:15:19,763 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 20:15:19,763 INFO L87 Difference]: Start difference. First operand 7465 states and 24635 transitions. Second operand 5 states. [2018-11-28 20:15:21,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:15:21,371 INFO L93 Difference]: Finished difference Result 13997 states and 45804 transitions. [2018-11-28 20:15:21,373 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 20:15:21,373 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 45 [2018-11-28 20:15:21,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:15:21,420 INFO L225 Difference]: With dead ends: 13997 [2018-11-28 20:15:21,420 INFO L226 Difference]: Without dead ends: 13929 [2018-11-28 20:15:21,420 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-11-28 20:15:21,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13929 states. [2018-11-28 20:15:21,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13929 to 9440. [2018-11-28 20:15:21,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9440 states. [2018-11-28 20:15:21,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9440 states to 9440 states and 30541 transitions. [2018-11-28 20:15:21,687 INFO L78 Accepts]: Start accepts. Automaton has 9440 states and 30541 transitions. Word has length 45 [2018-11-28 20:15:21,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:15:21,688 INFO L480 AbstractCegarLoop]: Abstraction has 9440 states and 30541 transitions. [2018-11-28 20:15:21,688 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 20:15:21,688 INFO L276 IsEmpty]: Start isEmpty. Operand 9440 states and 30541 transitions. [2018-11-28 20:15:21,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-11-28 20:15:21,690 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:15:21,690 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] [2018-11-28 20:15:21,691 INFO L423 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:15:21,691 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:15:21,691 INFO L82 PathProgramCache]: Analyzing trace with hash -1598559727, now seen corresponding path program 1 times [2018-11-28 20:15:21,691 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:15:21,691 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:15:21,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:15:21,694 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:15:21,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:15:21,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:15:21,778 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:15:21,778 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:15:21,778 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 20:15:21,779 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 20:15:21,779 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 20:15:21,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 20:15:21,779 INFO L87 Difference]: Start difference. First operand 9440 states and 30541 transitions. Second operand 3 states. [2018-11-28 20:15:22,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:15:22,218 INFO L93 Difference]: Finished difference Result 13278 states and 42640 transitions. [2018-11-28 20:15:22,219 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 20:15:22,219 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 47 [2018-11-28 20:15:22,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:15:22,245 INFO L225 Difference]: With dead ends: 13278 [2018-11-28 20:15:22,246 INFO L226 Difference]: Without dead ends: 13278 [2018-11-28 20:15:22,246 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:15:22,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13278 states. [2018-11-28 20:15:22,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13278 to 9844. [2018-11-28 20:15:22,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9844 states. [2018-11-28 20:15:22,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9844 states to 9844 states and 31507 transitions. [2018-11-28 20:15:22,506 INFO L78 Accepts]: Start accepts. Automaton has 9844 states and 31507 transitions. Word has length 47 [2018-11-28 20:15:22,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:15:22,507 INFO L480 AbstractCegarLoop]: Abstraction has 9844 states and 31507 transitions. [2018-11-28 20:15:22,507 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 20:15:22,508 INFO L276 IsEmpty]: Start isEmpty. Operand 9844 states and 31507 transitions. [2018-11-28 20:15:22,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-11-28 20:15:22,511 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:15:22,511 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] [2018-11-28 20:15:22,511 INFO L423 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:15:22,512 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:15:22,513 INFO L82 PathProgramCache]: Analyzing trace with hash -108379620, now seen corresponding path program 1 times [2018-11-28 20:15:22,513 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:15:22,513 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:15:22,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:15:22,516 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:15:22,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:15:22,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:15:22,678 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:15:22,679 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:15:22,679 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-28 20:15:22,679 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-28 20:15:22,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-28 20:15:22,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-11-28 20:15:22,681 INFO L87 Difference]: Start difference. First operand 9844 states and 31507 transitions. Second operand 7 states. [2018-11-28 20:15:23,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:15:23,758 INFO L93 Difference]: Finished difference Result 12284 states and 38672 transitions. [2018-11-28 20:15:23,759 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-28 20:15:23,759 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 51 [2018-11-28 20:15:23,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:15:23,782 INFO L225 Difference]: With dead ends: 12284 [2018-11-28 20:15:23,782 INFO L226 Difference]: Without dead ends: 12212 [2018-11-28 20:15:23,783 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2018-11-28 20:15:23,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12212 states. [2018-11-28 20:15:24,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12212 to 10848. [2018-11-28 20:15:24,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10848 states. [2018-11-28 20:15:24,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10848 states to 10848 states and 34562 transitions. [2018-11-28 20:15:24,034 INFO L78 Accepts]: Start accepts. Automaton has 10848 states and 34562 transitions. Word has length 51 [2018-11-28 20:15:24,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:15:24,034 INFO L480 AbstractCegarLoop]: Abstraction has 10848 states and 34562 transitions. [2018-11-28 20:15:24,035 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-28 20:15:24,035 INFO L276 IsEmpty]: Start isEmpty. Operand 10848 states and 34562 transitions. [2018-11-28 20:15:24,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-11-28 20:15:24,044 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:15:24,044 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] [2018-11-28 20:15:24,047 INFO L423 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:15:24,047 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:15:24,047 INFO L82 PathProgramCache]: Analyzing trace with hash -1204429704, now seen corresponding path program 1 times [2018-11-28 20:15:24,048 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:15:24,048 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:15:24,051 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:15:24,051 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:15:24,051 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:15:24,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:15:24,239 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:15:24,240 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:15:24,240 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 20:15:24,240 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 20:15:24,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 20:15:24,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 20:15:24,241 INFO L87 Difference]: Start difference. First operand 10848 states and 34562 transitions. Second operand 4 states. [2018-11-28 20:15:24,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:15:24,405 INFO L93 Difference]: Finished difference Result 12395 states and 39571 transitions. [2018-11-28 20:15:24,405 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 20:15:24,405 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 59 [2018-11-28 20:15:24,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:15:24,429 INFO L225 Difference]: With dead ends: 12395 [2018-11-28 20:15:24,429 INFO L226 Difference]: Without dead ends: 12395 [2018-11-28 20:15:24,429 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-28 20:15:24,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12395 states. [2018-11-28 20:15:24,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12395 to 11368. [2018-11-28 20:15:24,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11368 states. [2018-11-28 20:15:24,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11368 states to 11368 states and 36235 transitions. [2018-11-28 20:15:24,679 INFO L78 Accepts]: Start accepts. Automaton has 11368 states and 36235 transitions. Word has length 59 [2018-11-28 20:15:24,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:15:24,679 INFO L480 AbstractCegarLoop]: Abstraction has 11368 states and 36235 transitions. [2018-11-28 20:15:24,680 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 20:15:24,680 INFO L276 IsEmpty]: Start isEmpty. Operand 11368 states and 36235 transitions. [2018-11-28 20:15:24,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-11-28 20:15:24,686 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:15:24,687 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] [2018-11-28 20:15:24,687 INFO L423 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:15:24,687 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:15:24,687 INFO L82 PathProgramCache]: Analyzing trace with hash 538380631, now seen corresponding path program 1 times [2018-11-28 20:15:24,687 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:15:24,688 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:15:24,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:15:24,690 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:15:24,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:15:24,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:15:24,833 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:15:24,834 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:15:24,834 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 20:15:24,834 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 20:15:24,834 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 20:15:24,835 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-28 20:15:24,835 INFO L87 Difference]: Start difference. First operand 11368 states and 36235 transitions. Second operand 6 states. [2018-11-28 20:15:25,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:15:25,714 INFO L93 Difference]: Finished difference Result 20968 states and 66485 transitions. [2018-11-28 20:15:25,714 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-28 20:15:25,715 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 59 [2018-11-28 20:15:25,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:15:25,758 INFO L225 Difference]: With dead ends: 20968 [2018-11-28 20:15:25,758 INFO L226 Difference]: Without dead ends: 20897 [2018-11-28 20:15:25,759 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2018-11-28 20:15:25,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20897 states. [2018-11-28 20:15:26,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20897 to 13754. [2018-11-28 20:15:26,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13754 states. [2018-11-28 20:15:26,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13754 states to 13754 states and 43279 transitions. [2018-11-28 20:15:26,417 INFO L78 Accepts]: Start accepts. Automaton has 13754 states and 43279 transitions. Word has length 59 [2018-11-28 20:15:26,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:15:26,417 INFO L480 AbstractCegarLoop]: Abstraction has 13754 states and 43279 transitions. [2018-11-28 20:15:26,417 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 20:15:26,418 INFO L276 IsEmpty]: Start isEmpty. Operand 13754 states and 43279 transitions. [2018-11-28 20:15:26,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-11-28 20:15:26,429 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:15:26,429 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] [2018-11-28 20:15:26,429 INFO L423 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:15:26,430 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:15:26,430 INFO L82 PathProgramCache]: Analyzing trace with hash -1067585964, now seen corresponding path program 1 times [2018-11-28 20:15:26,430 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:15:26,430 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:15:26,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:15:26,432 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:15:26,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:15:26,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:15:26,575 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:15:26,576 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:15:26,576 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 20:15:26,577 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 20:15:26,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 20:15:26,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 20:15:26,577 INFO L87 Difference]: Start difference. First operand 13754 states and 43279 transitions. Second operand 4 states. [2018-11-28 20:15:27,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:15:27,295 INFO L93 Difference]: Finished difference Result 20200 states and 61902 transitions. [2018-11-28 20:15:27,296 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 20:15:27,296 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 63 [2018-11-28 20:15:27,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:15:27,337 INFO L225 Difference]: With dead ends: 20200 [2018-11-28 20:15:27,337 INFO L226 Difference]: Without dead ends: 20200 [2018-11-28 20:15:27,337 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-28 20:15:27,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20200 states. [2018-11-28 20:15:27,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20200 to 15792. [2018-11-28 20:15:27,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15792 states. [2018-11-28 20:15:27,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15792 states to 15792 states and 49060 transitions. [2018-11-28 20:15:27,601 INFO L78 Accepts]: Start accepts. Automaton has 15792 states and 49060 transitions. Word has length 63 [2018-11-28 20:15:27,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:15:27,601 INFO L480 AbstractCegarLoop]: Abstraction has 15792 states and 49060 transitions. [2018-11-28 20:15:27,601 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 20:15:27,601 INFO L276 IsEmpty]: Start isEmpty. Operand 15792 states and 49060 transitions. [2018-11-28 20:15:27,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-11-28 20:15:27,612 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:15:27,612 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] [2018-11-28 20:15:27,612 INFO L423 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:15:27,612 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:15:27,613 INFO L82 PathProgramCache]: Analyzing trace with hash 1009623379, now seen corresponding path program 1 times [2018-11-28 20:15:27,613 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:15:27,613 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:15:27,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:15:27,615 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:15:27,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:15:27,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:15:27,856 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:15:27,857 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:15:27,857 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 20:15:27,857 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 20:15:27,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 20:15:27,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 20:15:27,858 INFO L87 Difference]: Start difference. First operand 15792 states and 49060 transitions. Second operand 4 states. [2018-11-28 20:15:28,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:15:28,375 INFO L93 Difference]: Finished difference Result 19959 states and 61084 transitions. [2018-11-28 20:15:28,376 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 20:15:28,376 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 63 [2018-11-28 20:15:28,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:15:28,412 INFO L225 Difference]: With dead ends: 19959 [2018-11-28 20:15:28,412 INFO L226 Difference]: Without dead ends: 19959 [2018-11-28 20:15:28,412 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 20:15:28,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19959 states. [2018-11-28 20:15:28,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19959 to 16086. [2018-11-28 20:15:28,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16086 states. [2018-11-28 20:15:28,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16086 states to 16086 states and 49917 transitions. [2018-11-28 20:15:28,710 INFO L78 Accepts]: Start accepts. Automaton has 16086 states and 49917 transitions. Word has length 63 [2018-11-28 20:15:28,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:15:28,710 INFO L480 AbstractCegarLoop]: Abstraction has 16086 states and 49917 transitions. [2018-11-28 20:15:28,711 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 20:15:28,711 INFO L276 IsEmpty]: Start isEmpty. Operand 16086 states and 49917 transitions. [2018-11-28 20:15:28,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-11-28 20:15:28,724 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:15:28,724 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] [2018-11-28 20:15:28,724 INFO L423 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:15:28,724 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:15:28,724 INFO L82 PathProgramCache]: Analyzing trace with hash 754886834, now seen corresponding path program 1 times [2018-11-28 20:15:28,725 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:15:28,725 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:15:28,727 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:15:28,727 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:15:28,727 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:15:28,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:15:28,855 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:15:28,855 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:15:28,855 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 20:15:28,856 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 20:15:28,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 20:15:28,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 20:15:28,856 INFO L87 Difference]: Start difference. First operand 16086 states and 49917 transitions. Second operand 3 states. [2018-11-28 20:15:29,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:15:29,124 INFO L93 Difference]: Finished difference Result 16558 states and 51205 transitions. [2018-11-28 20:15:29,125 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 20:15:29,125 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 63 [2018-11-28 20:15:29,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:15:29,152 INFO L225 Difference]: With dead ends: 16558 [2018-11-28 20:15:29,153 INFO L226 Difference]: Without dead ends: 16558 [2018-11-28 20:15:29,153 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:15:29,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16558 states. [2018-11-28 20:15:29,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16558 to 16322. [2018-11-28 20:15:29,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16322 states. [2018-11-28 20:15:29,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16322 states to 16322 states and 50541 transitions. [2018-11-28 20:15:29,729 INFO L78 Accepts]: Start accepts. Automaton has 16322 states and 50541 transitions. Word has length 63 [2018-11-28 20:15:29,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:15:29,730 INFO L480 AbstractCegarLoop]: Abstraction has 16322 states and 50541 transitions. [2018-11-28 20:15:29,730 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 20:15:29,730 INFO L276 IsEmpty]: Start isEmpty. Operand 16322 states and 50541 transitions. [2018-11-28 20:15:29,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-11-28 20:15:29,741 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:15:29,741 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] [2018-11-28 20:15:29,741 INFO L423 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:15:29,741 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:15:29,741 INFO L82 PathProgramCache]: Analyzing trace with hash -1952113636, now seen corresponding path program 1 times [2018-11-28 20:15:29,741 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:15:29,742 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:15:29,743 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:15:29,743 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:15:29,743 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:15:29,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:15:30,007 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:15:30,007 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:15:30,007 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 20:15:30,007 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 20:15:30,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 20:15:30,008 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-28 20:15:30,008 INFO L87 Difference]: Start difference. First operand 16322 states and 50541 transitions. Second operand 6 states. [2018-11-28 20:15:30,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:15:30,756 INFO L93 Difference]: Finished difference Result 17646 states and 53545 transitions. [2018-11-28 20:15:30,757 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-28 20:15:30,757 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 65 [2018-11-28 20:15:30,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:15:30,787 INFO L225 Difference]: With dead ends: 17646 [2018-11-28 20:15:30,787 INFO L226 Difference]: Without dead ends: 17646 [2018-11-28 20:15:30,787 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2018-11-28 20:15:30,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17646 states. [2018-11-28 20:15:30,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17646 to 16546. [2018-11-28 20:15:30,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16546 states. [2018-11-28 20:15:31,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16546 states to 16546 states and 50764 transitions. [2018-11-28 20:15:31,016 INFO L78 Accepts]: Start accepts. Automaton has 16546 states and 50764 transitions. Word has length 65 [2018-11-28 20:15:31,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:15:31,017 INFO L480 AbstractCegarLoop]: Abstraction has 16546 states and 50764 transitions. [2018-11-28 20:15:31,017 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 20:15:31,017 INFO L276 IsEmpty]: Start isEmpty. Operand 16546 states and 50764 transitions. [2018-11-28 20:15:31,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-11-28 20:15:31,026 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:15:31,026 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] [2018-11-28 20:15:31,026 INFO L423 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:15:31,026 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:15:31,027 INFO L82 PathProgramCache]: Analyzing trace with hash -707349155, now seen corresponding path program 1 times [2018-11-28 20:15:31,027 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:15:31,027 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:15:31,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:15:31,029 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:15:31,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:15:31,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:15:31,431 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:15:31,432 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:15:31,432 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 20:15:31,432 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 20:15:31,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 20:15:31,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 20:15:31,433 INFO L87 Difference]: Start difference. First operand 16546 states and 50764 transitions. Second operand 5 states. [2018-11-28 20:15:32,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:15:32,743 INFO L93 Difference]: Finished difference Result 21334 states and 64873 transitions. [2018-11-28 20:15:32,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 20:15:32,744 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 65 [2018-11-28 20:15:32,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:15:32,781 INFO L225 Difference]: With dead ends: 21334 [2018-11-28 20:15:32,781 INFO L226 Difference]: Without dead ends: 21334 [2018-11-28 20:15:32,781 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-11-28 20:15:32,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21334 states. [2018-11-28 20:15:33,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21334 to 19570. [2018-11-28 20:15:33,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19570 states. [2018-11-28 20:15:33,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19570 states to 19570 states and 59494 transitions. [2018-11-28 20:15:33,080 INFO L78 Accepts]: Start accepts. Automaton has 19570 states and 59494 transitions. Word has length 65 [2018-11-28 20:15:33,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:15:33,080 INFO L480 AbstractCegarLoop]: Abstraction has 19570 states and 59494 transitions. [2018-11-28 20:15:33,080 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 20:15:33,080 INFO L276 IsEmpty]: Start isEmpty. Operand 19570 states and 59494 transitions. [2018-11-28 20:15:33,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-11-28 20:15:33,090 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:15:33,091 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] [2018-11-28 20:15:33,091 INFO L423 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:15:33,091 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:15:33,091 INFO L82 PathProgramCache]: Analyzing trace with hash -1217883332, now seen corresponding path program 1 times [2018-11-28 20:15:33,091 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:15:33,091 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:15:33,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:15:33,093 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:15:33,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:15:33,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:15:33,435 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:15:33,435 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:15:33,435 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 20:15:33,436 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 20:15:33,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 20:15:33,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 20:15:33,436 INFO L87 Difference]: Start difference. First operand 19570 states and 59494 transitions. Second operand 5 states. [2018-11-28 20:15:34,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:15:34,040 INFO L93 Difference]: Finished difference Result 30156 states and 90237 transitions. [2018-11-28 20:15:34,041 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-28 20:15:34,041 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 65 [2018-11-28 20:15:34,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:15:34,095 INFO L225 Difference]: With dead ends: 30156 [2018-11-28 20:15:34,095 INFO L226 Difference]: Without dead ends: 30156 [2018-11-28 20:15:34,095 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-11-28 20:15:34,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30156 states. [2018-11-28 20:15:34,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30156 to 26760. [2018-11-28 20:15:34,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26760 states. [2018-11-28 20:15:34,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26760 states to 26760 states and 80370 transitions. [2018-11-28 20:15:34,576 INFO L78 Accepts]: Start accepts. Automaton has 26760 states and 80370 transitions. Word has length 65 [2018-11-28 20:15:34,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:15:34,577 INFO L480 AbstractCegarLoop]: Abstraction has 26760 states and 80370 transitions. [2018-11-28 20:15:34,577 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 20:15:34,577 INFO L276 IsEmpty]: Start isEmpty. Operand 26760 states and 80370 transitions. [2018-11-28 20:15:34,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-11-28 20:15:34,592 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:15:34,593 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] [2018-11-28 20:15:34,593 INFO L423 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:15:34,593 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:15:34,593 INFO L82 PathProgramCache]: Analyzing trace with hash 1269629501, now seen corresponding path program 1 times [2018-11-28 20:15:34,593 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:15:34,594 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:15:34,595 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:15:34,596 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:15:34,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:15:34,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:15:34,782 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:15:34,782 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:15:34,783 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 20:15:34,783 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 20:15:34,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 20:15:34,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-28 20:15:34,784 INFO L87 Difference]: Start difference. First operand 26760 states and 80370 transitions. Second operand 5 states. [2018-11-28 20:15:34,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:15:34,889 INFO L93 Difference]: Finished difference Result 8084 states and 19691 transitions. [2018-11-28 20:15:34,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 20:15:34,890 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 65 [2018-11-28 20:15:34,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:15:34,901 INFO L225 Difference]: With dead ends: 8084 [2018-11-28 20:15:34,901 INFO L226 Difference]: Without dead ends: 6316 [2018-11-28 20:15:34,902 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-11-28 20:15:34,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6316 states. [2018-11-28 20:15:34,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6316 to 4889. [2018-11-28 20:15:34,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4889 states. [2018-11-28 20:15:34,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4889 states to 4889 states and 11646 transitions. [2018-11-28 20:15:34,981 INFO L78 Accepts]: Start accepts. Automaton has 4889 states and 11646 transitions. Word has length 65 [2018-11-28 20:15:34,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:15:34,981 INFO L480 AbstractCegarLoop]: Abstraction has 4889 states and 11646 transitions. [2018-11-28 20:15:34,981 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 20:15:34,982 INFO L276 IsEmpty]: Start isEmpty. Operand 4889 states and 11646 transitions. [2018-11-28 20:15:34,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-11-28 20:15:34,987 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:15:34,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] [2018-11-28 20:15:34,988 INFO L423 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:15:34,988 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:15:34,988 INFO L82 PathProgramCache]: Analyzing trace with hash -2026999384, now seen corresponding path program 1 times [2018-11-28 20:15:34,988 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:15:34,989 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:15:34,991 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:15:34,991 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:15:34,991 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:15:35,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:15:35,082 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:15:35,082 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:15:35,082 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 20:15:35,083 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 20:15:35,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 20:15:35,083 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 20:15:35,083 INFO L87 Difference]: Start difference. First operand 4889 states and 11646 transitions. Second operand 3 states. [2018-11-28 20:15:35,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:15:35,210 INFO L93 Difference]: Finished difference Result 6692 states and 15894 transitions. [2018-11-28 20:15:35,211 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 20:15:35,211 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2018-11-28 20:15:35,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:15:35,219 INFO L225 Difference]: With dead ends: 6692 [2018-11-28 20:15:35,219 INFO L226 Difference]: Without dead ends: 6692 [2018-11-28 20:15:35,220 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:15:35,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6692 states. [2018-11-28 20:15:35,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6692 to 4832. [2018-11-28 20:15:35,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4832 states. [2018-11-28 20:15:35,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4832 states to 4832 states and 11279 transitions. [2018-11-28 20:15:35,302 INFO L78 Accepts]: Start accepts. Automaton has 4832 states and 11279 transitions. Word has length 65 [2018-11-28 20:15:35,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:15:35,302 INFO L480 AbstractCegarLoop]: Abstraction has 4832 states and 11279 transitions. [2018-11-28 20:15:35,302 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 20:15:35,302 INFO L276 IsEmpty]: Start isEmpty. Operand 4832 states and 11279 transitions. [2018-11-28 20:15:35,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-11-28 20:15:35,309 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:15:35,309 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] [2018-11-28 20:15:35,310 INFO L423 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:15:35,310 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:15:35,310 INFO L82 PathProgramCache]: Analyzing trace with hash -1343049765, now seen corresponding path program 1 times [2018-11-28 20:15:35,310 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:15:35,310 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:15:35,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:15:35,312 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:15:35,313 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:15:35,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:15:35,444 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:15:35,444 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:15:35,444 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 20:15:35,445 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 20:15:35,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 20:15:35,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 20:15:35,445 INFO L87 Difference]: Start difference. First operand 4832 states and 11279 transitions. Second operand 5 states. [2018-11-28 20:15:35,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:15:35,673 INFO L93 Difference]: Finished difference Result 5855 states and 13632 transitions. [2018-11-28 20:15:35,675 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-28 20:15:35,675 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 71 [2018-11-28 20:15:35,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:15:35,683 INFO L225 Difference]: With dead ends: 5855 [2018-11-28 20:15:35,684 INFO L226 Difference]: Without dead ends: 5855 [2018-11-28 20:15:35,684 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-11-28 20:15:35,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5855 states. [2018-11-28 20:15:35,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5855 to 5224. [2018-11-28 20:15:35,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5224 states. [2018-11-28 20:15:35,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5224 states to 5224 states and 12180 transitions. [2018-11-28 20:15:35,949 INFO L78 Accepts]: Start accepts. Automaton has 5224 states and 12180 transitions. Word has length 71 [2018-11-28 20:15:35,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:15:35,949 INFO L480 AbstractCegarLoop]: Abstraction has 5224 states and 12180 transitions. [2018-11-28 20:15:35,949 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 20:15:35,950 INFO L276 IsEmpty]: Start isEmpty. Operand 5224 states and 12180 transitions. [2018-11-28 20:15:35,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-11-28 20:15:35,956 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:15:35,956 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 20:15:35,956 INFO L423 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:15:35,956 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:15:35,957 INFO L82 PathProgramCache]: Analyzing trace with hash 399760570, now seen corresponding path program 1 times [2018-11-28 20:15:35,957 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:15:35,957 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:15:35,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:15:35,959 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:15:35,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:15:35,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:15:36,221 WARN L180 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2018-11-28 20:15:36,449 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:15:36,449 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:15:36,449 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-28 20:15:36,449 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-28 20:15:36,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-28 20:15:36,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-11-28 20:15:36,451 INFO L87 Difference]: Start difference. First operand 5224 states and 12180 transitions. Second operand 9 states. [2018-11-28 20:15:37,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:15:37,201 INFO L93 Difference]: Finished difference Result 7087 states and 16418 transitions. [2018-11-28 20:15:37,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-28 20:15:37,202 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 71 [2018-11-28 20:15:37,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:15:37,212 INFO L225 Difference]: With dead ends: 7087 [2018-11-28 20:15:37,212 INFO L226 Difference]: Without dead ends: 7032 [2018-11-28 20:15:37,213 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2018-11-28 20:15:37,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7032 states. [2018-11-28 20:15:37,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7032 to 5292. [2018-11-28 20:15:37,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5292 states. [2018-11-28 20:15:37,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5292 states to 5292 states and 12246 transitions. [2018-11-28 20:15:37,283 INFO L78 Accepts]: Start accepts. Automaton has 5292 states and 12246 transitions. Word has length 71 [2018-11-28 20:15:37,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:15:37,283 INFO L480 AbstractCegarLoop]: Abstraction has 5292 states and 12246 transitions. [2018-11-28 20:15:37,283 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-28 20:15:37,283 INFO L276 IsEmpty]: Start isEmpty. Operand 5292 states and 12246 transitions. [2018-11-28 20:15:37,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-11-28 20:15:37,292 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:15:37,292 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] [2018-11-28 20:15:37,292 INFO L423 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:15:37,293 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:15:37,293 INFO L82 PathProgramCache]: Analyzing trace with hash -2052149765, now seen corresponding path program 1 times [2018-11-28 20:15:37,293 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:15:37,293 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:15:37,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:15:37,295 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:15:37,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:15:37,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:15:37,421 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:15:37,422 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:15:37,422 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 20:15:37,422 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 20:15:37,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 20:15:37,424 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 20:15:37,425 INFO L87 Difference]: Start difference. First operand 5292 states and 12246 transitions. Second operand 3 states. [2018-11-28 20:15:37,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:15:37,708 INFO L93 Difference]: Finished difference Result 7021 states and 15768 transitions. [2018-11-28 20:15:37,709 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 20:15:37,709 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 90 [2018-11-28 20:15:37,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:15:37,717 INFO L225 Difference]: With dead ends: 7021 [2018-11-28 20:15:37,717 INFO L226 Difference]: Without dead ends: 6693 [2018-11-28 20:15:37,718 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:15:37,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6693 states. [2018-11-28 20:15:37,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6693 to 6163. [2018-11-28 20:15:37,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6163 states. [2018-11-28 20:15:37,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6163 states to 6163 states and 14048 transitions. [2018-11-28 20:15:37,786 INFO L78 Accepts]: Start accepts. Automaton has 6163 states and 14048 transitions. Word has length 90 [2018-11-28 20:15:37,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:15:37,786 INFO L480 AbstractCegarLoop]: Abstraction has 6163 states and 14048 transitions. [2018-11-28 20:15:37,786 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 20:15:37,786 INFO L276 IsEmpty]: Start isEmpty. Operand 6163 states and 14048 transitions. [2018-11-28 20:15:37,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-11-28 20:15:37,793 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:15:37,794 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] [2018-11-28 20:15:37,794 INFO L423 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:15:37,794 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:15:37,794 INFO L82 PathProgramCache]: Analyzing trace with hash 1511204534, now seen corresponding path program 1 times [2018-11-28 20:15:37,794 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:15:37,794 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:15:37,796 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:15:37,796 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:15:37,796 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:15:37,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:15:37,933 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:15:37,933 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:15:37,933 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 20:15:37,934 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 20:15:37,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 20:15:37,934 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 20:15:37,934 INFO L87 Difference]: Start difference. First operand 6163 states and 14048 transitions. Second operand 4 states. [2018-11-28 20:15:38,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:15:38,054 INFO L93 Difference]: Finished difference Result 6551 states and 14955 transitions. [2018-11-28 20:15:38,055 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 20:15:38,055 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 90 [2018-11-28 20:15:38,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:15:38,063 INFO L225 Difference]: With dead ends: 6551 [2018-11-28 20:15:38,063 INFO L226 Difference]: Without dead ends: 6551 [2018-11-28 20:15:38,064 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 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:15:38,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6551 states. [2018-11-28 20:15:38,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6551 to 6087. [2018-11-28 20:15:38,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6087 states. [2018-11-28 20:15:38,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6087 states to 6087 states and 13961 transitions. [2018-11-28 20:15:38,137 INFO L78 Accepts]: Start accepts. Automaton has 6087 states and 13961 transitions. Word has length 90 [2018-11-28 20:15:38,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:15:38,138 INFO L480 AbstractCegarLoop]: Abstraction has 6087 states and 13961 transitions. [2018-11-28 20:15:38,138 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 20:15:38,138 INFO L276 IsEmpty]: Start isEmpty. Operand 6087 states and 13961 transitions. [2018-11-28 20:15:38,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-11-28 20:15:38,146 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:15:38,146 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] [2018-11-28 20:15:38,146 INFO L423 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:15:38,147 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:15:38,147 INFO L82 PathProgramCache]: Analyzing trace with hash -1808901631, now seen corresponding path program 1 times [2018-11-28 20:15:38,147 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:15:38,147 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:15:38,148 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:15:38,149 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:15:38,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:15:38,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:15:38,359 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:15:38,359 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:15:38,359 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 20:15:38,360 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 20:15:38,360 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 20:15:38,360 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 20:15:38,361 INFO L87 Difference]: Start difference. First operand 6087 states and 13961 transitions. Second operand 5 states. [2018-11-28 20:15:38,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:15:38,495 INFO L93 Difference]: Finished difference Result 7052 states and 16062 transitions. [2018-11-28 20:15:38,496 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 20:15:38,496 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 92 [2018-11-28 20:15:38,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:15:38,504 INFO L225 Difference]: With dead ends: 7052 [2018-11-28 20:15:38,505 INFO L226 Difference]: Without dead ends: 7052 [2018-11-28 20:15:38,505 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 2 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:15:38,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7052 states. [2018-11-28 20:15:38,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7052 to 5452. [2018-11-28 20:15:38,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5452 states. [2018-11-28 20:15:38,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5452 states to 5452 states and 12506 transitions. [2018-11-28 20:15:38,572 INFO L78 Accepts]: Start accepts. Automaton has 5452 states and 12506 transitions. Word has length 92 [2018-11-28 20:15:38,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:15:38,572 INFO L480 AbstractCegarLoop]: Abstraction has 5452 states and 12506 transitions. [2018-11-28 20:15:38,572 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 20:15:38,572 INFO L276 IsEmpty]: Start isEmpty. Operand 5452 states and 12506 transitions. [2018-11-28 20:15:38,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-11-28 20:15:38,579 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:15:38,579 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 20:15:38,579 INFO L423 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:15:38,580 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:15:38,580 INFO L82 PathProgramCache]: Analyzing trace with hash -2063638176, now seen corresponding path program 1 times [2018-11-28 20:15:38,580 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:15:38,580 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:15:38,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:15:38,581 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:15:38,582 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:15:38,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:15:38,850 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:15:38,852 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:15:38,852 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 20:15:38,853 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 20:15:38,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 20:15:38,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 20:15:38,853 INFO L87 Difference]: Start difference. First operand 5452 states and 12506 transitions. Second operand 5 states. [2018-11-28 20:15:39,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:15:39,436 INFO L93 Difference]: Finished difference Result 9104 states and 21056 transitions. [2018-11-28 20:15:39,436 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-28 20:15:39,437 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 92 [2018-11-28 20:15:39,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:15:39,447 INFO L225 Difference]: With dead ends: 9104 [2018-11-28 20:15:39,447 INFO L226 Difference]: Without dead ends: 9088 [2018-11-28 20:15:39,448 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-11-28 20:15:39,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9088 states. [2018-11-28 20:15:39,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9088 to 6276. [2018-11-28 20:15:39,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6276 states. [2018-11-28 20:15:39,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6276 states to 6276 states and 14440 transitions. [2018-11-28 20:15:39,532 INFO L78 Accepts]: Start accepts. Automaton has 6276 states and 14440 transitions. Word has length 92 [2018-11-28 20:15:39,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:15:39,532 INFO L480 AbstractCegarLoop]: Abstraction has 6276 states and 14440 transitions. [2018-11-28 20:15:39,532 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 20:15:39,532 INFO L276 IsEmpty]: Start isEmpty. Operand 6276 states and 14440 transitions. [2018-11-28 20:15:39,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-11-28 20:15:39,540 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:15:39,541 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] [2018-11-28 20:15:39,541 INFO L423 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:15:39,541 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:15:39,541 INFO L82 PathProgramCache]: Analyzing trace with hash -818873695, now seen corresponding path program 1 times [2018-11-28 20:15:39,541 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:15:39,542 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:15:39,543 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:15:39,544 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:15:39,544 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:15:39,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:15:39,659 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:15:39,659 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:15:39,659 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 20:15:39,660 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 20:15:39,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 20:15:39,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-28 20:15:39,660 INFO L87 Difference]: Start difference. First operand 6276 states and 14440 transitions. Second operand 6 states. [2018-11-28 20:15:40,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:15:40,069 INFO L93 Difference]: Finished difference Result 8414 states and 19086 transitions. [2018-11-28 20:15:40,070 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-28 20:15:40,071 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 92 [2018-11-28 20:15:40,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:15:40,081 INFO L225 Difference]: With dead ends: 8414 [2018-11-28 20:15:40,082 INFO L226 Difference]: Without dead ends: 8414 [2018-11-28 20:15:40,082 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2018-11-28 20:15:40,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8414 states. [2018-11-28 20:15:40,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8414 to 6415. [2018-11-28 20:15:40,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6415 states. [2018-11-28 20:15:40,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6415 states to 6415 states and 14631 transitions. [2018-11-28 20:15:40,167 INFO L78 Accepts]: Start accepts. Automaton has 6415 states and 14631 transitions. Word has length 92 [2018-11-28 20:15:40,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:15:40,168 INFO L480 AbstractCegarLoop]: Abstraction has 6415 states and 14631 transitions. [2018-11-28 20:15:40,168 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 20:15:40,168 INFO L276 IsEmpty]: Start isEmpty. Operand 6415 states and 14631 transitions. [2018-11-28 20:15:40,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-11-28 20:15:40,175 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:15:40,176 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] [2018-11-28 20:15:40,176 INFO L423 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:15:40,176 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:15:40,176 INFO L82 PathProgramCache]: Analyzing trace with hash -1620714257, now seen corresponding path program 1 times [2018-11-28 20:15:40,176 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:15:40,177 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:15:40,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:15:40,178 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:15:40,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:15:40,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:15:40,427 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:15:40,427 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:15:40,427 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-28 20:15:40,428 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-28 20:15:40,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-28 20:15:40,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-11-28 20:15:40,428 INFO L87 Difference]: Start difference. First operand 6415 states and 14631 transitions. Second operand 8 states. [2018-11-28 20:15:40,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:15:40,897 INFO L93 Difference]: Finished difference Result 10090 states and 22670 transitions. [2018-11-28 20:15:40,898 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-28 20:15:40,899 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 92 [2018-11-28 20:15:40,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:15:40,911 INFO L225 Difference]: With dead ends: 10090 [2018-11-28 20:15:40,911 INFO L226 Difference]: Without dead ends: 10090 [2018-11-28 20:15:40,912 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2018-11-28 20:15:40,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10090 states. [2018-11-28 20:15:40,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10090 to 7293. [2018-11-28 20:15:40,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7293 states. [2018-11-28 20:15:41,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7293 states to 7293 states and 16594 transitions. [2018-11-28 20:15:41,008 INFO L78 Accepts]: Start accepts. Automaton has 7293 states and 16594 transitions. Word has length 92 [2018-11-28 20:15:41,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:15:41,009 INFO L480 AbstractCegarLoop]: Abstraction has 7293 states and 16594 transitions. [2018-11-28 20:15:41,009 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-28 20:15:41,009 INFO L276 IsEmpty]: Start isEmpty. Operand 7293 states and 16594 transitions. [2018-11-28 20:15:41,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-11-28 20:15:41,017 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:15:41,017 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:15:41,018 INFO L423 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:15:41,018 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:15:41,018 INFO L82 PathProgramCache]: Analyzing trace with hash -557563760, now seen corresponding path program 1 times [2018-11-28 20:15:41,018 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:15:41,018 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:15:41,020 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:15:41,020 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:15:41,020 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:15:41,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:15:41,759 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:15:41,760 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:15:41,760 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-28 20:15:41,760 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-28 20:15:41,760 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-28 20:15:41,760 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-11-28 20:15:41,761 INFO L87 Difference]: Start difference. First operand 7293 states and 16594 transitions. Second operand 9 states. [2018-11-28 20:15:42,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:15:42,478 INFO L93 Difference]: Finished difference Result 10558 states and 23992 transitions. [2018-11-28 20:15:42,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-11-28 20:15:42,479 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 92 [2018-11-28 20:15:42,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:15:42,492 INFO L225 Difference]: With dead ends: 10558 [2018-11-28 20:15:42,492 INFO L226 Difference]: Without dead ends: 10526 [2018-11-28 20:15:42,492 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=61, Invalid=245, Unknown=0, NotChecked=0, Total=306 [2018-11-28 20:15:42,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10526 states. [2018-11-28 20:15:42,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10526 to 9413. [2018-11-28 20:15:42,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9413 states. [2018-11-28 20:15:42,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9413 states to 9413 states and 21423 transitions. [2018-11-28 20:15:42,595 INFO L78 Accepts]: Start accepts. Automaton has 9413 states and 21423 transitions. Word has length 92 [2018-11-28 20:15:42,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:15:42,595 INFO L480 AbstractCegarLoop]: Abstraction has 9413 states and 21423 transitions. [2018-11-28 20:15:42,595 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-28 20:15:42,595 INFO L276 IsEmpty]: Start isEmpty. Operand 9413 states and 21423 transitions. [2018-11-28 20:15:42,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-11-28 20:15:42,607 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:15:42,607 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] [2018-11-28 20:15:42,607 INFO L423 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:15:42,607 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:15:42,607 INFO L82 PathProgramCache]: Analyzing trace with hash 1940452177, now seen corresponding path program 1 times [2018-11-28 20:15:42,609 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:15:42,610 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:15:42,612 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:15:42,612 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:15:42,612 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:15:42,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:15:42,744 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:15:42,744 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:15:42,744 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-28 20:15:42,745 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-28 20:15:42,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-28 20:15:42,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-11-28 20:15:42,745 INFO L87 Difference]: Start difference. First operand 9413 states and 21423 transitions. Second operand 8 states. [2018-11-28 20:15:44,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:15:44,689 INFO L93 Difference]: Finished difference Result 14313 states and 33272 transitions. [2018-11-28 20:15:44,690 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-28 20:15:44,690 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 92 [2018-11-28 20:15:44,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:15:44,711 INFO L225 Difference]: With dead ends: 14313 [2018-11-28 20:15:44,711 INFO L226 Difference]: Without dead ends: 14313 [2018-11-28 20:15:44,712 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2018-11-28 20:15:44,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14313 states. [2018-11-28 20:15:44,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14313 to 9971. [2018-11-28 20:15:44,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9971 states. [2018-11-28 20:15:44,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9971 states to 9971 states and 22916 transitions. [2018-11-28 20:15:44,919 INFO L78 Accepts]: Start accepts. Automaton has 9971 states and 22916 transitions. Word has length 92 [2018-11-28 20:15:44,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:15:44,920 INFO L480 AbstractCegarLoop]: Abstraction has 9971 states and 22916 transitions. [2018-11-28 20:15:44,920 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-28 20:15:44,920 INFO L276 IsEmpty]: Start isEmpty. Operand 9971 states and 22916 transitions. [2018-11-28 20:15:44,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-11-28 20:15:44,934 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:15:44,934 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] [2018-11-28 20:15:44,936 INFO L423 AbstractCegarLoop]: === Iteration 26 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:15:44,936 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:15:44,936 INFO L82 PathProgramCache]: Analyzing trace with hash -1467011438, now seen corresponding path program 1 times [2018-11-28 20:15:44,936 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:15:44,938 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:15:44,940 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:15:44,940 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:15:44,940 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:15:44,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:15:45,401 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:15:45,401 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:15:45,402 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-28 20:15:45,402 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-28 20:15:45,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-28 20:15:45,402 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-28 20:15:45,403 INFO L87 Difference]: Start difference. First operand 9971 states and 22916 transitions. Second operand 7 states. [2018-11-28 20:15:45,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:15:45,671 INFO L93 Difference]: Finished difference Result 13113 states and 30382 transitions. [2018-11-28 20:15:45,672 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 20:15:45,672 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 92 [2018-11-28 20:15:45,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:15:45,687 INFO L225 Difference]: With dead ends: 13113 [2018-11-28 20:15:45,688 INFO L226 Difference]: Without dead ends: 13113 [2018-11-28 20:15:45,688 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2018-11-28 20:15:45,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13113 states. [2018-11-28 20:15:45,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13113 to 9167. [2018-11-28 20:15:45,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9167 states. [2018-11-28 20:15:45,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9167 states to 9167 states and 20934 transitions. [2018-11-28 20:15:45,815 INFO L78 Accepts]: Start accepts. Automaton has 9167 states and 20934 transitions. Word has length 92 [2018-11-28 20:15:45,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:15:45,815 INFO L480 AbstractCegarLoop]: Abstraction has 9167 states and 20934 transitions. [2018-11-28 20:15:45,815 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-28 20:15:45,815 INFO L276 IsEmpty]: Start isEmpty. Operand 9167 states and 20934 transitions. [2018-11-28 20:15:45,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-11-28 20:15:45,824 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:15:45,825 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] [2018-11-28 20:15:45,825 INFO L423 AbstractCegarLoop]: === Iteration 27 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:15:45,825 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:15:45,825 INFO L82 PathProgramCache]: Analyzing trace with hash 1095980306, now seen corresponding path program 1 times [2018-11-28 20:15:45,825 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:15:45,826 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:15:45,827 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:15:45,827 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:15:45,827 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:15:45,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:15:46,000 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:15:46,000 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:15:46,000 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 20:15:46,001 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 20:15:46,001 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 20:15:46,001 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-28 20:15:46,001 INFO L87 Difference]: Start difference. First operand 9167 states and 20934 transitions. Second operand 6 states. [2018-11-28 20:15:46,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:15:46,142 INFO L93 Difference]: Finished difference Result 8895 states and 19982 transitions. [2018-11-28 20:15:46,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 20:15:46,143 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 92 [2018-11-28 20:15:46,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:15:46,154 INFO L225 Difference]: With dead ends: 8895 [2018-11-28 20:15:46,154 INFO L226 Difference]: Without dead ends: 8895 [2018-11-28 20:15:46,154 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-11-28 20:15:46,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8895 states. [2018-11-28 20:15:46,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8895 to 5299. [2018-11-28 20:15:46,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5299 states. [2018-11-28 20:15:46,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5299 states to 5299 states and 11868 transitions. [2018-11-28 20:15:46,236 INFO L78 Accepts]: Start accepts. Automaton has 5299 states and 11868 transitions. Word has length 92 [2018-11-28 20:15:46,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:15:46,237 INFO L480 AbstractCegarLoop]: Abstraction has 5299 states and 11868 transitions. [2018-11-28 20:15:46,237 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 20:15:46,237 INFO L276 IsEmpty]: Start isEmpty. Operand 5299 states and 11868 transitions. [2018-11-28 20:15:46,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-11-28 20:15:46,243 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:15:46,243 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 20:15:46,244 INFO L423 AbstractCegarLoop]: === Iteration 28 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:15:46,244 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:15:46,244 INFO L82 PathProgramCache]: Analyzing trace with hash 807747209, now seen corresponding path program 1 times [2018-11-28 20:15:46,244 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:15:46,244 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:15:46,246 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:15:46,246 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:15:46,246 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:15:46,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:15:46,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:15:46,381 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:15:46,381 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 20:15:46,381 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 20:15:46,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 20:15:46,382 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-28 20:15:46,382 INFO L87 Difference]: Start difference. First operand 5299 states and 11868 transitions. Second operand 5 states. [2018-11-28 20:15:46,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:15:46,430 INFO L93 Difference]: Finished difference Result 5299 states and 11852 transitions. [2018-11-28 20:15:46,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 20:15:46,431 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 94 [2018-11-28 20:15:46,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:15:46,438 INFO L225 Difference]: With dead ends: 5299 [2018-11-28 20:15:46,438 INFO L226 Difference]: Without dead ends: 5299 [2018-11-28 20:15:46,438 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-11-28 20:15:46,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5299 states. [2018-11-28 20:15:46,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5299 to 5299. [2018-11-28 20:15:46,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5299 states. [2018-11-28 20:15:46,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5299 states to 5299 states and 11852 transitions. [2018-11-28 20:15:46,493 INFO L78 Accepts]: Start accepts. Automaton has 5299 states and 11852 transitions. Word has length 94 [2018-11-28 20:15:46,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:15:46,493 INFO L480 AbstractCegarLoop]: Abstraction has 5299 states and 11852 transitions. [2018-11-28 20:15:46,493 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 20:15:46,493 INFO L276 IsEmpty]: Start isEmpty. Operand 5299 states and 11852 transitions. [2018-11-28 20:15:46,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-11-28 20:15:46,500 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:15:46,500 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 20:15:46,500 INFO L423 AbstractCegarLoop]: === Iteration 29 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:15:46,500 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:15:46,500 INFO L82 PathProgramCache]: Analyzing trace with hash 1695250890, now seen corresponding path program 1 times [2018-11-28 20:15:46,501 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:15:46,501 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:15:46,502 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:15:46,502 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:15:46,502 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:15:46,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:15:46,694 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:15:46,694 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:15:46,695 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-11-28 20:15:46,695 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-28 20:15:46,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-28 20:15:46,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-11-28 20:15:46,696 INFO L87 Difference]: Start difference. First operand 5299 states and 11852 transitions. Second operand 11 states. [2018-11-28 20:15:48,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:15:48,478 INFO L93 Difference]: Finished difference Result 10863 states and 24384 transitions. [2018-11-28 20:15:48,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-28 20:15:48,479 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 94 [2018-11-28 20:15:48,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:15:48,489 INFO L225 Difference]: With dead ends: 10863 [2018-11-28 20:15:48,489 INFO L226 Difference]: Without dead ends: 7648 [2018-11-28 20:15:48,490 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=86, Invalid=376, Unknown=0, NotChecked=0, Total=462 [2018-11-28 20:15:48,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7648 states. [2018-11-28 20:15:48,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7648 to 5389. [2018-11-28 20:15:48,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5389 states. [2018-11-28 20:15:48,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5389 states to 5389 states and 11953 transitions. [2018-11-28 20:15:48,561 INFO L78 Accepts]: Start accepts. Automaton has 5389 states and 11953 transitions. Word has length 94 [2018-11-28 20:15:48,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:15:48,561 INFO L480 AbstractCegarLoop]: Abstraction has 5389 states and 11953 transitions. [2018-11-28 20:15:48,562 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-28 20:15:48,562 INFO L276 IsEmpty]: Start isEmpty. Operand 5389 states and 11953 transitions. [2018-11-28 20:15:48,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-11-28 20:15:48,568 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:15:48,568 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 20:15:48,568 INFO L423 AbstractCegarLoop]: === Iteration 30 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:15:48,569 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:15:48,569 INFO L82 PathProgramCache]: Analyzing trace with hash -1222654462, now seen corresponding path program 2 times [2018-11-28 20:15:48,569 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:15:48,569 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:15:48,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:15:48,571 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:15:48,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:15:48,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 20:15:48,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 20:15:48,651 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-11-28 20:15:48,850 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-11-28 20:15:48,852 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 08:15:48 BasicIcfg [2018-11-28 20:15:48,854 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-28 20:15:48,854 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-28 20:15:48,854 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-28 20:15:48,855 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-28 20:15:48,855 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 08:15:11" (3/4) ... [2018-11-28 20:15:48,861 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-11-28 20:15:49,090 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2018-11-28 20:15:49,095 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-28 20:15:49,096 INFO L168 Benchmark]: Toolchain (without parser) took 39583.31 ms. Allocated memory was 1.0 GB in the beginning and 2.9 GB in the end (delta: 1.8 GB). Free memory was 946.0 MB in the beginning and 1.6 GB in the end (delta: -702.7 MB). Peak memory consumption was 1.1 GB. Max. memory is 11.5 GB. [2018-11-28 20:15:49,099 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 20:15:49,099 INFO L168 Benchmark]: CACSL2BoogieTranslator took 856.78 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 112.7 MB). Free memory was 940.6 MB in the beginning and 1.1 GB in the end (delta: -145.4 MB). Peak memory consumption was 25.9 MB. Max. memory is 11.5 GB. [2018-11-28 20:15:49,099 INFO L168 Benchmark]: Boogie Procedure Inliner took 62.93 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. [2018-11-28 20:15:49,101 INFO L168 Benchmark]: Boogie Preprocessor took 41.85 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:15:49,101 INFO L168 Benchmark]: RCFGBuilder took 1203.95 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.0 MB). Peak memory consumption was 46.0 MB. Max. memory is 11.5 GB. [2018-11-28 20:15:49,101 INFO L168 Benchmark]: TraceAbstraction took 37171.16 ms. Allocated memory was 1.1 GB in the beginning and 2.9 GB in the end (delta: 1.7 GB). Free memory was 1.0 GB in the beginning and 1.7 GB in the end (delta: -653.2 MB). Peak memory consumption was 1.1 GB. Max. memory is 11.5 GB. [2018-11-28 20:15:49,102 INFO L168 Benchmark]: Witness Printer took 241.02 ms. Allocated memory is still 2.9 GB. Free memory was 1.7 GB in the beginning and 1.6 GB in the end (delta: 37.7 MB). Peak memory consumption was 37.7 MB. Max. memory is 11.5 GB. [2018-11-28 20:15:49,107 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.15 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 856.78 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 112.7 MB). Free memory was 940.6 MB in the beginning and 1.1 GB in the end (delta: -145.4 MB). Peak memory consumption was 25.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 62.93 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 41.85 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 1203.95 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.0 MB). Peak memory consumption was 46.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 37171.16 ms. Allocated memory was 1.1 GB in the beginning and 2.9 GB in the end (delta: 1.7 GB). Free memory was 1.0 GB in the beginning and 1.7 GB in the end (delta: -653.2 MB). Peak memory consumption was 1.1 GB. Max. memory is 11.5 GB. * Witness Printer took 241.02 ms. Allocated memory is still 2.9 GB. Free memory was 1.7 GB in the beginning and 1.6 GB in the end (delta: 37.7 MB). Peak memory consumption was 37.7 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L671] -1 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L673] -1 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0] [L674] -1 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0] [L675] -1 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L677] -1 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L679] -1 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L680] -1 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L681] -1 int y$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L682] -1 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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] [L683] -1 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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] [L684] -1 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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] [L685] -1 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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] [L686] -1 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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] [L687] -1 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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] [L688] -1 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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] [L689] -1 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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}] [L690] -1 int y$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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] [L691] -1 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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] [L692] -1 int y$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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] [L693] -1 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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] [L694] -1 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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] [L695] -1 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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] [L768] -1 pthread_t t1447; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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] [L769] FCALL, FORK -1 pthread_create(&t1447, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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] [L699] 0 y$w_buff1 = y$w_buff0 [L700] 0 y$w_buff0 = 1 [L701] 0 y$w_buff1_used = y$w_buff0_used [L702] 0 y$w_buff0_used = (_Bool)1 [L4] COND FALSE 0 !(!expression) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L704] 0 y$r_buff1_thd0 = y$r_buff0_thd0 [L705] 0 y$r_buff1_thd1 = y$r_buff0_thd1 [L706] 0 y$r_buff1_thd2 = y$r_buff0_thd2 [L707] 0 y$r_buff0_thd1 = (_Bool)1 [L710] 0 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L713] EXPR 0 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L770] -1 pthread_t t1448; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L771] FCALL, FORK -1 pthread_create(&t1448, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L727] 1 x = 2 [L730] 1 weak$$choice0 = __VERIFIER_nondet_pointer() [L731] 1 weak$$choice2 = __VERIFIER_nondet_pointer() [L732] 1 y$flush_delayed = weak$$choice2 [L733] 1 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L734] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L713] 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) [L714] EXPR 0 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used VAL [!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L714] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L715] 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 [!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L715] 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 [L716] EXPR 0 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 VAL [!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L716] 0 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L717] 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 [!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L717] 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 [L720] 0 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L734] 1 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L735] EXPR 1 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0))=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L735] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L736] EXPR 1 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1))=0, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L736] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L737] EXPR 1 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used))=0, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L737] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L738] EXPR 1 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L738] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L739] EXPR 1 weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2))=0, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L739] 1 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L740] EXPR 1 weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L740] 1 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L741] 1 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L742] EXPR 1 y$flush_delayed ? y$mem_tmp : y VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$flush_delayed ? y$mem_tmp : y=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L742] 1 y = y$flush_delayed ? y$mem_tmp : y [L743] 1 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L746] 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=1, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L746] EXPR 1 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y=0] [L746] 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=1, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y)=0, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y=0] [L746] 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) [L747] EXPR 1 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=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] [L747] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L748] 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=1, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=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] [L748] 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 [L749] EXPR 1 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=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] [L749] 1 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L750] EXPR 1 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=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] [L750] 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 [L753] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L773] -1 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L777] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L777] EXPR -1 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L777] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L777] -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) [L778] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L778] -1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L779] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L779] -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 [L780] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L780] -1 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L781] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L781] -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 [L784] -1 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L4] COND TRUE -1 !expression VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L4] -1 __VERIFIER_error() VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 221 locations, 3 error locations. UNSAFE Result, 36.9s OverallTime, 30 OverallIterations, 1 TraceHistogramMax, 19.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 7465 SDtfs, 7650 SDslu, 17469 SDs, 0 SdLazy, 6705 SolverSat, 365 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 12.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 297 GetRequests, 77 SyntacticMatches, 27 SemanticMatches, 193 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 228 ImplicationChecksByTransitivity, 6.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=34805occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 7.5s AutomataMinimizationTime, 29 MinimizatonAttempts, 80282 StatesRemovedByMinimization, 27 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 6.0s InterpolantComputationTime, 2191 NumberOfCodeBlocks, 2191 NumberOfCodeBlocksAsserted, 30 NumberOfCheckSat, 2068 ConstructedInterpolants, 0 QuantifiedInterpolants, 434622 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 29 InterpolantComputations, 29 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...