./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/pthread-wmm/rfi004_rmo.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/rfi004_rmo.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 fcb329b6c3e1844226c37897e0522d1de6ff320a ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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:20:29,511 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-28 20:20:29,513 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-28 20:20:29,526 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-28 20:20:29,526 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-28 20:20:29,527 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-28 20:20:29,529 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-28 20:20:29,531 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-28 20:20:29,532 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-28 20:20:29,533 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-28 20:20:29,534 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-28 20:20:29,535 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-28 20:20:29,536 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-28 20:20:29,537 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-28 20:20:29,539 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-28 20:20:29,539 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-28 20:20:29,540 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-28 20:20:29,543 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-28 20:20:29,545 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-28 20:20:29,547 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-28 20:20:29,548 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-28 20:20:29,549 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-28 20:20:29,553 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-28 20:20:29,553 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-28 20:20:29,553 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-28 20:20:29,554 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-28 20:20:29,556 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-28 20:20:29,557 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-28 20:20:29,558 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-28 20:20:29,559 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-28 20:20:29,559 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-28 20:20:29,561 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-28 20:20:29,561 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-28 20:20:29,561 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-28 20:20:29,562 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-28 20:20:29,566 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-28 20:20:29,566 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:20:29,585 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-28 20:20:29,585 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-28 20:20:29,586 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-28 20:20:29,586 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-28 20:20:29,587 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-28 20:20:29,588 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-28 20:20:29,588 INFO L133 SettingsManager]: * Use SBE=true [2018-11-28 20:20:29,588 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-28 20:20:29,588 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-28 20:20:29,588 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-28 20:20:29,588 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-28 20:20:29,589 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-28 20:20:29,590 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-28 20:20:29,590 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-28 20:20:29,590 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-28 20:20:29,590 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-28 20:20:29,590 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-28 20:20:29,590 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-28 20:20:29,591 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-28 20:20:29,591 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-28 20:20:29,591 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-28 20:20:29,591 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-28 20:20:29,591 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-28 20:20:29,592 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-28 20:20:29,593 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-28 20:20:29,593 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-28 20:20:29,593 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-28 20:20:29,594 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-28 20:20:29,594 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-28 20:20:29,594 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-28 20:20:29,595 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 -> fcb329b6c3e1844226c37897e0522d1de6ff320a [2018-11-28 20:20:29,632 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-28 20:20:29,645 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-28 20:20:29,650 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-28 20:20:29,651 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-28 20:20:29,652 INFO L276 PluginConnector]: CDTParser initialized [2018-11-28 20:20:29,653 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/pthread-wmm/rfi004_rmo.oepc_false-unreach-call.i [2018-11-28 20:20:29,718 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b87d81655/0cebfb7a112243968eb402fa4309865c/FLAG90188e7fe [2018-11-28 20:20:30,261 INFO L307 CDTParser]: Found 1 translation units. [2018-11-28 20:20:30,266 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/pthread-wmm/rfi004_rmo.oepc_false-unreach-call.i [2018-11-28 20:20:30,290 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b87d81655/0cebfb7a112243968eb402fa4309865c/FLAG90188e7fe [2018-11-28 20:20:30,526 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b87d81655/0cebfb7a112243968eb402fa4309865c [2018-11-28 20:20:30,529 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-28 20:20:30,531 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-28 20:20:30,532 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-28 20:20:30,533 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-28 20:20:30,537 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-28 20:20:30,538 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 08:20:30" (1/1) ... [2018-11-28 20:20:30,541 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@806a026 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:20:30, skipping insertion in model container [2018-11-28 20:20:30,542 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 08:20:30" (1/1) ... [2018-11-28 20:20:30,550 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-28 20:20:30,603 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-28 20:20:31,145 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 20:20:31,168 INFO L191 MainTranslator]: Completed pre-run [2018-11-28 20:20:31,345 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 20:20:31,435 INFO L195 MainTranslator]: Completed translation [2018-11-28 20:20:31,435 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:20:31 WrapperNode [2018-11-28 20:20:31,436 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-28 20:20:31,436 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-28 20:20:31,437 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-28 20:20:31,437 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-28 20:20:31,447 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:20:31" (1/1) ... [2018-11-28 20:20:31,479 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:20:31" (1/1) ... [2018-11-28 20:20:31,510 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-28 20:20:31,511 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-28 20:20:31,511 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-28 20:20:31,511 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-28 20:20:31,524 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:20:31" (1/1) ... [2018-11-28 20:20:31,524 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:20:31" (1/1) ... [2018-11-28 20:20:31,530 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:20:31" (1/1) ... [2018-11-28 20:20:31,530 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:20:31" (1/1) ... [2018-11-28 20:20:31,547 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:20:31" (1/1) ... [2018-11-28 20:20:31,555 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:20:31" (1/1) ... [2018-11-28 20:20:31,560 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:20:31" (1/1) ... [2018-11-28 20:20:31,564 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-28 20:20:31,567 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-28 20:20:31,571 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-28 20:20:31,572 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-28 20:20:31,573 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:20:31" (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:20:31,633 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-28 20:20:31,634 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-28 20:20:31,634 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2018-11-28 20:20:31,634 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-28 20:20:31,634 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2018-11-28 20:20:31,635 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2018-11-28 20:20:31,635 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2018-11-28 20:20:31,635 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2018-11-28 20:20:31,635 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2018-11-28 20:20:31,635 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-28 20:20:31,635 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-28 20:20:31,637 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:20:32,647 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-28 20:20:32,648 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-11-28 20:20:32,648 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 08:20:32 BoogieIcfgContainer [2018-11-28 20:20:32,649 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-28 20:20:32,652 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-28 20:20:32,652 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-28 20:20:32,655 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-28 20:20:32,655 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 08:20:30" (1/3) ... [2018-11-28 20:20:32,656 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d4cb52b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 08:20:32, skipping insertion in model container [2018-11-28 20:20:32,656 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:20:31" (2/3) ... [2018-11-28 20:20:32,657 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d4cb52b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 08:20:32, skipping insertion in model container [2018-11-28 20:20:32,657 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 08:20:32" (3/3) ... [2018-11-28 20:20:32,659 INFO L112 eAbstractionObserver]: Analyzing ICFG rfi004_rmo.oepc_false-unreach-call.i [2018-11-28 20:20:32,704 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:20:32,704 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:20:32,704 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:20:32,704 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:20:32,705 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:20:32,705 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:20:32,705 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:20:32,705 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:20:32,706 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:20:32,706 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:20:32,706 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:20:32,706 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:20:32,707 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:20:32,707 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:20:32,707 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:20:32,707 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:20:32,707 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:20:32,708 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:20:32,708 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:20:32,708 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:20:32,708 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:20:32,708 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:20:32,709 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:20:32,709 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:20:32,709 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:20:32,709 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:20:32,710 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:20:32,710 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:20:32,710 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:20:32,710 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:20:32,711 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:20:32,711 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:20:32,711 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:20:32,711 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:20:32,712 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:20:32,712 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:20:32,712 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:20:32,712 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:20:32,712 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:20:32,713 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:20:32,713 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:20:32,713 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:20:32,713 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:20:32,713 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:20:32,714 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:20:32,714 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:20:32,714 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:20:32,714 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:20:32,715 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:20:32,715 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:20:32,715 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:20:32,715 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:20:32,715 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:20:32,716 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:20:32,716 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:20:32,716 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:20:32,716 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:20:32,717 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:20:32,717 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:20:32,717 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:20:32,717 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:20:32,717 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:20:32,718 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:20:32,718 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:20:32,718 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:20:32,718 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:20:32,718 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:20:32,719 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:20:32,719 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:20:32,719 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:20:32,719 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:20:32,720 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:20:32,720 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:20:32,720 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:20:32,720 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:20:32,721 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:20:32,721 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:20:32,721 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:20:32,721 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:20:32,721 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:20:32,722 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:20:32,722 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:20:32,722 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:20:32,722 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:20:32,723 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:20:32,723 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:20:32,723 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:20:32,723 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:20:32,723 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:20:32,724 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:20:32,724 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:20:32,724 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:20:32,724 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet26.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:20:32,724 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet26.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:20:32,725 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:20:32,725 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:20:32,725 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet26.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:20:32,725 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet26.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:20:32,726 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:20:32,726 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:20:32,726 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:20:32,726 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:20:32,727 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:20:32,727 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:20:32,727 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:20:32,727 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:20:32,728 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:20:32,728 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:20:32,728 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:20:32,728 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:20:32,728 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:20:32,729 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:20:32,729 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:20:32,729 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:20:32,729 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:20:32,730 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:20:32,730 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:20:32,730 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:20:32,730 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:20:32,731 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:20:32,731 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:20:32,731 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:20:32,731 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:20:32,731 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:20:32,732 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:20:32,732 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:20:32,732 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:20:32,732 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:20:32,733 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:20:32,733 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:20:32,733 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet33.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:20:32,733 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet33.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:20:32,733 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:20:32,733 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:20:32,734 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet33.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:20:32,734 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet33.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:20:32,754 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2018-11-28 20:20:32,754 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-28 20:20:32,765 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-11-28 20:20:32,782 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2018-11-28 20:20:32,806 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-28 20:20:32,807 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-28 20:20:32,807 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-28 20:20:32,807 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-28 20:20:32,807 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-28 20:20:32,807 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-28 20:20:32,807 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-28 20:20:32,807 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-28 20:20:32,808 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-28 20:20:32,821 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 132places, 164 transitions [2018-11-28 20:20:34,734 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 27856 states. [2018-11-28 20:20:34,736 INFO L276 IsEmpty]: Start isEmpty. Operand 27856 states. [2018-11-28 20:20:34,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-11-28 20:20:34,747 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:20:34,748 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] [2018-11-28 20:20:34,751 INFO L423 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:20:34,757 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:20:34,758 INFO L82 PathProgramCache]: Analyzing trace with hash -31372928, now seen corresponding path program 1 times [2018-11-28 20:20:34,760 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:20:34,760 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:20:34,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:20:34,824 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:20:34,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:20:34,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:20:35,165 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:20:35,167 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:20:35,167 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 20:20:35,171 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 20:20:35,183 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 20:20:35,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 20:20:35,187 INFO L87 Difference]: Start difference. First operand 27856 states. Second operand 4 states. [2018-11-28 20:20:36,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:20:36,425 INFO L93 Difference]: Finished difference Result 47768 states and 183119 transitions. [2018-11-28 20:20:36,426 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 20:20:36,428 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 39 [2018-11-28 20:20:36,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:20:36,814 INFO L225 Difference]: With dead ends: 47768 [2018-11-28 20:20:36,814 INFO L226 Difference]: Without dead ends: 34608 [2018-11-28 20:20:36,816 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 20:20:37,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34608 states. [2018-11-28 20:20:38,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34608 to 21756. [2018-11-28 20:20:38,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21756 states. [2018-11-28 20:20:38,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21756 states to 21756 states and 83441 transitions. [2018-11-28 20:20:38,414 INFO L78 Accepts]: Start accepts. Automaton has 21756 states and 83441 transitions. Word has length 39 [2018-11-28 20:20:38,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:20:38,415 INFO L480 AbstractCegarLoop]: Abstraction has 21756 states and 83441 transitions. [2018-11-28 20:20:38,415 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 20:20:38,415 INFO L276 IsEmpty]: Start isEmpty. Operand 21756 states and 83441 transitions. [2018-11-28 20:20:38,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-11-28 20:20:38,441 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:20:38,444 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:20:38,444 INFO L423 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:20:38,445 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:20:38,445 INFO L82 PathProgramCache]: Analyzing trace with hash -954263015, now seen corresponding path program 1 times [2018-11-28 20:20:38,445 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:20:38,445 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:20:38,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:20:38,453 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:20:38,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:20:38,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:20:38,685 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:20:38,685 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:20:38,686 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 20:20:38,687 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 20:20:38,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 20:20:38,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 20:20:38,690 INFO L87 Difference]: Start difference. First operand 21756 states and 83441 transitions. Second operand 4 states. [2018-11-28 20:20:39,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:20:39,151 INFO L93 Difference]: Finished difference Result 7170 states and 23626 transitions. [2018-11-28 20:20:39,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 20:20:39,152 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 47 [2018-11-28 20:20:39,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:20:39,178 INFO L225 Difference]: With dead ends: 7170 [2018-11-28 20:20:39,179 INFO L226 Difference]: Without dead ends: 6324 [2018-11-28 20:20:39,180 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:20:39,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6324 states. [2018-11-28 20:20:39,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6324 to 6324. [2018-11-28 20:20:39,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6324 states. [2018-11-28 20:20:39,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6324 states to 6324 states and 20698 transitions. [2018-11-28 20:20:39,402 INFO L78 Accepts]: Start accepts. Automaton has 6324 states and 20698 transitions. Word has length 47 [2018-11-28 20:20:39,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:20:39,403 INFO L480 AbstractCegarLoop]: Abstraction has 6324 states and 20698 transitions. [2018-11-28 20:20:39,403 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 20:20:39,403 INFO L276 IsEmpty]: Start isEmpty. Operand 6324 states and 20698 transitions. [2018-11-28 20:20:39,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-11-28 20:20:39,406 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:20:39,406 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] [2018-11-28 20:20:39,406 INFO L423 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:20:39,408 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:20:39,408 INFO L82 PathProgramCache]: Analyzing trace with hash 1367871073, now seen corresponding path program 1 times [2018-11-28 20:20:39,408 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:20:39,408 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:20:39,420 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:20:39,421 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:20:39,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:20:39,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:20:39,740 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:20:39,741 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:20:39,741 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 20:20:39,742 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 20:20:39,742 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 20:20:39,742 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 20:20:39,743 INFO L87 Difference]: Start difference. First operand 6324 states and 20698 transitions. Second operand 5 states. [2018-11-28 20:20:42,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:20:42,083 INFO L93 Difference]: Finished difference Result 12020 states and 38784 transitions. [2018-11-28 20:20:42,088 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 20:20:42,089 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 48 [2018-11-28 20:20:42,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:20:42,134 INFO L225 Difference]: With dead ends: 12020 [2018-11-28 20:20:42,134 INFO L226 Difference]: Without dead ends: 11945 [2018-11-28 20:20:42,135 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:20:42,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11945 states. [2018-11-28 20:20:42,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11945 to 8289. [2018-11-28 20:20:42,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8289 states. [2018-11-28 20:20:42,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8289 states to 8289 states and 26551 transitions. [2018-11-28 20:20:42,389 INFO L78 Accepts]: Start accepts. Automaton has 8289 states and 26551 transitions. Word has length 48 [2018-11-28 20:20:42,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:20:42,393 INFO L480 AbstractCegarLoop]: Abstraction has 8289 states and 26551 transitions. [2018-11-28 20:20:42,394 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 20:20:42,394 INFO L276 IsEmpty]: Start isEmpty. Operand 8289 states and 26551 transitions. [2018-11-28 20:20:42,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-11-28 20:20:42,397 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:20:42,397 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] [2018-11-28 20:20:42,397 INFO L423 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:20:42,397 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:20:42,398 INFO L82 PathProgramCache]: Analyzing trace with hash -1372813561, now seen corresponding path program 1 times [2018-11-28 20:20:42,398 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:20:42,398 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:20:42,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:20:42,402 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:20:42,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:20:42,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:20:42,510 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:20:42,510 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:20:42,510 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 20:20:42,511 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 20:20:42,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 20:20:42,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 20:20:42,511 INFO L87 Difference]: Start difference. First operand 8289 states and 26551 transitions. Second operand 3 states. [2018-11-28 20:20:42,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:20:42,755 INFO L93 Difference]: Finished difference Result 10985 states and 34706 transitions. [2018-11-28 20:20:42,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 20:20:42,756 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2018-11-28 20:20:42,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:20:42,791 INFO L225 Difference]: With dead ends: 10985 [2018-11-28 20:20:42,791 INFO L226 Difference]: Without dead ends: 10981 [2018-11-28 20:20:42,792 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:20:42,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10981 states. [2018-11-28 20:20:42,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10981 to 8507. [2018-11-28 20:20:42,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8507 states. [2018-11-28 20:20:43,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8507 states to 8507 states and 26987 transitions. [2018-11-28 20:20:43,026 INFO L78 Accepts]: Start accepts. Automaton has 8507 states and 26987 transitions. Word has length 50 [2018-11-28 20:20:43,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:20:43,028 INFO L480 AbstractCegarLoop]: Abstraction has 8507 states and 26987 transitions. [2018-11-28 20:20:43,028 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 20:20:43,028 INFO L276 IsEmpty]: Start isEmpty. Operand 8507 states and 26987 transitions. [2018-11-28 20:20:43,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-11-28 20:20:43,031 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:20:43,031 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] [2018-11-28 20:20:43,032 INFO L423 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:20:43,032 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:20:43,032 INFO L82 PathProgramCache]: Analyzing trace with hash 1505170194, now seen corresponding path program 1 times [2018-11-28 20:20:43,032 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:20:43,032 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:20:43,036 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:20:43,036 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:20:43,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:20:43,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:20:43,417 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:20:43,418 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:20:43,418 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 20:20:43,418 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 20:20:43,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 20:20:43,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-28 20:20:43,419 INFO L87 Difference]: Start difference. First operand 8507 states and 26987 transitions. Second operand 6 states. [2018-11-28 20:20:44,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:20:44,094 INFO L93 Difference]: Finished difference Result 11923 states and 37198 transitions. [2018-11-28 20:20:44,099 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-28 20:20:44,099 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 54 [2018-11-28 20:20:44,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:20:44,139 INFO L225 Difference]: With dead ends: 11923 [2018-11-28 20:20:44,140 INFO L226 Difference]: Without dead ends: 11826 [2018-11-28 20:20:44,140 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2018-11-28 20:20:44,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11826 states. [2018-11-28 20:20:44,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11826 to 9281. [2018-11-28 20:20:44,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9281 states. [2018-11-28 20:20:44,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9281 states to 9281 states and 29431 transitions. [2018-11-28 20:20:44,384 INFO L78 Accepts]: Start accepts. Automaton has 9281 states and 29431 transitions. Word has length 54 [2018-11-28 20:20:44,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:20:44,385 INFO L480 AbstractCegarLoop]: Abstraction has 9281 states and 29431 transitions. [2018-11-28 20:20:44,385 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 20:20:44,385 INFO L276 IsEmpty]: Start isEmpty. Operand 9281 states and 29431 transitions. [2018-11-28 20:20:44,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-11-28 20:20:44,395 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:20:44,395 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] [2018-11-28 20:20:44,395 INFO L423 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:20:44,395 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:20:44,397 INFO L82 PathProgramCache]: Analyzing trace with hash 2067258406, now seen corresponding path program 1 times [2018-11-28 20:20:44,397 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:20:44,397 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:20:44,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:20:44,400 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:20:44,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:20:44,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:20:44,571 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:20:44,571 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:20:44,572 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 20:20:44,572 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 20:20:44,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 20:20:44,572 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 20:20:44,574 INFO L87 Difference]: Start difference. First operand 9281 states and 29431 transitions. Second operand 4 states. [2018-11-28 20:20:45,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:20:45,055 INFO L93 Difference]: Finished difference Result 10900 states and 34382 transitions. [2018-11-28 20:20:45,056 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 20:20:45,056 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 64 [2018-11-28 20:20:45,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:20:45,079 INFO L225 Difference]: With dead ends: 10900 [2018-11-28 20:20:45,080 INFO L226 Difference]: Without dead ends: 10900 [2018-11-28 20:20:45,080 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:20:45,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10900 states. [2018-11-28 20:20:45,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10900 to 9932. [2018-11-28 20:20:45,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9932 states. [2018-11-28 20:20:45,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9932 states to 9932 states and 31408 transitions. [2018-11-28 20:20:45,329 INFO L78 Accepts]: Start accepts. Automaton has 9932 states and 31408 transitions. Word has length 64 [2018-11-28 20:20:45,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:20:45,329 INFO L480 AbstractCegarLoop]: Abstraction has 9932 states and 31408 transitions. [2018-11-28 20:20:45,329 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 20:20:45,329 INFO L276 IsEmpty]: Start isEmpty. Operand 9932 states and 31408 transitions. [2018-11-28 20:20:45,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-11-28 20:20:45,341 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:20:45,341 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] [2018-11-28 20:20:45,341 INFO L423 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:20:45,341 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:20:45,342 INFO L82 PathProgramCache]: Analyzing trace with hash -484898555, now seen corresponding path program 1 times [2018-11-28 20:20:45,342 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:20:45,342 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:20:45,344 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:20:45,344 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:20:45,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:20:45,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:20:45,486 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:20:45,487 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:20:45,487 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 20:20:45,487 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 20:20:45,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 20:20:45,488 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-28 20:20:45,488 INFO L87 Difference]: Start difference. First operand 9932 states and 31408 transitions. Second operand 6 states. [2018-11-28 20:20:46,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:20:46,475 INFO L93 Difference]: Finished difference Result 21763 states and 67780 transitions. [2018-11-28 20:20:46,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-28 20:20:46,478 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 64 [2018-11-28 20:20:46,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:20:46,520 INFO L225 Difference]: With dead ends: 21763 [2018-11-28 20:20:46,520 INFO L226 Difference]: Without dead ends: 21699 [2018-11-28 20:20:46,521 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2018-11-28 20:20:46,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21699 states. [2018-11-28 20:20:46,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21699 to 13157. [2018-11-28 20:20:46,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13157 states. [2018-11-28 20:20:46,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13157 states to 13157 states and 40989 transitions. [2018-11-28 20:20:46,949 INFO L78 Accepts]: Start accepts. Automaton has 13157 states and 40989 transitions. Word has length 64 [2018-11-28 20:20:46,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:20:46,950 INFO L480 AbstractCegarLoop]: Abstraction has 13157 states and 40989 transitions. [2018-11-28 20:20:46,950 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 20:20:46,950 INFO L276 IsEmpty]: Start isEmpty. Operand 13157 states and 40989 transitions. [2018-11-28 20:20:46,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-11-28 20:20:46,967 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:20:46,967 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] [2018-11-28 20:20:46,967 INFO L423 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:20:46,968 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:20:46,968 INFO L82 PathProgramCache]: Analyzing trace with hash 708445986, now seen corresponding path program 1 times [2018-11-28 20:20:46,968 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:20:46,968 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:20:46,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:20:46,973 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:20:46,974 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:20:46,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:20:47,284 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:20:47,284 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:20:47,284 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 20:20:47,285 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 20:20:47,285 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 20:20:47,285 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-28 20:20:47,285 INFO L87 Difference]: Start difference. First operand 13157 states and 40989 transitions. Second operand 5 states. [2018-11-28 20:20:47,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:20:47,916 INFO L93 Difference]: Finished difference Result 19275 states and 58649 transitions. [2018-11-28 20:20:47,917 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 20:20:47,917 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 66 [2018-11-28 20:20:47,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:20:47,955 INFO L225 Difference]: With dead ends: 19275 [2018-11-28 20:20:47,956 INFO L226 Difference]: Without dead ends: 19275 [2018-11-28 20:20:47,956 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-11-28 20:20:48,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19275 states. [2018-11-28 20:20:48,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19275 to 14988. [2018-11-28 20:20:48,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14988 states. [2018-11-28 20:20:48,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14988 states to 14988 states and 46076 transitions. [2018-11-28 20:20:48,366 INFO L78 Accepts]: Start accepts. Automaton has 14988 states and 46076 transitions. Word has length 66 [2018-11-28 20:20:48,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:20:48,366 INFO L480 AbstractCegarLoop]: Abstraction has 14988 states and 46076 transitions. [2018-11-28 20:20:48,366 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 20:20:48,367 INFO L276 IsEmpty]: Start isEmpty. Operand 14988 states and 46076 transitions. [2018-11-28 20:20:48,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-11-28 20:20:48,392 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:20:48,392 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] [2018-11-28 20:20:48,392 INFO L423 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:20:48,393 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:20:48,393 INFO L82 PathProgramCache]: Analyzing trace with hash 497095073, now seen corresponding path program 1 times [2018-11-28 20:20:48,393 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:20:48,393 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:20:48,395 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:20:48,395 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:20:48,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:20:48,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:20:48,580 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:20:48,580 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:20:48,580 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 20:20:48,581 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 20:20:48,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 20:20:48,581 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 20:20:48,581 INFO L87 Difference]: Start difference. First operand 14988 states and 46076 transitions. Second operand 4 states. [2018-11-28 20:20:49,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:20:49,300 INFO L93 Difference]: Finished difference Result 18810 states and 57063 transitions. [2018-11-28 20:20:49,301 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 20:20:49,301 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2018-11-28 20:20:49,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:20:49,339 INFO L225 Difference]: With dead ends: 18810 [2018-11-28 20:20:49,339 INFO L226 Difference]: Without dead ends: 18810 [2018-11-28 20:20:49,340 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 20:20:49,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18810 states. [2018-11-28 20:20:49,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18810 to 15263. [2018-11-28 20:20:49,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15263 states. [2018-11-28 20:20:49,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15263 states to 15263 states and 46864 transitions. [2018-11-28 20:20:49,708 INFO L78 Accepts]: Start accepts. Automaton has 15263 states and 46864 transitions. Word has length 66 [2018-11-28 20:20:49,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:20:49,708 INFO L480 AbstractCegarLoop]: Abstraction has 15263 states and 46864 transitions. [2018-11-28 20:20:49,708 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 20:20:49,708 INFO L276 IsEmpty]: Start isEmpty. Operand 15263 states and 46864 transitions. [2018-11-28 20:20:49,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-11-28 20:20:49,745 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:20:49,745 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] [2018-11-28 20:20:49,746 INFO L423 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:20:49,746 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:20:49,746 INFO L82 PathProgramCache]: Analyzing trace with hash -1580114270, now seen corresponding path program 1 times [2018-11-28 20:20:49,746 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:20:49,746 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:20:49,748 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:20:49,751 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:20:49,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:20:49,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:20:49,915 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:20:49,916 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:20:49,916 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 20:20:49,916 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 20:20:49,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 20:20:49,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 20:20:49,917 INFO L87 Difference]: Start difference. First operand 15263 states and 46864 transitions. Second operand 3 states. [2018-11-28 20:20:50,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:20:50,323 INFO L93 Difference]: Finished difference Result 15699 states and 48054 transitions. [2018-11-28 20:20:50,323 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 20:20:50,323 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2018-11-28 20:20:50,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:20:50,354 INFO L225 Difference]: With dead ends: 15699 [2018-11-28 20:20:50,355 INFO L226 Difference]: Without dead ends: 15699 [2018-11-28 20:20:50,355 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 20:20:50,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15699 states. [2018-11-28 20:20:50,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15699 to 15481. [2018-11-28 20:20:50,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15481 states. [2018-11-28 20:20:50,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15481 states to 15481 states and 47432 transitions. [2018-11-28 20:20:50,661 INFO L78 Accepts]: Start accepts. Automaton has 15481 states and 47432 transitions. Word has length 66 [2018-11-28 20:20:50,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:20:50,661 INFO L480 AbstractCegarLoop]: Abstraction has 15481 states and 47432 transitions. [2018-11-28 20:20:50,661 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 20:20:50,661 INFO L276 IsEmpty]: Start isEmpty. Operand 15481 states and 47432 transitions. [2018-11-28 20:20:50,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-11-28 20:20:50,699 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:20:50,699 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] [2018-11-28 20:20:50,699 INFO L423 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:20:50,699 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:20:50,700 INFO L82 PathProgramCache]: Analyzing trace with hash -1496622296, now seen corresponding path program 1 times [2018-11-28 20:20:50,700 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:20:50,700 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:20:50,704 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:20:50,704 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:20:50,704 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:20:50,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:20:50,867 WARN L180 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-11-28 20:20:51,062 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:20:51,062 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:20:51,062 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 20:20:51,063 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 20:20:51,063 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 20:20:51,063 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-28 20:20:51,064 INFO L87 Difference]: Start difference. First operand 15481 states and 47432 transitions. Second operand 6 states. [2018-11-28 20:20:52,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:20:52,356 INFO L93 Difference]: Finished difference Result 18701 states and 56367 transitions. [2018-11-28 20:20:52,357 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 20:20:52,357 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 68 [2018-11-28 20:20:52,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:20:52,389 INFO L225 Difference]: With dead ends: 18701 [2018-11-28 20:20:52,389 INFO L226 Difference]: Without dead ends: 18701 [2018-11-28 20:20:52,390 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-11-28 20:20:52,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18701 states. [2018-11-28 20:20:52,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18701 to 17377. [2018-11-28 20:20:52,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17377 states. [2018-11-28 20:20:53,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17377 states to 17377 states and 52698 transitions. [2018-11-28 20:20:53,037 INFO L78 Accepts]: Start accepts. Automaton has 17377 states and 52698 transitions. Word has length 68 [2018-11-28 20:20:53,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:20:53,037 INFO L480 AbstractCegarLoop]: Abstraction has 17377 states and 52698 transitions. [2018-11-28 20:20:53,037 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 20:20:53,037 INFO L276 IsEmpty]: Start isEmpty. Operand 17377 states and 52698 transitions. [2018-11-28 20:20:53,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-11-28 20:20:53,059 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:20:53,059 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] [2018-11-28 20:20:53,060 INFO L423 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:20:53,060 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:20:53,060 INFO L82 PathProgramCache]: Analyzing trace with hash 721135657, now seen corresponding path program 1 times [2018-11-28 20:20:53,060 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:20:53,060 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:20:53,064 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:20:53,064 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:20:53,064 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:20:53,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:20:53,484 WARN L180 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 10 [2018-11-28 20:20:53,579 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:20:53,579 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:20:53,579 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 20:20:53,580 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 20:20:53,580 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 20:20:53,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-28 20:20:53,580 INFO L87 Difference]: Start difference. First operand 17377 states and 52698 transitions. Second operand 6 states. [2018-11-28 20:20:54,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:20:54,105 INFO L93 Difference]: Finished difference Result 19150 states and 57148 transitions. [2018-11-28 20:20:54,106 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-28 20:20:54,106 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 68 [2018-11-28 20:20:54,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:20:54,142 INFO L225 Difference]: With dead ends: 19150 [2018-11-28 20:20:54,142 INFO L226 Difference]: Without dead ends: 19150 [2018-11-28 20:20:54,143 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2018-11-28 20:20:54,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19150 states. [2018-11-28 20:20:54,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19150 to 17509. [2018-11-28 20:20:54,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17509 states. [2018-11-28 20:20:54,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17509 states to 17509 states and 52637 transitions. [2018-11-28 20:20:54,415 INFO L78 Accepts]: Start accepts. Automaton has 17509 states and 52637 transitions. Word has length 68 [2018-11-28 20:20:54,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:20:54,415 INFO L480 AbstractCegarLoop]: Abstraction has 17509 states and 52637 transitions. [2018-11-28 20:20:54,415 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 20:20:54,416 INFO L276 IsEmpty]: Start isEmpty. Operand 17509 states and 52637 transitions. [2018-11-28 20:20:54,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-11-28 20:20:54,434 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:20:54,434 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] [2018-11-28 20:20:54,434 INFO L423 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:20:54,435 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:20:54,435 INFO L82 PathProgramCache]: Analyzing trace with hash 932486570, now seen corresponding path program 1 times [2018-11-28 20:20:54,435 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:20:54,435 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:20:54,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:20:54,437 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:20:54,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:20:54,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:20:54,581 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:20:54,582 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:20:54,582 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 20:20:54,582 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 20:20:54,582 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 20:20:54,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 20:20:54,583 INFO L87 Difference]: Start difference. First operand 17509 states and 52637 transitions. Second operand 5 states. [2018-11-28 20:20:55,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:20:55,685 INFO L93 Difference]: Finished difference Result 21589 states and 64352 transitions. [2018-11-28 20:20:55,685 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 20:20:55,685 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 68 [2018-11-28 20:20:55,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:20:55,728 INFO L225 Difference]: With dead ends: 21589 [2018-11-28 20:20:55,728 INFO L226 Difference]: Without dead ends: 21589 [2018-11-28 20:20:55,728 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-11-28 20:20:55,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21589 states. [2018-11-28 20:20:55,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21589 to 18595. [2018-11-28 20:20:55,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18595 states. [2018-11-28 20:20:56,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18595 states to 18595 states and 55396 transitions. [2018-11-28 20:20:56,003 INFO L78 Accepts]: Start accepts. Automaton has 18595 states and 55396 transitions. Word has length 68 [2018-11-28 20:20:56,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:20:56,003 INFO L480 AbstractCegarLoop]: Abstraction has 18595 states and 55396 transitions. [2018-11-28 20:20:56,003 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 20:20:56,003 INFO L276 IsEmpty]: Start isEmpty. Operand 18595 states and 55396 transitions. [2018-11-28 20:20:56,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-11-28 20:20:56,022 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:20:56,022 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] [2018-11-28 20:20:56,023 INFO L423 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:20:56,023 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:20:56,023 INFO L82 PathProgramCache]: Analyzing trace with hash 421952393, now seen corresponding path program 1 times [2018-11-28 20:20:56,023 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:20:56,023 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:20:56,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:20:56,025 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:20:56,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:20:56,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:20:56,232 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:20:56,232 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:20:56,232 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 20:20:56,233 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 20:20:56,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 20:20:56,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 20:20:56,234 INFO L87 Difference]: Start difference. First operand 18595 states and 55396 transitions. Second operand 5 states. [2018-11-28 20:20:56,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:20:56,814 INFO L93 Difference]: Finished difference Result 27216 states and 80202 transitions. [2018-11-28 20:20:56,815 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-28 20:20:56,815 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 68 [2018-11-28 20:20:56,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:20:56,867 INFO L225 Difference]: With dead ends: 27216 [2018-11-28 20:20:56,867 INFO L226 Difference]: Without dead ends: 27216 [2018-11-28 20:20:56,868 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-11-28 20:20:56,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27216 states. [2018-11-28 20:20:57,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27216 to 21398. [2018-11-28 20:20:57,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21398 states. [2018-11-28 20:20:57,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21398 states to 21398 states and 63361 transitions. [2018-11-28 20:20:57,268 INFO L78 Accepts]: Start accepts. Automaton has 21398 states and 63361 transitions. Word has length 68 [2018-11-28 20:20:57,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:20:57,268 INFO L480 AbstractCegarLoop]: Abstraction has 21398 states and 63361 transitions. [2018-11-28 20:20:57,269 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 20:20:57,269 INFO L276 IsEmpty]: Start isEmpty. Operand 21398 states and 63361 transitions. [2018-11-28 20:20:57,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-11-28 20:20:57,286 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:20:57,287 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:57,287 INFO L423 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:20:57,287 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:20:57,287 INFO L82 PathProgramCache]: Analyzing trace with hash -1385502070, now seen corresponding path program 1 times [2018-11-28 20:20:57,288 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:20:57,288 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:20:57,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:20:57,290 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:20:57,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:20:57,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:20:57,566 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:20:57,567 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:20:57,567 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 20:20:57,567 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 20:20:57,567 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 20:20:57,568 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-28 20:20:57,568 INFO L87 Difference]: Start difference. First operand 21398 states and 63361 transitions. Second operand 6 states. [2018-11-28 20:20:58,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:20:58,608 INFO L93 Difference]: Finished difference Result 35018 states and 103808 transitions. [2018-11-28 20:20:58,608 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-28 20:20:58,608 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 68 [2018-11-28 20:20:58,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:20:58,680 INFO L225 Difference]: With dead ends: 35018 [2018-11-28 20:20:58,680 INFO L226 Difference]: Without dead ends: 35018 [2018-11-28 20:20:58,681 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-11-28 20:20:58,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35018 states. [2018-11-28 20:20:59,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35018 to 27706. [2018-11-28 20:20:59,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27706 states. [2018-11-28 20:20:59,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27706 states to 27706 states and 83160 transitions. [2018-11-28 20:20:59,387 INFO L78 Accepts]: Start accepts. Automaton has 27706 states and 83160 transitions. Word has length 68 [2018-11-28 20:20:59,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:20:59,387 INFO L480 AbstractCegarLoop]: Abstraction has 27706 states and 83160 transitions. [2018-11-28 20:20:59,387 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 20:20:59,387 INFO L276 IsEmpty]: Start isEmpty. Operand 27706 states and 83160 transitions. [2018-11-28 20:20:59,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-11-28 20:20:59,408 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:20:59,408 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] [2018-11-28 20:20:59,409 INFO L423 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:20:59,409 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:20:59,409 INFO L82 PathProgramCache]: Analyzing trace with hash -497998389, now seen corresponding path program 1 times [2018-11-28 20:20:59,409 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:20:59,409 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:20:59,411 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:20:59,411 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:20:59,411 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:20:59,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:20:59,558 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:20:59,559 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:20:59,559 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 20:20:59,559 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 20:20:59,559 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 20:20:59,559 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 20:20:59,560 INFO L87 Difference]: Start difference. First operand 27706 states and 83160 transitions. Second operand 4 states. [2018-11-28 20:21:00,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:21:00,162 INFO L93 Difference]: Finished difference Result 30486 states and 90397 transitions. [2018-11-28 20:21:00,163 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 20:21:00,163 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 68 [2018-11-28 20:21:00,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:21:00,216 INFO L225 Difference]: With dead ends: 30486 [2018-11-28 20:21:00,216 INFO L226 Difference]: Without dead ends: 29906 [2018-11-28 20:21:00,217 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 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:21:00,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29906 states. [2018-11-28 20:21:00,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29906 to 27610. [2018-11-28 20:21:00,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27610 states. [2018-11-28 20:21:00,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27610 states to 27610 states and 82079 transitions. [2018-11-28 20:21:00,691 INFO L78 Accepts]: Start accepts. Automaton has 27610 states and 82079 transitions. Word has length 68 [2018-11-28 20:21:00,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:21:00,692 INFO L480 AbstractCegarLoop]: Abstraction has 27610 states and 82079 transitions. [2018-11-28 20:21:00,692 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 20:21:00,692 INFO L276 IsEmpty]: Start isEmpty. Operand 27610 states and 82079 transitions. [2018-11-28 20:21:00,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-11-28 20:21:00,712 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:21:00,713 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 20:21:00,713 INFO L423 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:21:00,713 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:21:00,713 INFO L82 PathProgramCache]: Analyzing trace with hash 1112513867, now seen corresponding path program 1 times [2018-11-28 20:21:00,713 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:21:00,713 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:21:00,717 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:21:00,718 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:21:00,718 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:21:00,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:21:00,999 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:21:00,999 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:21:00,999 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-28 20:21:01,000 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-28 20:21:01,000 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-28 20:21:01,000 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-11-28 20:21:01,000 INFO L87 Difference]: Start difference. First operand 27610 states and 82079 transitions. Second operand 9 states. [2018-11-28 20:21:01,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:21:01,817 INFO L93 Difference]: Finished difference Result 34850 states and 102928 transitions. [2018-11-28 20:21:01,818 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-28 20:21:01,818 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 68 [2018-11-28 20:21:01,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:21:01,876 INFO L225 Difference]: With dead ends: 34850 [2018-11-28 20:21:01,876 INFO L226 Difference]: Without dead ends: 34850 [2018-11-28 20:21:01,876 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2018-11-28 20:21:01,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34850 states. [2018-11-28 20:21:02,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34850 to 29288. [2018-11-28 20:21:02,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29288 states. [2018-11-28 20:21:02,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29288 states to 29288 states and 87100 transitions. [2018-11-28 20:21:02,756 INFO L78 Accepts]: Start accepts. Automaton has 29288 states and 87100 transitions. Word has length 68 [2018-11-28 20:21:02,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:21:02,756 INFO L480 AbstractCegarLoop]: Abstraction has 29288 states and 87100 transitions. [2018-11-28 20:21:02,756 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-28 20:21:02,756 INFO L276 IsEmpty]: Start isEmpty. Operand 29288 states and 87100 transitions. [2018-11-28 20:21:02,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-11-28 20:21:02,784 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:21:02,784 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] [2018-11-28 20:21:02,785 INFO L423 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:21:02,785 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:21:02,785 INFO L82 PathProgramCache]: Analyzing trace with hash 2000017548, now seen corresponding path program 1 times [2018-11-28 20:21:02,785 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:21:02,785 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:21:02,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:21:02,790 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:21:02,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:21:02,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:21:03,061 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:21:03,061 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:21:03,062 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 20:21:03,062 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 20:21:03,062 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 20:21:03,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-28 20:21:03,064 INFO L87 Difference]: Start difference. First operand 29288 states and 87100 transitions. Second operand 5 states. [2018-11-28 20:21:03,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:21:03,205 INFO L93 Difference]: Finished difference Result 7664 states and 18502 transitions. [2018-11-28 20:21:03,205 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 20:21:03,205 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 68 [2018-11-28 20:21:03,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:21:03,213 INFO L225 Difference]: With dead ends: 7664 [2018-11-28 20:21:03,213 INFO L226 Difference]: Without dead ends: 5913 [2018-11-28 20:21:03,214 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-11-28 20:21:03,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5913 states. [2018-11-28 20:21:03,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5913 to 4971. [2018-11-28 20:21:03,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4971 states. [2018-11-28 20:21:03,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4971 states to 4971 states and 11771 transitions. [2018-11-28 20:21:03,272 INFO L78 Accepts]: Start accepts. Automaton has 4971 states and 11771 transitions. Word has length 68 [2018-11-28 20:21:03,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:21:03,273 INFO L480 AbstractCegarLoop]: Abstraction has 4971 states and 11771 transitions. [2018-11-28 20:21:03,273 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 20:21:03,273 INFO L276 IsEmpty]: Start isEmpty. Operand 4971 states and 11771 transitions. [2018-11-28 20:21:03,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-11-28 20:21:03,280 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:21:03,280 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] [2018-11-28 20:21:03,280 INFO L423 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:21:03,281 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:21:03,281 INFO L82 PathProgramCache]: Analyzing trace with hash 1506475877, now seen corresponding path program 1 times [2018-11-28 20:21:03,281 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:21:03,281 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:21:03,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:21:03,285 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:21:03,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:21:03,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:21:03,457 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:21:03,458 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:21:03,458 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 20:21:03,458 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 20:21:03,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 20:21:03,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 20:21:03,459 INFO L87 Difference]: Start difference. First operand 4971 states and 11771 transitions. Second operand 5 states. [2018-11-28 20:21:03,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:21:03,740 INFO L93 Difference]: Finished difference Result 6177 states and 14425 transitions. [2018-11-28 20:21:03,741 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-28 20:21:03,742 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 83 [2018-11-28 20:21:03,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:21:03,749 INFO L225 Difference]: With dead ends: 6177 [2018-11-28 20:21:03,749 INFO L226 Difference]: Without dead ends: 6143 [2018-11-28 20:21:03,750 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-11-28 20:21:03,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6143 states. [2018-11-28 20:21:03,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6143 to 5262. [2018-11-28 20:21:03,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5262 states. [2018-11-28 20:21:03,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5262 states to 5262 states and 12356 transitions. [2018-11-28 20:21:03,813 INFO L78 Accepts]: Start accepts. Automaton has 5262 states and 12356 transitions. Word has length 83 [2018-11-28 20:21:03,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:21:03,814 INFO L480 AbstractCegarLoop]: Abstraction has 5262 states and 12356 transitions. [2018-11-28 20:21:03,814 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 20:21:03,814 INFO L276 IsEmpty]: Start isEmpty. Operand 5262 states and 12356 transitions. [2018-11-28 20:21:03,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-11-28 20:21:03,819 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:21:03,820 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] [2018-11-28 20:21:03,820 INFO L423 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:21:03,820 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:21:03,820 INFO L82 PathProgramCache]: Analyzing trace with hash 2085068750, now seen corresponding path program 1 times [2018-11-28 20:21:03,820 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:21:03,820 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:21:03,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:21:03,826 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:21:03,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:21:03,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:21:04,333 WARN L180 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 10 [2018-11-28 20:21:04,347 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:21:04,348 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:21:04,348 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 20:21:04,348 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 20:21:04,348 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 20:21:04,349 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-11-28 20:21:04,349 INFO L87 Difference]: Start difference. First operand 5262 states and 12356 transitions. Second operand 6 states. [2018-11-28 20:21:04,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:21:04,726 INFO L93 Difference]: Finished difference Result 7071 states and 16571 transitions. [2018-11-28 20:21:04,727 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 20:21:04,727 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 83 [2018-11-28 20:21:04,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:21:04,739 INFO L225 Difference]: With dead ends: 7071 [2018-11-28 20:21:04,739 INFO L226 Difference]: Without dead ends: 7039 [2018-11-28 20:21:04,740 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 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:21:04,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7039 states. [2018-11-28 20:21:04,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7039 to 5567. [2018-11-28 20:21:04,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5567 states. [2018-11-28 20:21:04,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5567 states to 5567 states and 13121 transitions. [2018-11-28 20:21:04,820 INFO L78 Accepts]: Start accepts. Automaton has 5567 states and 13121 transitions. Word has length 83 [2018-11-28 20:21:04,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:21:04,821 INFO L480 AbstractCegarLoop]: Abstraction has 5567 states and 13121 transitions. [2018-11-28 20:21:04,821 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 20:21:04,821 INFO L276 IsEmpty]: Start isEmpty. Operand 5567 states and 13121 transitions. [2018-11-28 20:21:04,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-11-28 20:21:04,828 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:21:04,828 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] [2018-11-28 20:21:04,828 INFO L423 AbstractCegarLoop]: === Iteration 21 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:21:04,828 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:21:04,829 INFO L82 PathProgramCache]: Analyzing trace with hash 288117391, now seen corresponding path program 1 times [2018-11-28 20:21:04,829 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:21:04,829 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:21:04,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:21:04,833 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:21:04,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:21:04,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:21:04,993 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:21:04,993 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:21:04,994 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-28 20:21:04,994 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-28 20:21:04,994 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-28 20:21:04,994 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-11-28 20:21:04,996 INFO L87 Difference]: Start difference. First operand 5567 states and 13121 transitions. Second operand 7 states. [2018-11-28 20:21:05,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:21:05,528 INFO L93 Difference]: Finished difference Result 8508 states and 20474 transitions. [2018-11-28 20:21:05,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-28 20:21:05,529 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 83 [2018-11-28 20:21:05,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:21:05,541 INFO L225 Difference]: With dead ends: 8508 [2018-11-28 20:21:05,541 INFO L226 Difference]: Without dead ends: 8508 [2018-11-28 20:21:05,541 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2018-11-28 20:21:05,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8508 states. [2018-11-28 20:21:05,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8508 to 6212. [2018-11-28 20:21:05,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6212 states. [2018-11-28 20:21:05,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6212 states to 6212 states and 14765 transitions. [2018-11-28 20:21:05,649 INFO L78 Accepts]: Start accepts. Automaton has 6212 states and 14765 transitions. Word has length 83 [2018-11-28 20:21:05,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:21:05,649 INFO L480 AbstractCegarLoop]: Abstraction has 6212 states and 14765 transitions. [2018-11-28 20:21:05,649 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-28 20:21:05,649 INFO L276 IsEmpty]: Start isEmpty. Operand 6212 states and 14765 transitions. [2018-11-28 20:21:05,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-11-28 20:21:05,658 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:21:05,658 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] [2018-11-28 20:21:05,659 INFO L423 AbstractCegarLoop]: === Iteration 22 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:21:05,659 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:21:05,659 INFO L82 PathProgramCache]: Analyzing trace with hash 1175621072, now seen corresponding path program 1 times [2018-11-28 20:21:05,659 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:21:05,659 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:21:05,662 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:21:05,662 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:21:05,662 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:21:05,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:21:05,788 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:21:05,788 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:21:05,788 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 20:21:05,788 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 20:21:05,789 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 20:21:05,789 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 20:21:05,789 INFO L87 Difference]: Start difference. First operand 6212 states and 14765 transitions. Second operand 3 states. [2018-11-28 20:21:05,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:21:05,860 INFO L93 Difference]: Finished difference Result 6052 states and 14173 transitions. [2018-11-28 20:21:05,861 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 20:21:05,861 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 83 [2018-11-28 20:21:05,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:21:05,869 INFO L225 Difference]: With dead ends: 6052 [2018-11-28 20:21:05,870 INFO L226 Difference]: Without dead ends: 6020 [2018-11-28 20:21:05,870 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 20:21:05,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6020 states. [2018-11-28 20:21:05,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6020 to 3876. [2018-11-28 20:21:05,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3876 states. [2018-11-28 20:21:05,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3876 states to 3876 states and 9093 transitions. [2018-11-28 20:21:05,924 INFO L78 Accepts]: Start accepts. Automaton has 3876 states and 9093 transitions. Word has length 83 [2018-11-28 20:21:05,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:21:05,925 INFO L480 AbstractCegarLoop]: Abstraction has 3876 states and 9093 transitions. [2018-11-28 20:21:05,925 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 20:21:05,925 INFO L276 IsEmpty]: Start isEmpty. Operand 3876 states and 9093 transitions. [2018-11-28 20:21:05,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-11-28 20:21:05,929 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:21:05,930 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 20:21:05,930 INFO L423 AbstractCegarLoop]: === Iteration 23 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:21:05,930 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:21:05,930 INFO L82 PathProgramCache]: Analyzing trace with hash -901530196, now seen corresponding path program 1 times [2018-11-28 20:21:05,930 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:21:05,930 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:21:05,932 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:21:05,932 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:21:05,932 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:21:05,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:21:06,118 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:21:06,119 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:21:06,119 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 20:21:06,119 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 20:21:06,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 20:21:06,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 20:21:06,120 INFO L87 Difference]: Start difference. First operand 3876 states and 9093 transitions. Second operand 4 states. [2018-11-28 20:21:06,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:21:06,179 INFO L93 Difference]: Finished difference Result 3796 states and 8861 transitions. [2018-11-28 20:21:06,180 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 20:21:06,180 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 85 [2018-11-28 20:21:06,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:21:06,186 INFO L225 Difference]: With dead ends: 3796 [2018-11-28 20:21:06,186 INFO L226 Difference]: Without dead ends: 3796 [2018-11-28 20:21:06,187 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:21:06,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3796 states. [2018-11-28 20:21:06,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3796 to 3340. [2018-11-28 20:21:06,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3340 states. [2018-11-28 20:21:06,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3340 states to 3340 states and 7804 transitions. [2018-11-28 20:21:06,226 INFO L78 Accepts]: Start accepts. Automaton has 3340 states and 7804 transitions. Word has length 85 [2018-11-28 20:21:06,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:21:06,226 INFO L480 AbstractCegarLoop]: Abstraction has 3340 states and 7804 transitions. [2018-11-28 20:21:06,226 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 20:21:06,226 INFO L276 IsEmpty]: Start isEmpty. Operand 3340 states and 7804 transitions. [2018-11-28 20:21:06,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-11-28 20:21:06,231 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:21:06,231 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] [2018-11-28 20:21:06,231 INFO L423 AbstractCegarLoop]: === Iteration 24 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:21:06,231 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:21:06,232 INFO L82 PathProgramCache]: Analyzing trace with hash 1085951564, now seen corresponding path program 1 times [2018-11-28 20:21:06,232 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:21:06,232 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:21:06,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:21:06,234 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:21:06,234 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:21:06,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:21:06,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:21:06,432 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:21:06,432 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-28 20:21:06,432 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-28 20:21:06,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-28 20:21:06,432 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-11-28 20:21:06,433 INFO L87 Difference]: Start difference. First operand 3340 states and 7804 transitions. Second operand 8 states. [2018-11-28 20:21:07,461 WARN L180 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2018-11-28 20:21:07,785 WARN L180 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2018-11-28 20:21:08,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:21:08,233 INFO L93 Difference]: Finished difference Result 4176 states and 9617 transitions. [2018-11-28 20:21:08,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-28 20:21:08,235 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 85 [2018-11-28 20:21:08,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:21:08,240 INFO L225 Difference]: With dead ends: 4176 [2018-11-28 20:21:08,240 INFO L226 Difference]: Without dead ends: 4176 [2018-11-28 20:21:08,241 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=74, Invalid=166, Unknown=0, NotChecked=0, Total=240 [2018-11-28 20:21:08,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4176 states. [2018-11-28 20:21:08,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4176 to 3577. [2018-11-28 20:21:08,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3577 states. [2018-11-28 20:21:08,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3577 states to 3577 states and 8260 transitions. [2018-11-28 20:21:08,282 INFO L78 Accepts]: Start accepts. Automaton has 3577 states and 8260 transitions. Word has length 85 [2018-11-28 20:21:08,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:21:08,283 INFO L480 AbstractCegarLoop]: Abstraction has 3577 states and 8260 transitions. [2018-11-28 20:21:08,283 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-28 20:21:08,283 INFO L276 IsEmpty]: Start isEmpty. Operand 3577 states and 8260 transitions. [2018-11-28 20:21:08,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-11-28 20:21:08,287 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:21:08,287 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:21:08,288 INFO L423 AbstractCegarLoop]: === Iteration 25 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:21:08,288 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:21:08,288 INFO L82 PathProgramCache]: Analyzing trace with hash 1973455245, now seen corresponding path program 1 times [2018-11-28 20:21:08,288 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:21:08,288 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:21:08,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:21:08,293 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:21:08,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:21:08,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:21:08,479 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 20:21:08,479 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:21:08,480 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-11-28 20:21:08,480 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-28 20:21:08,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-28 20:21:08,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-11-28 20:21:08,481 INFO L87 Difference]: Start difference. First operand 3577 states and 8260 transitions. Second operand 10 states. [2018-11-28 20:21:10,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:21:10,169 INFO L93 Difference]: Finished difference Result 6220 states and 14391 transitions. [2018-11-28 20:21:10,171 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-28 20:21:10,171 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 85 [2018-11-28 20:21:10,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:21:10,177 INFO L225 Difference]: With dead ends: 6220 [2018-11-28 20:21:10,177 INFO L226 Difference]: Without dead ends: 4270 [2018-11-28 20:21:10,177 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=71, Invalid=271, Unknown=0, NotChecked=0, Total=342 [2018-11-28 20:21:10,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4270 states. [2018-11-28 20:21:10,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4270 to 3649. [2018-11-28 20:21:10,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3649 states. [2018-11-28 20:21:10,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3649 states to 3649 states and 8354 transitions. [2018-11-28 20:21:10,221 INFO L78 Accepts]: Start accepts. Automaton has 3649 states and 8354 transitions. Word has length 85 [2018-11-28 20:21:10,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:21:10,222 INFO L480 AbstractCegarLoop]: Abstraction has 3649 states and 8354 transitions. [2018-11-28 20:21:10,222 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-28 20:21:10,222 INFO L276 IsEmpty]: Start isEmpty. Operand 3649 states and 8354 transitions. [2018-11-28 20:21:10,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-11-28 20:21:10,226 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:21:10,227 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] [2018-11-28 20:21:10,227 INFO L423 AbstractCegarLoop]: === Iteration 26 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:21:10,227 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:21:10,227 INFO L82 PathProgramCache]: Analyzing trace with hash 1532642072, now seen corresponding path program 1 times [2018-11-28 20:21:10,227 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:21:10,227 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:21:10,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:21:10,229 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:21:10,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:21:10,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:21:10,633 WARN L180 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 10 [2018-11-28 20:21:10,920 WARN L180 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 16 [2018-11-28 20:21:10,932 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:21:10,933 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:21:10,933 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 20:21:10,933 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 20:21:10,933 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 20:21:10,934 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-28 20:21:10,934 INFO L87 Difference]: Start difference. First operand 3649 states and 8354 transitions. Second operand 6 states. [2018-11-28 20:21:11,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:21:11,162 INFO L93 Difference]: Finished difference Result 4186 states and 9465 transitions. [2018-11-28 20:21:11,163 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 20:21:11,163 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 85 [2018-11-28 20:21:11,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:21:11,168 INFO L225 Difference]: With dead ends: 4186 [2018-11-28 20:21:11,168 INFO L226 Difference]: Without dead ends: 4096 [2018-11-28 20:21:11,168 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2018-11-28 20:21:11,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4096 states. [2018-11-28 20:21:11,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4096 to 3666. [2018-11-28 20:21:11,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3666 states. [2018-11-28 20:21:11,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3666 states to 3666 states and 8316 transitions. [2018-11-28 20:21:11,210 INFO L78 Accepts]: Start accepts. Automaton has 3666 states and 8316 transitions. Word has length 85 [2018-11-28 20:21:11,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:21:11,210 INFO L480 AbstractCegarLoop]: Abstraction has 3666 states and 8316 transitions. [2018-11-28 20:21:11,210 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 20:21:11,211 INFO L276 IsEmpty]: Start isEmpty. Operand 3666 states and 8316 transitions. [2018-11-28 20:21:11,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-11-28 20:21:11,215 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:21:11,215 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] [2018-11-28 20:21:11,215 INFO L423 AbstractCegarLoop]: === Iteration 27 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:21:11,216 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:21:11,216 INFO L82 PathProgramCache]: Analyzing trace with hash -544567271, now seen corresponding path program 2 times [2018-11-28 20:21:11,216 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:21:11,216 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:21:11,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:21:11,218 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:21:11,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:21:11,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:21:11,417 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:21:11,417 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:21:11,417 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-11-28 20:21:11,417 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-28 20:21:11,418 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-28 20:21:11,418 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-11-28 20:21:11,418 INFO L87 Difference]: Start difference. First operand 3666 states and 8316 transitions. Second operand 10 states. [2018-11-28 20:21:12,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:21:12,166 INFO L93 Difference]: Finished difference Result 6983 states and 15918 transitions. [2018-11-28 20:21:12,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-28 20:21:12,167 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 85 [2018-11-28 20:21:12,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:21:12,171 INFO L225 Difference]: With dead ends: 6983 [2018-11-28 20:21:12,171 INFO L226 Difference]: Without dead ends: 2778 [2018-11-28 20:21:12,172 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=84, Invalid=222, Unknown=0, NotChecked=0, Total=306 [2018-11-28 20:21:12,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2778 states. [2018-11-28 20:21:12,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2778 to 2778. [2018-11-28 20:21:12,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2778 states. [2018-11-28 20:21:12,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2778 states to 2778 states and 6333 transitions. [2018-11-28 20:21:12,201 INFO L78 Accepts]: Start accepts. Automaton has 2778 states and 6333 transitions. Word has length 85 [2018-11-28 20:21:12,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:21:12,202 INFO L480 AbstractCegarLoop]: Abstraction has 2778 states and 6333 transitions. [2018-11-28 20:21:12,202 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-28 20:21:12,202 INFO L276 IsEmpty]: Start isEmpty. Operand 2778 states and 6333 transitions. [2018-11-28 20:21:12,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-11-28 20:21:12,205 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:21:12,206 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] [2018-11-28 20:21:12,206 INFO L423 AbstractCegarLoop]: === Iteration 28 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:21:12,206 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:21:12,206 INFO L82 PathProgramCache]: Analyzing trace with hash -1942685255, now seen corresponding path program 3 times [2018-11-28 20:21:12,206 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:21:12,206 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:21:12,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:21:12,208 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 20:21:12,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:21:12,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:21:12,468 WARN L180 SmtUtils]: Spent 198.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2018-11-28 20:21:12,643 WARN L180 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-11-28 20:21:13,630 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:21:13,631 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:21:13,631 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-11-28 20:21:13,631 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-28 20:21:13,632 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-28 20:21:13,632 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-11-28 20:21:13,632 INFO L87 Difference]: Start difference. First operand 2778 states and 6333 transitions. Second operand 11 states. [2018-11-28 20:21:14,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:21:14,712 INFO L93 Difference]: Finished difference Result 4789 states and 10990 transitions. [2018-11-28 20:21:14,713 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-28 20:21:14,713 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 85 [2018-11-28 20:21:14,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:21:14,718 INFO L225 Difference]: With dead ends: 4789 [2018-11-28 20:21:14,718 INFO L226 Difference]: Without dead ends: 3098 [2018-11-28 20:21:14,719 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=70, Invalid=310, Unknown=0, NotChecked=0, Total=380 [2018-11-28 20:21:14,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3098 states. [2018-11-28 20:21:14,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3098 to 2758. [2018-11-28 20:21:14,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2758 states. [2018-11-28 20:21:14,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2758 states to 2758 states and 6291 transitions. [2018-11-28 20:21:14,750 INFO L78 Accepts]: Start accepts. Automaton has 2758 states and 6291 transitions. Word has length 85 [2018-11-28 20:21:14,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:21:14,750 INFO L480 AbstractCegarLoop]: Abstraction has 2758 states and 6291 transitions. [2018-11-28 20:21:14,750 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-28 20:21:14,750 INFO L276 IsEmpty]: Start isEmpty. Operand 2758 states and 6291 transitions. [2018-11-28 20:21:14,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-11-28 20:21:14,754 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:21:14,754 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 20:21:14,754 INFO L423 AbstractCegarLoop]: === Iteration 29 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:21:14,754 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:21:14,755 INFO L82 PathProgramCache]: Analyzing trace with hash -1542877223, now seen corresponding path program 4 times [2018-11-28 20:21:14,755 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:21:14,755 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:21:14,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:21:14,757 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 20:21:14,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:21:14,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 20:21:14,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 20:21:14,829 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-11-28 20:21:15,084 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-11-28 20:21:15,091 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 08:21:15 BasicIcfg [2018-11-28 20:21:15,091 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-28 20:21:15,091 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-28 20:21:15,091 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-28 20:21:15,092 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-28 20:21:15,092 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 08:20:32" (3/4) ... [2018-11-28 20:21:15,099 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-11-28 20:21:15,309 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2018-11-28 20:21:15,310 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-28 20:21:15,311 INFO L168 Benchmark]: Toolchain (without parser) took 44780.58 ms. Allocated memory was 1.0 GB in the beginning and 2.6 GB in the end (delta: 1.5 GB). Free memory was 951.4 MB in the beginning and 595.9 MB in the end (delta: 355.5 MB). Peak memory consumption was 1.9 GB. Max. memory is 11.5 GB. [2018-11-28 20:21:15,314 INFO L168 Benchmark]: CDTParser took 0.19 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:21:15,315 INFO L168 Benchmark]: CACSL2BoogieTranslator took 903.57 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 111.7 MB). Free memory was 946.0 MB in the beginning and 1.1 GB in the end (delta: -138.0 MB). Peak memory consumption was 25.7 MB. Max. memory is 11.5 GB. [2018-11-28 20:21:15,315 INFO L168 Benchmark]: Boogie Procedure Inliner took 74.25 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 7.1 MB). Peak memory consumption was 7.1 MB. Max. memory is 11.5 GB. [2018-11-28 20:21:15,315 INFO L168 Benchmark]: Boogie Preprocessor took 55.02 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:21:15,319 INFO L168 Benchmark]: RCFGBuilder took 1084.22 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: 41.3 MB). Peak memory consumption was 41.3 MB. Max. memory is 11.5 GB. [2018-11-28 20:21:15,319 INFO L168 Benchmark]: TraceAbstraction took 42439.12 ms. Allocated memory was 1.1 GB in the beginning and 2.6 GB in the end (delta: 1.4 GB). Free memory was 1.0 GB in the beginning and 628.3 MB in the end (delta: 407.2 MB). Peak memory consumption was 1.8 GB. Max. memory is 11.5 GB. [2018-11-28 20:21:15,320 INFO L168 Benchmark]: Witness Printer took 218.38 ms. Allocated memory is still 2.6 GB. Free memory was 628.3 MB in the beginning and 595.9 MB in the end (delta: 32.4 MB). Peak memory consumption was 32.4 MB. Max. memory is 11.5 GB. [2018-11-28 20:21:15,324 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.19 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 903.57 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 111.7 MB). Free memory was 946.0 MB in the beginning and 1.1 GB in the end (delta: -138.0 MB). Peak memory consumption was 25.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 74.25 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 7.1 MB). Peak memory consumption was 7.1 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 55.02 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 1084.22 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: 41.3 MB). Peak memory consumption was 41.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 42439.12 ms. Allocated memory was 1.1 GB in the beginning and 2.6 GB in the end (delta: 1.4 GB). Free memory was 1.0 GB in the beginning and 628.3 MB in the end (delta: 407.2 MB). Peak memory consumption was 1.8 GB. Max. memory is 11.5 GB. * Witness Printer took 218.38 ms. Allocated memory is still 2.6 GB. Free memory was 628.3 MB in the beginning and 595.9 MB in the end (delta: 32.4 MB). Peak memory consumption was 32.4 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L672] -1 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L674] -1 int __unbuffered_p0_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0] [L676] -1 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0] [L678] -1 int __unbuffered_p1_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0] [L679] -1 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0] [L680] -1 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L682] -1 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L684] -1 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L685] -1 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L686] -1 int y$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L687] -1 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0] [L688] -1 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0] [L689] -1 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0] [L690] -1 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0] [L691] -1 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0] [L692] -1 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0] [L693] -1 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0] [L694] -1 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}] [L695] -1 int y$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0] [L696] -1 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0] [L697] -1 int y$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0] [L698] -1 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L700] -1 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L701] -1 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L702] -1 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L778] -1 pthread_t t1659; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L779] FCALL, FORK -1 pthread_create(&t1659, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L780] -1 pthread_t t1660; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L781] FCALL, FORK -1 pthread_create(&t1660, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L736] 0 y$w_buff1 = y$w_buff0 [L737] 0 y$w_buff0 = 1 [L738] 0 y$w_buff1_used = y$w_buff0_used [L739] 0 y$w_buff0_used = (_Bool)1 [L5] COND FALSE 0 !(!expression) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L741] 0 y$r_buff1_thd0 = y$r_buff0_thd0 [L742] 0 y$r_buff1_thd1 = y$r_buff0_thd1 [L743] 0 y$r_buff1_thd2 = y$r_buff0_thd2 [L744] 0 y$r_buff0_thd2 = (_Bool)1 [L747] 0 z = 1 [L750] 0 __unbuffered_p1_EAX = z [L753] 0 __unbuffered_p1_EBX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L756] EXPR 0 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L706] 1 x = 1 [L711] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L712] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L713] 1 y$flush_delayed = weak$$choice2 [L714] 1 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L715] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L756] 0 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L757] EXPR 0 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used VAL [!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L757] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L715] 1 y = !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L716] EXPR 1 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0))=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L716] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L717] EXPR 1 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L717] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L758] EXPR 0 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L758] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L759] EXPR 0 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L759] 0 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L760] EXPR 0 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L760] 0 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L763] 0 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L718] EXPR 1 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L718] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L719] EXPR 1 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L719] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L720] EXPR 1 weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L720] 1 y$r_buff0_thd1 = weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) [L721] EXPR 1 weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L721] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L722] 1 __unbuffered_p0_EAX = y VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L723] EXPR 1 y$flush_delayed ? y$mem_tmp : y VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, 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=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L723] 1 y = y$flush_delayed ? y$mem_tmp : y [L724] 1 y$flush_delayed = (_Bool)0 [L729] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L783] -1 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L787] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L787] EXPR -1 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L787] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L787] -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) [L788] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L788] -1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L789] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L789] -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 [L790] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L790] -1 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L791] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L791] -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 [L794] -1 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L5] COND TRUE -1 !expression VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L5] -1 __VERIFIER_error() VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 200 locations, 3 error locations. UNSAFE Result, 42.2s OverallTime, 29 OverallIterations, 1 TraceHistogramMax, 22.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 7596 SDtfs, 9051 SDslu, 17852 SDs, 0 SdLazy, 7503 SolverSat, 354 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 13.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 279 GetRequests, 73 SyntacticMatches, 19 SemanticMatches, 187 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 175 ImplicationChecksByTransitivity, 9.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=29288occurred in iteration=17, 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: 8.5s AutomataMinimizationTime, 28 MinimizatonAttempts, 76217 StatesRemovedByMinimization, 26 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 7.8s InterpolantComputationTime, 2035 NumberOfCodeBlocks, 2035 NumberOfCodeBlocksAsserted, 29 NumberOfCheckSat, 1922 ConstructedInterpolants, 0 QuantifiedInterpolants, 357771 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 28 InterpolantComputations, 28 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...