./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/pthread-wmm/rfi003_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/rfi003_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 d0ef9d70749ab5afc904022864475fbd1463ea69 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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:19:47,559 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-28 20:19:47,562 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-28 20:19:47,579 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-28 20:19:47,581 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-28 20:19:47,582 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-28 20:19:47,584 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-28 20:19:47,587 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-28 20:19:47,590 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-28 20:19:47,591 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-28 20:19:47,594 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-28 20:19:47,594 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-28 20:19:47,595 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-28 20:19:47,597 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-28 20:19:47,606 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-28 20:19:47,607 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-28 20:19:47,607 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-28 20:19:47,609 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-28 20:19:47,611 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-28 20:19:47,613 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-28 20:19:47,614 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-28 20:19:47,615 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-28 20:19:47,618 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-28 20:19:47,618 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-28 20:19:47,618 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-28 20:19:47,619 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-28 20:19:47,620 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-28 20:19:47,621 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-28 20:19:47,622 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-28 20:19:47,623 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-28 20:19:47,623 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-28 20:19:47,624 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-28 20:19:47,624 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-28 20:19:47,624 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-28 20:19:47,626 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-28 20:19:47,626 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-28 20:19:47,627 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:19:47,642 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-28 20:19:47,642 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-28 20:19:47,643 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-28 20:19:47,643 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-28 20:19:47,643 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-28 20:19:47,644 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-28 20:19:47,644 INFO L133 SettingsManager]: * Use SBE=true [2018-11-28 20:19:47,645 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-28 20:19:47,645 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-28 20:19:47,645 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-28 20:19:47,645 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-28 20:19:47,645 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-28 20:19:47,645 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-28 20:19:47,646 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-28 20:19:47,646 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-28 20:19:47,646 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-28 20:19:47,646 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-28 20:19:47,646 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-28 20:19:47,646 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-28 20:19:47,648 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-28 20:19:47,648 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-28 20:19:47,649 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-28 20:19:47,649 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-28 20:19:47,649 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-28 20:19:47,649 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-28 20:19:47,649 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-28 20:19:47,649 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-28 20:19:47,650 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-28 20:19:47,651 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-28 20:19:47,651 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-28 20:19:47,651 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 -> d0ef9d70749ab5afc904022864475fbd1463ea69 [2018-11-28 20:19:47,708 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-28 20:19:47,724 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-28 20:19:47,731 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-28 20:19:47,732 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-28 20:19:47,732 INFO L276 PluginConnector]: CDTParser initialized [2018-11-28 20:19:47,733 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/pthread-wmm/rfi003_rmo.oepc_false-unreach-call.i [2018-11-28 20:19:47,789 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6d913884d/d2feecc60c5a4bbd90608014a8e53d2f/FLAG9bb73bb9e [2018-11-28 20:19:48,357 INFO L307 CDTParser]: Found 1 translation units. [2018-11-28 20:19:48,358 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/pthread-wmm/rfi003_rmo.oepc_false-unreach-call.i [2018-11-28 20:19:48,378 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6d913884d/d2feecc60c5a4bbd90608014a8e53d2f/FLAG9bb73bb9e [2018-11-28 20:19:48,606 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6d913884d/d2feecc60c5a4bbd90608014a8e53d2f [2018-11-28 20:19:48,610 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-28 20:19:48,611 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-28 20:19:48,612 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-28 20:19:48,612 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-28 20:19:48,616 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-28 20:19:48,618 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 08:19:48" (1/1) ... [2018-11-28 20:19:48,621 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:19:48, skipping insertion in model container [2018-11-28 20:19:48,621 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 08:19:48" (1/1) ... [2018-11-28 20:19:48,629 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-28 20:19:48,688 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-28 20:19:49,191 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 20:19:49,205 INFO L191 MainTranslator]: Completed pre-run [2018-11-28 20:19:49,392 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 20:19:49,485 INFO L195 MainTranslator]: Completed translation [2018-11-28 20:19:49,486 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:19:49 WrapperNode [2018-11-28 20:19:49,486 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-28 20:19:49,487 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-28 20:19:49,487 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-28 20:19:49,487 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-28 20:19:49,496 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:19:49" (1/1) ... [2018-11-28 20:19:49,517 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:19:49" (1/1) ... [2018-11-28 20:19:49,550 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-28 20:19:49,550 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-28 20:19:49,550 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-28 20:19:49,551 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-28 20:19:49,561 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:19:49" (1/1) ... [2018-11-28 20:19:49,561 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:19:49" (1/1) ... [2018-11-28 20:19:49,566 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:19:49" (1/1) ... [2018-11-28 20:19:49,566 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:19:49" (1/1) ... [2018-11-28 20:19:49,576 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:19:49" (1/1) ... [2018-11-28 20:19:49,579 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:19:49" (1/1) ... [2018-11-28 20:19:49,584 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:19:49" (1/1) ... [2018-11-28 20:19:49,596 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-28 20:19:49,597 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-28 20:19:49,597 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-28 20:19:49,598 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-28 20:19:49,598 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:19:49" (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:19:49,664 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-28 20:19:49,664 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-28 20:19:49,664 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2018-11-28 20:19:49,665 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-28 20:19:49,665 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2018-11-28 20:19:49,665 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2018-11-28 20:19:49,666 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2018-11-28 20:19:49,666 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2018-11-28 20:19:49,666 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2018-11-28 20:19:49,666 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-28 20:19:49,666 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-28 20:19:49,669 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:19:50,751 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-28 20:19:50,751 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-11-28 20:19:50,752 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 08:19:50 BoogieIcfgContainer [2018-11-28 20:19:50,752 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-28 20:19:50,753 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-28 20:19:50,753 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-28 20:19:50,757 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-28 20:19:50,758 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 08:19:48" (1/3) ... [2018-11-28 20:19:50,759 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d42065b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 08:19:50, skipping insertion in model container [2018-11-28 20:19:50,759 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:19:49" (2/3) ... [2018-11-28 20:19:50,759 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d42065b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 08:19:50, skipping insertion in model container [2018-11-28 20:19:50,760 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 08:19:50" (3/3) ... [2018-11-28 20:19:50,763 INFO L112 eAbstractionObserver]: Analyzing ICFG rfi003_rmo.oepc_false-unreach-call.i [2018-11-28 20:19:50,809 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:19:50,809 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:19:50,809 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:19:50,809 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:19:50,810 WARN L317 ript$VariableManager]: TermVariabe Thread1_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:19:50,810 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:19:50,810 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:19:50,810 WARN L317 ript$VariableManager]: TermVariabe Thread1_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:19:50,811 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:19:50,811 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:19:50,811 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:19:50,811 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:19:50,811 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:19:50,813 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:19:50,814 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:19:50,814 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:19:50,814 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:19:50,814 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:19:50,815 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:19:50,815 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:19:50,816 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:19:50,816 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:19:50,816 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:19:50,816 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:19:50,817 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:19:50,818 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:19:50,818 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:19:50,818 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:19:50,818 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:19:50,819 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:19:50,820 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:19:50,820 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:19:50,820 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:19:50,820 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:19:50,821 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:19:50,821 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:19:50,821 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:19:50,821 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:19:50,821 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:19:50,823 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:19:50,823 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:19:50,823 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:19:50,824 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:19:50,824 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:19:50,824 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:19:50,824 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:19:50,824 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:19:50,826 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:19:50,826 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:19:50,826 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:19:50,827 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:19:50,827 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:19:50,828 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:19:50,828 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:19:50,828 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:19:50,828 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:19:50,829 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:19:50,829 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:19:50,829 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:19:50,829 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:19:50,830 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:19:50,831 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:19:50,832 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:19:50,832 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:19:50,832 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:19:50,832 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:19:50,833 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:19:50,833 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:19:50,833 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:19:50,833 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:19:50,834 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:19:50,835 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:19:50,835 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:19:50,835 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:19:50,836 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:19:50,836 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:19:50,836 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:19:50,836 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:19:50,836 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:19:50,838 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:19:50,838 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:19:50,838 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:19:50,838 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:19:50,839 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:19:50,840 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:19:50,840 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:19:50,840 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:19:50,840 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:19:50,840 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:19:50,841 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:19:50,841 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:19:50,841 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:19:50,841 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet26.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:19:50,841 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet26.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:19:50,842 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:19:50,843 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:19:50,844 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet26.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:19:50,844 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet26.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:19:50,844 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:19:50,845 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:19:50,846 WARN L317 ript$VariableManager]: TermVariabe Thread0_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:19:50,846 WARN L317 ript$VariableManager]: TermVariabe Thread0_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:19:50,846 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:19:50,846 WARN L317 ript$VariableManager]: TermVariabe Thread0_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:19:50,846 WARN L317 ript$VariableManager]: TermVariabe Thread0_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:19:50,847 WARN L317 ript$VariableManager]: TermVariabe Thread0_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:19:50,848 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:19:50,848 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:19:50,848 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:19:50,848 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:19:50,849 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:19:50,849 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:19:50,849 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:19:50,849 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:19:50,850 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:19:50,851 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:19:50,851 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:19:50,852 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:19:50,852 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:19:50,852 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:19:50,852 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:19:50,852 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:19:50,854 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:19:50,854 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:19:50,854 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:19:50,854 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:19:50,854 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:19:50,855 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:19:50,856 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:19:50,856 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:19:50,856 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet33.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:19:50,856 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet33.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:19:50,857 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:19:50,857 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:19:50,857 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet33.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:19:50,857 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet33.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:19:50,869 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2018-11-28 20:19:50,869 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-28 20:19:50,879 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-11-28 20:19:50,896 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2018-11-28 20:19:50,925 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-28 20:19:50,926 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-28 20:19:50,926 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-28 20:19:50,926 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-28 20:19:50,926 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-28 20:19:50,926 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-28 20:19:50,926 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-28 20:19:50,927 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-28 20:19:50,928 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-28 20:19:50,942 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 131places, 163 transitions [2018-11-28 20:19:52,642 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 27855 states. [2018-11-28 20:19:52,644 INFO L276 IsEmpty]: Start isEmpty. Operand 27855 states. [2018-11-28 20:19:52,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-11-28 20:19:52,656 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:19:52,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] [2018-11-28 20:19:52,661 INFO L423 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:19:52,668 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:19:52,668 INFO L82 PathProgramCache]: Analyzing trace with hash 71244223, now seen corresponding path program 1 times [2018-11-28 20:19:52,671 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:19:52,671 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:19:52,738 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:19:52,738 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:19:52,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:19:52,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:19:53,086 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:19:53,089 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:19:53,090 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 20:19:53,094 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 20:19:53,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 20:19:53,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 20:19:53,115 INFO L87 Difference]: Start difference. First operand 27855 states. Second operand 4 states. [2018-11-28 20:19:54,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:19:54,292 INFO L93 Difference]: Finished difference Result 47767 states and 183118 transitions. [2018-11-28 20:19:54,293 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 20:19:54,294 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 38 [2018-11-28 20:19:54,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:19:54,609 INFO L225 Difference]: With dead ends: 47767 [2018-11-28 20:19:54,609 INFO L226 Difference]: Without dead ends: 34607 [2018-11-28 20:19:54,612 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 20:19:54,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34607 states. [2018-11-28 20:19:55,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34607 to 21755. [2018-11-28 20:19:55,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21755 states. [2018-11-28 20:19:55,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21755 states to 21755 states and 83440 transitions. [2018-11-28 20:19:55,925 INFO L78 Accepts]: Start accepts. Automaton has 21755 states and 83440 transitions. Word has length 38 [2018-11-28 20:19:55,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:19:55,926 INFO L480 AbstractCegarLoop]: Abstraction has 21755 states and 83440 transitions. [2018-11-28 20:19:55,926 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 20:19:55,926 INFO L276 IsEmpty]: Start isEmpty. Operand 21755 states and 83440 transitions. [2018-11-28 20:19:55,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-11-28 20:19:55,939 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:19:55,939 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] [2018-11-28 20:19:55,939 INFO L423 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:19:55,940 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:19:55,940 INFO L82 PathProgramCache]: Analyzing trace with hash -1724990409, now seen corresponding path program 1 times [2018-11-28 20:19:55,940 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:19:55,940 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:19:55,947 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:19:55,948 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:19:55,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:19:55,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:19:56,186 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:19:56,187 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:19:56,187 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 20:19:56,190 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 20:19:56,190 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 20:19:56,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 20:19:56,191 INFO L87 Difference]: Start difference. First operand 21755 states and 83440 transitions. Second operand 5 states. [2018-11-28 20:19:59,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:19:59,443 INFO L93 Difference]: Finished difference Result 47633 states and 173801 transitions. [2018-11-28 20:19:59,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-28 20:19:59,444 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 46 [2018-11-28 20:19:59,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:19:59,780 INFO L225 Difference]: With dead ends: 47633 [2018-11-28 20:19:59,780 INFO L226 Difference]: Without dead ends: 47065 [2018-11-28 20:19:59,781 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:00,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47065 states. [2018-11-28 20:20:01,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47065 to 31795. [2018-11-28 20:20:01,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31795 states. [2018-11-28 20:20:01,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31795 states to 31795 states and 116818 transitions. [2018-11-28 20:20:01,305 INFO L78 Accepts]: Start accepts. Automaton has 31795 states and 116818 transitions. Word has length 46 [2018-11-28 20:20:01,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:20:01,307 INFO L480 AbstractCegarLoop]: Abstraction has 31795 states and 116818 transitions. [2018-11-28 20:20:01,308 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 20:20:01,308 INFO L276 IsEmpty]: Start isEmpty. Operand 31795 states and 116818 transitions. [2018-11-28 20:20:01,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-11-28 20:20:01,315 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:20:01,315 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:01,316 INFO L423 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:20:01,317 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:20:01,317 INFO L82 PathProgramCache]: Analyzing trace with hash -2058408648, now seen corresponding path program 1 times [2018-11-28 20:20:01,317 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:20:01,317 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:20:01,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:20:01,322 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:20:01,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:20:01,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:20:01,430 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:01,431 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:20:01,431 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 20:20:01,431 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 20:20:01,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 20:20:01,432 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 20:20:01,432 INFO L87 Difference]: Start difference. First operand 31795 states and 116818 transitions. Second operand 5 states. [2018-11-28 20:20:02,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:20:02,306 INFO L93 Difference]: Finished difference Result 63027 states and 229113 transitions. [2018-11-28 20:20:02,312 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-28 20:20:02,312 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 47 [2018-11-28 20:20:02,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:20:02,526 INFO L225 Difference]: With dead ends: 63027 [2018-11-28 20:20:02,527 INFO L226 Difference]: Without dead ends: 62563 [2018-11-28 20:20:02,527 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-11-28 20:20:02,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62563 states. [2018-11-28 20:20:04,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62563 to 35363. [2018-11-28 20:20:04,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35363 states. [2018-11-28 20:20:04,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35363 states to 35363 states and 128876 transitions. [2018-11-28 20:20:04,350 INFO L78 Accepts]: Start accepts. Automaton has 35363 states and 128876 transitions. Word has length 47 [2018-11-28 20:20:04,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:20:04,351 INFO L480 AbstractCegarLoop]: Abstraction has 35363 states and 128876 transitions. [2018-11-28 20:20:04,351 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 20:20:04,351 INFO L276 IsEmpty]: Start isEmpty. Operand 35363 states and 128876 transitions. [2018-11-28 20:20:04,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-11-28 20:20:04,360 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:20:04,360 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] [2018-11-28 20:20:04,361 INFO L423 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:20:04,361 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:20:04,361 INFO L82 PathProgramCache]: Analyzing trace with hash 1703022802, now seen corresponding path program 1 times [2018-11-28 20:20:04,361 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:20:04,361 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:20:04,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:20:04,366 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:20:04,366 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:20:04,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:20:04,467 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:04,468 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:20:04,468 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 20:20:04,468 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 20:20:04,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 20:20:04,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 20:20:04,469 INFO L87 Difference]: Start difference. First operand 35363 states and 128876 transitions. Second operand 3 states. [2018-11-28 20:20:04,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:20:04,729 INFO L93 Difference]: Finished difference Result 45909 states and 163944 transitions. [2018-11-28 20:20:04,730 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 20:20:04,730 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 49 [2018-11-28 20:20:04,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:20:04,869 INFO L225 Difference]: With dead ends: 45909 [2018-11-28 20:20:04,870 INFO L226 Difference]: Without dead ends: 45909 [2018-11-28 20:20:04,870 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:05,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45909 states. [2018-11-28 20:20:06,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45909 to 40246. [2018-11-28 20:20:06,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40246 states. [2018-11-28 20:20:06,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40246 states to 40246 states and 145214 transitions. [2018-11-28 20:20:06,599 INFO L78 Accepts]: Start accepts. Automaton has 40246 states and 145214 transitions. Word has length 49 [2018-11-28 20:20:06,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:20:06,599 INFO L480 AbstractCegarLoop]: Abstraction has 40246 states and 145214 transitions. [2018-11-28 20:20:06,599 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 20:20:06,600 INFO L276 IsEmpty]: Start isEmpty. Operand 40246 states and 145214 transitions. [2018-11-28 20:20:06,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-11-28 20:20:06,619 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:20:06,619 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] [2018-11-28 20:20:06,620 INFO L423 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:20:06,620 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:20:06,620 INFO L82 PathProgramCache]: Analyzing trace with hash 1764675695, now seen corresponding path program 1 times [2018-11-28 20:20:06,620 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:20:06,620 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:20:06,624 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:20:06,625 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:20:06,625 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:20:06,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:20:06,809 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:06,809 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:20:06,809 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 20:20:06,810 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 20:20:06,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 20:20:06,810 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-28 20:20:06,810 INFO L87 Difference]: Start difference. First operand 40246 states and 145214 transitions. Second operand 6 states. [2018-11-28 20:20:07,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:20:07,907 INFO L93 Difference]: Finished difference Result 70849 states and 252354 transitions. [2018-11-28 20:20:07,907 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-28 20:20:07,908 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 53 [2018-11-28 20:20:07,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:20:08,085 INFO L225 Difference]: With dead ends: 70849 [2018-11-28 20:20:08,085 INFO L226 Difference]: Without dead ends: 70313 [2018-11-28 20:20:08,085 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2018-11-28 20:20:08,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70313 states. [2018-11-28 20:20:09,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70313 to 40897. [2018-11-28 20:20:09,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40897 states. [2018-11-28 20:20:09,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40897 states to 40897 states and 147667 transitions. [2018-11-28 20:20:09,158 INFO L78 Accepts]: Start accepts. Automaton has 40897 states and 147667 transitions. Word has length 53 [2018-11-28 20:20:09,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:20:09,159 INFO L480 AbstractCegarLoop]: Abstraction has 40897 states and 147667 transitions. [2018-11-28 20:20:09,159 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 20:20:09,159 INFO L276 IsEmpty]: Start isEmpty. Operand 40897 states and 147667 transitions. [2018-11-28 20:20:09,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-11-28 20:20:09,179 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:20:09,179 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] [2018-11-28 20:20:09,179 INFO L423 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:20:09,180 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:20:09,180 INFO L82 PathProgramCache]: Analyzing trace with hash -2096426106, now seen corresponding path program 1 times [2018-11-28 20:20:09,180 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:20:09,180 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:20:09,184 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:20:09,185 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:20:09,185 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:20:09,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:20:09,818 WARN L180 SmtUtils]: Spent 295.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 10 [2018-11-28 20:20:09,842 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:09,842 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:20:09,842 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 20:20:09,843 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 20:20:09,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 20:20:09,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-11-28 20:20:09,843 INFO L87 Difference]: Start difference. First operand 40897 states and 147667 transitions. Second operand 6 states. [2018-11-28 20:20:12,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:20:12,094 INFO L93 Difference]: Finished difference Result 56598 states and 201647 transitions. [2018-11-28 20:20:12,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-28 20:20:12,095 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 53 [2018-11-28 20:20:12,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:20:12,250 INFO L225 Difference]: With dead ends: 56598 [2018-11-28 20:20:12,250 INFO L226 Difference]: Without dead ends: 55459 [2018-11-28 20:20:12,251 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-11-28 20:20:12,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55459 states. [2018-11-28 20:20:13,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55459 to 51954. [2018-11-28 20:20:13,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51954 states. [2018-11-28 20:20:13,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51954 states to 51954 states and 186006 transitions. [2018-11-28 20:20:13,310 INFO L78 Accepts]: Start accepts. Automaton has 51954 states and 186006 transitions. Word has length 53 [2018-11-28 20:20:13,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:20:13,310 INFO L480 AbstractCegarLoop]: Abstraction has 51954 states and 186006 transitions. [2018-11-28 20:20:13,310 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 20:20:13,310 INFO L276 IsEmpty]: Start isEmpty. Operand 51954 states and 186006 transitions. [2018-11-28 20:20:13,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-11-28 20:20:13,324 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:20:13,324 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] [2018-11-28 20:20:13,325 INFO L423 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:20:13,325 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:20:13,325 INFO L82 PathProgramCache]: Analyzing trace with hash 401589831, now seen corresponding path program 1 times [2018-11-28 20:20:13,325 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:20:13,326 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:20:13,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:20:13,329 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:20:13,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:20:13,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:20:13,568 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:13,568 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:20:13,568 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-28 20:20:13,569 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-28 20:20:13,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-28 20:20:13,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-28 20:20:13,570 INFO L87 Difference]: Start difference. First operand 51954 states and 186006 transitions. Second operand 7 states. [2018-11-28 20:20:18,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:20:18,431 INFO L93 Difference]: Finished difference Result 75637 states and 260103 transitions. [2018-11-28 20:20:18,434 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-28 20:20:18,434 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 53 [2018-11-28 20:20:18,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:20:18,638 INFO L225 Difference]: With dead ends: 75637 [2018-11-28 20:20:18,638 INFO L226 Difference]: Without dead ends: 75637 [2018-11-28 20:20:18,639 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2018-11-28 20:20:18,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75637 states. [2018-11-28 20:20:19,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75637 to 61472. [2018-11-28 20:20:19,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61472 states. [2018-11-28 20:20:19,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61472 states to 61472 states and 215183 transitions. [2018-11-28 20:20:19,788 INFO L78 Accepts]: Start accepts. Automaton has 61472 states and 215183 transitions. Word has length 53 [2018-11-28 20:20:19,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:20:19,789 INFO L480 AbstractCegarLoop]: Abstraction has 61472 states and 215183 transitions. [2018-11-28 20:20:19,789 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-28 20:20:19,789 INFO L276 IsEmpty]: Start isEmpty. Operand 61472 states and 215183 transitions. [2018-11-28 20:20:19,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-11-28 20:20:19,803 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:20:19,803 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 20:20:19,803 INFO L423 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:20:19,803 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:20:19,804 INFO L82 PathProgramCache]: Analyzing trace with hash 1289093512, now seen corresponding path program 1 times [2018-11-28 20:20:19,804 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:20:19,804 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:20:19,806 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:20:19,806 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:20:19,806 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:20:19,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:20:19,971 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:19,971 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:20:19,971 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 20:20:19,972 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 20:20:19,972 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 20:20:19,972 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 20:20:19,972 INFO L87 Difference]: Start difference. First operand 61472 states and 215183 transitions. Second operand 4 states. [2018-11-28 20:20:20,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:20:20,182 INFO L93 Difference]: Finished difference Result 13777 states and 43273 transitions. [2018-11-28 20:20:20,183 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 20:20:20,183 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 53 [2018-11-28 20:20:20,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:20:20,204 INFO L225 Difference]: With dead ends: 13777 [2018-11-28 20:20:20,204 INFO L226 Difference]: Without dead ends: 12160 [2018-11-28 20:20:20,204 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:20,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12160 states. [2018-11-28 20:20:20,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12160 to 12112. [2018-11-28 20:20:20,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12112 states. [2018-11-28 20:20:20,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12112 states to 12112 states and 37957 transitions. [2018-11-28 20:20:20,382 INFO L78 Accepts]: Start accepts. Automaton has 12112 states and 37957 transitions. Word has length 53 [2018-11-28 20:20:20,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:20:20,382 INFO L480 AbstractCegarLoop]: Abstraction has 12112 states and 37957 transitions. [2018-11-28 20:20:20,383 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 20:20:20,383 INFO L276 IsEmpty]: Start isEmpty. Operand 12112 states and 37957 transitions. [2018-11-28 20:20:20,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-11-28 20:20:20,389 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:20:20,389 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 20:20:20,389 INFO L423 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:20:20,390 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:20:20,390 INFO L82 PathProgramCache]: Analyzing trace with hash -736446972, now seen corresponding path program 1 times [2018-11-28 20:20:20,390 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:20:20,390 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:20:20,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:20:20,392 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:20:20,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:20:20,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:20:20,499 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:20,499 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:20:20,499 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 20:20:20,499 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 20:20:20,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 20:20:20,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 20:20:20,500 INFO L87 Difference]: Start difference. First operand 12112 states and 37957 transitions. Second operand 4 states. [2018-11-28 20:20:20,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:20:20,749 INFO L93 Difference]: Finished difference Result 14275 states and 44580 transitions. [2018-11-28 20:20:20,750 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 20:20:20,750 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 63 [2018-11-28 20:20:20,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:20:20,776 INFO L225 Difference]: With dead ends: 14275 [2018-11-28 20:20:20,776 INFO L226 Difference]: Without dead ends: 14275 [2018-11-28 20:20:20,776 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-28 20:20:20,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14275 states. [2018-11-28 20:20:20,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14275 to 12843. [2018-11-28 20:20:20,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12843 states. [2018-11-28 20:20:20,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12843 states to 12843 states and 40182 transitions. [2018-11-28 20:20:20,966 INFO L78 Accepts]: Start accepts. Automaton has 12843 states and 40182 transitions. Word has length 63 [2018-11-28 20:20:20,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:20:20,967 INFO L480 AbstractCegarLoop]: Abstraction has 12843 states and 40182 transitions. [2018-11-28 20:20:20,967 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 20:20:20,967 INFO L276 IsEmpty]: Start isEmpty. Operand 12843 states and 40182 transitions. [2018-11-28 20:20:20,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-11-28 20:20:20,974 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:20:20,974 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 20:20:20,974 INFO L423 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:20:20,974 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:20:20,974 INFO L82 PathProgramCache]: Analyzing trace with hash 1006363363, now seen corresponding path program 1 times [2018-11-28 20:20:20,975 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:20:20,975 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:20:20,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:20:20,977 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:20:20,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:20:20,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:20:21,340 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:21,341 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:20:21,341 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 20:20:21,341 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 20:20:21,341 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 20:20:21,341 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-28 20:20:21,342 INFO L87 Difference]: Start difference. First operand 12843 states and 40182 transitions. Second operand 6 states. [2018-11-28 20:20:22,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:20:22,142 INFO L93 Difference]: Finished difference Result 23410 states and 72791 transitions. [2018-11-28 20:20:22,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-28 20:20:22,143 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 63 [2018-11-28 20:20:22,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:20:22,181 INFO L225 Difference]: With dead ends: 23410 [2018-11-28 20:20:22,182 INFO L226 Difference]: Without dead ends: 23346 [2018-11-28 20:20:22,182 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2018-11-28 20:20:22,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23346 states. [2018-11-28 20:20:22,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23346 to 13812. [2018-11-28 20:20:22,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13812 states. [2018-11-28 20:20:22,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13812 states to 13812 states and 42966 transitions. [2018-11-28 20:20:22,451 INFO L78 Accepts]: Start accepts. Automaton has 13812 states and 42966 transitions. Word has length 63 [2018-11-28 20:20:22,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:20:22,451 INFO L480 AbstractCegarLoop]: Abstraction has 13812 states and 42966 transitions. [2018-11-28 20:20:22,451 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 20:20:22,451 INFO L276 IsEmpty]: Start isEmpty. Operand 13812 states and 42966 transitions. [2018-11-28 20:20:22,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-11-28 20:20:22,461 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:20:22,462 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 20:20:22,462 INFO L423 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:20:22,462 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:20:22,462 INFO L82 PathProgramCache]: Analyzing trace with hash -1160555304, now seen corresponding path program 1 times [2018-11-28 20:20:22,462 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:20:22,463 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:20:22,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:20:22,464 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:20:22,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:20:22,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:20:22,723 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:22,724 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:20:22,724 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 20:20:22,724 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 20:20:22,724 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 20:20:22,724 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 20:20:22,725 INFO L87 Difference]: Start difference. First operand 13812 states and 42966 transitions. Second operand 4 states. [2018-11-28 20:20:23,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:20:23,659 INFO L93 Difference]: Finished difference Result 17359 states and 53255 transitions. [2018-11-28 20:20:23,660 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 20:20:23,660 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2018-11-28 20:20:23,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:20:23,691 INFO L225 Difference]: With dead ends: 17359 [2018-11-28 20:20:23,692 INFO L226 Difference]: Without dead ends: 17359 [2018-11-28 20:20:23,692 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 20:20:23,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17359 states. [2018-11-28 20:20:23,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17359 to 15783. [2018-11-28 20:20:23,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15783 states. [2018-11-28 20:20:23,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15783 states to 15783 states and 48578 transitions. [2018-11-28 20:20:23,943 INFO L78 Accepts]: Start accepts. Automaton has 15783 states and 48578 transitions. Word has length 65 [2018-11-28 20:20:23,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:20:23,944 INFO L480 AbstractCegarLoop]: Abstraction has 15783 states and 48578 transitions. [2018-11-28 20:20:23,944 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 20:20:23,944 INFO L276 IsEmpty]: Start isEmpty. Operand 15783 states and 48578 transitions. [2018-11-28 20:20:23,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-11-28 20:20:23,956 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:20:23,957 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 20:20:23,957 INFO L423 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:20:23,957 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:20:23,957 INFO L82 PathProgramCache]: Analyzing trace with hash 1057202649, now seen corresponding path program 1 times [2018-11-28 20:20:23,957 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:20:23,958 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:20:23,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:20:23,960 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:20:23,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:20:23,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:20:24,082 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 20:20:24,082 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:20:24,082 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 20:20:24,083 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 20:20:24,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 20:20:24,083 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 20:20:24,083 INFO L87 Difference]: Start difference. First operand 15783 states and 48578 transitions. Second operand 3 states. [2018-11-28 20:20:24,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:20:24,432 INFO L93 Difference]: Finished difference Result 16413 states and 50318 transitions. [2018-11-28 20:20:24,433 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 20:20:24,433 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2018-11-28 20:20:24,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:20:24,460 INFO L225 Difference]: With dead ends: 16413 [2018-11-28 20:20:24,460 INFO L226 Difference]: Without dead ends: 16413 [2018-11-28 20:20:24,460 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 20:20:24,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16413 states. [2018-11-28 20:20:24,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16413 to 16125. [2018-11-28 20:20:24,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16125 states. [2018-11-28 20:20:24,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16125 states to 16125 states and 49516 transitions. [2018-11-28 20:20:24,688 INFO L78 Accepts]: Start accepts. Automaton has 16125 states and 49516 transitions. Word has length 65 [2018-11-28 20:20:24,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:20:24,689 INFO L480 AbstractCegarLoop]: Abstraction has 16125 states and 49516 transitions. [2018-11-28 20:20:24,689 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 20:20:24,689 INFO L276 IsEmpty]: Start isEmpty. Operand 16125 states and 49516 transitions. [2018-11-28 20:20:24,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-11-28 20:20:24,704 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:20:24,704 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] [2018-11-28 20:20:24,704 INFO L423 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:20:24,704 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:20:24,705 INFO L82 PathProgramCache]: Analyzing trace with hash 1484400773, now seen corresponding path program 1 times [2018-11-28 20:20:24,705 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:20:24,705 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:20:24,706 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:20:24,707 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:20:24,707 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:20:24,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:20:24,866 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:24,866 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:20:24,866 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 20:20:24,867 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 20:20:24,867 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 20:20:24,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-28 20:20:24,867 INFO L87 Difference]: Start difference. First operand 16125 states and 49516 transitions. Second operand 6 states. [2018-11-28 20:20:25,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:20:25,673 INFO L93 Difference]: Finished difference Result 19568 states and 59304 transitions. [2018-11-28 20:20:25,673 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 20:20:25,674 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 67 [2018-11-28 20:20:25,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:20:25,708 INFO L225 Difference]: With dead ends: 19568 [2018-11-28 20:20:25,708 INFO L226 Difference]: Without dead ends: 19568 [2018-11-28 20:20:25,708 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-11-28 20:20:25,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19568 states. [2018-11-28 20:20:25,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19568 to 18524. [2018-11-28 20:20:25,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18524 states. [2018-11-28 20:20:25,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18524 states to 18524 states and 56466 transitions. [2018-11-28 20:20:25,976 INFO L78 Accepts]: Start accepts. Automaton has 18524 states and 56466 transitions. Word has length 67 [2018-11-28 20:20:25,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:20:25,977 INFO L480 AbstractCegarLoop]: Abstraction has 18524 states and 56466 transitions. [2018-11-28 20:20:25,977 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 20:20:25,977 INFO L276 IsEmpty]: Start isEmpty. Operand 18524 states and 56466 transitions. [2018-11-28 20:20:25,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-11-28 20:20:25,995 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:20:25,995 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] [2018-11-28 20:20:25,996 INFO L423 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:20:25,996 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:20:25,996 INFO L82 PathProgramCache]: Analyzing trace with hash -592808570, now seen corresponding path program 1 times [2018-11-28 20:20:25,996 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:20:25,996 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:20:25,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:20:25,998 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:20:25,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:20:26,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:20:26,128 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:26,129 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:20:26,129 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 20:20:26,129 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 20:20:26,129 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 20:20:26,129 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-28 20:20:26,130 INFO L87 Difference]: Start difference. First operand 18524 states and 56466 transitions. Second operand 6 states. [2018-11-28 20:20:26,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:20:26,647 INFO L93 Difference]: Finished difference Result 21666 states and 64013 transitions. [2018-11-28 20:20:26,648 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-28 20:20:26,648 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 67 [2018-11-28 20:20:26,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:20:26,686 INFO L225 Difference]: With dead ends: 21666 [2018-11-28 20:20:26,686 INFO L226 Difference]: Without dead ends: 21666 [2018-11-28 20:20:26,687 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2018-11-28 20:20:26,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21666 states. [2018-11-28 20:20:26,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21666 to 18841. [2018-11-28 20:20:26,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18841 states. [2018-11-28 20:20:26,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18841 states to 18841 states and 56340 transitions. [2018-11-28 20:20:26,965 INFO L78 Accepts]: Start accepts. Automaton has 18841 states and 56340 transitions. Word has length 67 [2018-11-28 20:20:26,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:20:26,965 INFO L480 AbstractCegarLoop]: Abstraction has 18841 states and 56340 transitions. [2018-11-28 20:20:26,965 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 20:20:26,966 INFO L276 IsEmpty]: Start isEmpty. Operand 18841 states and 56340 transitions. [2018-11-28 20:20:26,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-11-28 20:20:26,980 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:20:26,980 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] [2018-11-28 20:20:26,980 INFO L423 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:20:26,980 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:20:26,980 INFO L82 PathProgramCache]: Analyzing trace with hash -381457657, now seen corresponding path program 1 times [2018-11-28 20:20:26,981 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:20:26,981 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:20:26,983 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:20:26,983 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:20:26,983 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:20:26,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:20:27,184 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:27,185 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:20:27,185 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 20:20:27,185 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 20:20:27,185 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 20:20:27,185 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 20:20:27,186 INFO L87 Difference]: Start difference. First operand 18841 states and 56340 transitions. Second operand 5 states. [2018-11-28 20:20:27,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:20:27,580 INFO L93 Difference]: Finished difference Result 23854 states and 70897 transitions. [2018-11-28 20:20:27,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 20:20:27,580 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 67 [2018-11-28 20:20:27,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:20:27,621 INFO L225 Difference]: With dead ends: 23854 [2018-11-28 20:20:27,621 INFO L226 Difference]: Without dead ends: 23854 [2018-11-28 20:20:27,622 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:27,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23854 states. [2018-11-28 20:20:27,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23854 to 20164. [2018-11-28 20:20:27,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20164 states. [2018-11-28 20:20:27,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20164 states to 20164 states and 59821 transitions. [2018-11-28 20:20:27,892 INFO L78 Accepts]: Start accepts. Automaton has 20164 states and 59821 transitions. Word has length 67 [2018-11-28 20:20:27,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:20:27,892 INFO L480 AbstractCegarLoop]: Abstraction has 20164 states and 59821 transitions. [2018-11-28 20:20:27,892 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 20:20:27,892 INFO L276 IsEmpty]: Start isEmpty. Operand 20164 states and 59821 transitions. [2018-11-28 20:20:27,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-11-28 20:20:27,905 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:20:27,905 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] [2018-11-28 20:20:27,905 INFO L423 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:20:27,906 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:20:27,906 INFO L82 PathProgramCache]: Analyzing trace with hash -891991834, now seen corresponding path program 1 times [2018-11-28 20:20:27,906 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:20:27,906 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:20:27,908 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:20:27,908 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:20:27,908 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:20:27,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:20:28,033 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:28,033 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:20:28,033 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 20:20:28,034 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 20:20:28,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 20:20:28,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 20:20:28,034 INFO L87 Difference]: Start difference. First operand 20164 states and 59821 transitions. Second operand 5 states. [2018-11-28 20:20:28,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:20:28,545 INFO L93 Difference]: Finished difference Result 27231 states and 80368 transitions. [2018-11-28 20:20:28,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-28 20:20:28,546 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 67 [2018-11-28 20:20:28,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:20:28,835 INFO L225 Difference]: With dead ends: 27231 [2018-11-28 20:20:28,835 INFO L226 Difference]: Without dead ends: 27231 [2018-11-28 20:20:28,835 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-11-28 20:20:28,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27231 states. [2018-11-28 20:20:29,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27231 to 21349. [2018-11-28 20:20:29,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21349 states. [2018-11-28 20:20:29,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21349 states to 21349 states and 63327 transitions. [2018-11-28 20:20:29,173 INFO L78 Accepts]: Start accepts. Automaton has 21349 states and 63327 transitions. Word has length 67 [2018-11-28 20:20:29,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:20:29,174 INFO L480 AbstractCegarLoop]: Abstraction has 21349 states and 63327 transitions. [2018-11-28 20:20:29,174 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 20:20:29,174 INFO L276 IsEmpty]: Start isEmpty. Operand 21349 states and 63327 transitions. [2018-11-28 20:20:29,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-11-28 20:20:29,189 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:20:29,189 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 20:20:29,190 INFO L423 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:20:29,191 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:20:29,191 INFO L82 PathProgramCache]: Analyzing trace with hash 1595520999, now seen corresponding path program 1 times [2018-11-28 20:20:29,191 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:20:29,191 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:20:29,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:20:29,195 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:20:29,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:20:29,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:20:29,334 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:29,335 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:20:29,335 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 20:20:29,335 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 20:20:29,335 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 20:20:29,335 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 20:20:29,336 INFO L87 Difference]: Start difference. First operand 21349 states and 63327 transitions. Second operand 4 states. [2018-11-28 20:20:29,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:20:29,911 INFO L93 Difference]: Finished difference Result 28445 states and 84501 transitions. [2018-11-28 20:20:29,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 20:20:29,912 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 67 [2018-11-28 20:20:29,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:20:29,964 INFO L225 Difference]: With dead ends: 28445 [2018-11-28 20:20:29,964 INFO L226 Difference]: Without dead ends: 28025 [2018-11-28 20:20:29,964 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:20:30,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28025 states. [2018-11-28 20:20:30,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28025 to 25833. [2018-11-28 20:20:30,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25833 states. [2018-11-28 20:20:30,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25833 states to 25833 states and 76849 transitions. [2018-11-28 20:20:30,344 INFO L78 Accepts]: Start accepts. Automaton has 25833 states and 76849 transitions. Word has length 67 [2018-11-28 20:20:30,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:20:30,344 INFO L480 AbstractCegarLoop]: Abstraction has 25833 states and 76849 transitions. [2018-11-28 20:20:30,344 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 20:20:30,344 INFO L276 IsEmpty]: Start isEmpty. Operand 25833 states and 76849 transitions. [2018-11-28 20:20:30,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-11-28 20:20:30,364 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:20:30,364 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] [2018-11-28 20:20:30,364 INFO L423 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:20:30,365 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:20:30,365 INFO L82 PathProgramCache]: Analyzing trace with hash -201430360, now seen corresponding path program 1 times [2018-11-28 20:20:30,365 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:20:30,365 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:20:30,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:20:30,369 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:20:30,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:20:30,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:20:30,550 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:30,550 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:20:30,550 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 20:20:30,550 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 20:20:30,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 20:20:30,551 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-28 20:20:30,551 INFO L87 Difference]: Start difference. First operand 25833 states and 76849 transitions. Second operand 5 states. [2018-11-28 20:20:30,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:20:30,606 INFO L93 Difference]: Finished difference Result 7049 states and 16989 transitions. [2018-11-28 20:20:30,607 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 20:20:30,607 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 67 [2018-11-28 20:20:30,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:20:30,614 INFO L225 Difference]: With dead ends: 7049 [2018-11-28 20:20:30,614 INFO L226 Difference]: Without dead ends: 5562 [2018-11-28 20:20:30,615 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-11-28 20:20:30,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5562 states. [2018-11-28 20:20:30,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5562 to 4888. [2018-11-28 20:20:30,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4888 states. [2018-11-28 20:20:30,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4888 states to 4888 states and 11541 transitions. [2018-11-28 20:20:30,670 INFO L78 Accepts]: Start accepts. Automaton has 4888 states and 11541 transitions. Word has length 67 [2018-11-28 20:20:30,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:20:30,670 INFO L480 AbstractCegarLoop]: Abstraction has 4888 states and 11541 transitions. [2018-11-28 20:20:30,670 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 20:20:30,670 INFO L276 IsEmpty]: Start isEmpty. Operand 4888 states and 11541 transitions. [2018-11-28 20:20:30,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-11-28 20:20:30,677 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:20:30,677 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 20:20:30,677 INFO L423 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:20:30,678 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:20:30,678 INFO L82 PathProgramCache]: Analyzing trace with hash -1225324604, now seen corresponding path program 1 times [2018-11-28 20:20:30,678 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:20:30,678 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:20:30,682 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:20:30,682 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:20:30,682 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:20:30,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:20:31,066 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:31,066 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:20:31,066 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 20:20:31,067 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 20:20:31,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 20:20:31,067 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 20:20:31,067 INFO L87 Difference]: Start difference. First operand 4888 states and 11541 transitions. Second operand 5 states. [2018-11-28 20:20:31,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:20:31,729 INFO L93 Difference]: Finished difference Result 5732 states and 13375 transitions. [2018-11-28 20:20:31,730 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-28 20:20:31,730 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 82 [2018-11-28 20:20:31,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:20:31,738 INFO L225 Difference]: With dead ends: 5732 [2018-11-28 20:20:31,738 INFO L226 Difference]: Without dead ends: 5698 [2018-11-28 20:20:31,738 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 3 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:31,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5698 states. [2018-11-28 20:20:31,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5698 to 5046. [2018-11-28 20:20:31,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5046 states. [2018-11-28 20:20:31,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5046 states to 5046 states and 11853 transitions. [2018-11-28 20:20:31,794 INFO L78 Accepts]: Start accepts. Automaton has 5046 states and 11853 transitions. Word has length 82 [2018-11-28 20:20:31,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:20:31,794 INFO L480 AbstractCegarLoop]: Abstraction has 5046 states and 11853 transitions. [2018-11-28 20:20:31,794 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 20:20:31,794 INFO L276 IsEmpty]: Start isEmpty. Operand 5046 states and 11853 transitions. [2018-11-28 20:20:31,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-11-28 20:20:31,800 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:20:31,800 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] [2018-11-28 20:20:31,800 INFO L423 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:20:31,800 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:20:31,800 INFO L82 PathProgramCache]: Analyzing trace with hash -833805224, now seen corresponding path program 2 times [2018-11-28 20:20:31,800 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:20:31,801 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:20:31,802 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:20:31,802 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:20:31,802 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:20:31,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:20:32,264 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:32,265 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:20:32,265 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 20:20:32,265 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 20:20:32,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 20:20:32,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-28 20:20:32,266 INFO L87 Difference]: Start difference. First operand 5046 states and 11853 transitions. Second operand 6 states. [2018-11-28 20:20:32,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:20:32,590 INFO L93 Difference]: Finished difference Result 4984 states and 11681 transitions. [2018-11-28 20:20:32,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-28 20:20:32,591 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 82 [2018-11-28 20:20:32,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:20:32,597 INFO L225 Difference]: With dead ends: 4984 [2018-11-28 20:20:32,597 INFO L226 Difference]: Without dead ends: 4984 [2018-11-28 20:20:32,597 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-11-28 20:20:32,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4984 states. [2018-11-28 20:20:32,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4984 to 4386. [2018-11-28 20:20:32,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4386 states. [2018-11-28 20:20:32,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4386 states to 4386 states and 10211 transitions. [2018-11-28 20:20:32,646 INFO L78 Accepts]: Start accepts. Automaton has 4386 states and 10211 transitions. Word has length 82 [2018-11-28 20:20:32,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:20:32,646 INFO L480 AbstractCegarLoop]: Abstraction has 4386 states and 10211 transitions. [2018-11-28 20:20:32,646 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 20:20:32,647 INFO L276 IsEmpty]: Start isEmpty. Operand 4386 states and 10211 transitions. [2018-11-28 20:20:32,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-11-28 20:20:32,654 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:20:32,654 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] [2018-11-28 20:20:32,654 INFO L423 AbstractCegarLoop]: === Iteration 21 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:20:32,654 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:20:32,654 INFO L82 PathProgramCache]: Analyzing trace with hash -356091205, now seen corresponding path program 1 times [2018-11-28 20:20:32,655 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:20:32,656 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:20:32,659 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:20:32,659 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 20:20:32,659 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:20:32,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:20:32,823 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:32,823 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:20:32,823 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 20:20:32,823 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 20:20:32,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 20:20:32,824 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-11-28 20:20:32,824 INFO L87 Difference]: Start difference. First operand 4386 states and 10211 transitions. Second operand 6 states. [2018-11-28 20:20:33,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:20:33,111 INFO L93 Difference]: Finished difference Result 5808 states and 13592 transitions. [2018-11-28 20:20:33,112 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 20:20:33,112 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 82 [2018-11-28 20:20:33,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:20:33,119 INFO L225 Difference]: With dead ends: 5808 [2018-11-28 20:20:33,119 INFO L226 Difference]: Without dead ends: 5776 [2018-11-28 20:20:33,119 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-11-28 20:20:33,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5776 states. [2018-11-28 20:20:33,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5776 to 4743. [2018-11-28 20:20:33,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4743 states. [2018-11-28 20:20:33,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4743 states to 4743 states and 11085 transitions. [2018-11-28 20:20:33,177 INFO L78 Accepts]: Start accepts. Automaton has 4743 states and 11085 transitions. Word has length 82 [2018-11-28 20:20:33,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:20:33,178 INFO L480 AbstractCegarLoop]: Abstraction has 4743 states and 11085 transitions. [2018-11-28 20:20:33,178 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 20:20:33,178 INFO L276 IsEmpty]: Start isEmpty. Operand 4743 states and 11085 transitions. [2018-11-28 20:20:33,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-11-28 20:20:33,183 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:20:33,183 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] [2018-11-28 20:20:33,183 INFO L423 AbstractCegarLoop]: === Iteration 22 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:20:33,185 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:20:33,185 INFO L82 PathProgramCache]: Analyzing trace with hash 2141924732, now seen corresponding path program 1 times [2018-11-28 20:20:33,185 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:20:33,185 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:20:33,187 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:20:33,187 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:20:33,187 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:20:33,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:20:33,419 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 20:20:33,419 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:20:33,419 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-28 20:20:33,419 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-28 20:20:33,420 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-28 20:20:33,420 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-11-28 20:20:33,420 INFO L87 Difference]: Start difference. First operand 4743 states and 11085 transitions. Second operand 7 states. [2018-11-28 20:20:33,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:20:33,776 INFO L93 Difference]: Finished difference Result 6805 states and 16368 transitions. [2018-11-28 20:20:33,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-28 20:20:33,777 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 82 [2018-11-28 20:20:33,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:20:33,785 INFO L225 Difference]: With dead ends: 6805 [2018-11-28 20:20:33,785 INFO L226 Difference]: Without dead ends: 6805 [2018-11-28 20:20:33,786 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2018-11-28 20:20:33,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6805 states. [2018-11-28 20:20:33,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6805 to 5484. [2018-11-28 20:20:33,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5484 states. [2018-11-28 20:20:33,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5484 states to 5484 states and 12969 transitions. [2018-11-28 20:20:33,872 INFO L78 Accepts]: Start accepts. Automaton has 5484 states and 12969 transitions. Word has length 82 [2018-11-28 20:20:33,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:20:33,873 INFO L480 AbstractCegarLoop]: Abstraction has 5484 states and 12969 transitions. [2018-11-28 20:20:33,873 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-28 20:20:33,873 INFO L276 IsEmpty]: Start isEmpty. Operand 5484 states and 12969 transitions. [2018-11-28 20:20:33,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-11-28 20:20:33,882 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:20:33,882 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] [2018-11-28 20:20:33,882 INFO L423 AbstractCegarLoop]: === Iteration 23 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:20:33,882 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:20:33,884 INFO L82 PathProgramCache]: Analyzing trace with hash -1265538883, now seen corresponding path program 1 times [2018-11-28 20:20:33,885 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:20:33,885 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:20:33,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:20:33,886 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:20:33,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:20:33,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:20:34,157 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:34,158 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:20:34,158 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 20:20:34,158 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 20:20:34,158 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 20:20:34,158 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-28 20:20:34,159 INFO L87 Difference]: Start difference. First operand 5484 states and 12969 transitions. Second operand 6 states. [2018-11-28 20:20:34,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:20:34,213 INFO L93 Difference]: Finished difference Result 5986 states and 14233 transitions. [2018-11-28 20:20:34,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 20:20:34,214 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 82 [2018-11-28 20:20:34,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:20:34,222 INFO L225 Difference]: With dead ends: 5986 [2018-11-28 20:20:34,222 INFO L226 Difference]: Without dead ends: 5986 [2018-11-28 20:20:34,222 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-28 20:20:34,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5986 states. [2018-11-28 20:20:34,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5986 to 4823. [2018-11-28 20:20:34,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4823 states. [2018-11-28 20:20:34,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4823 states to 4823 states and 11285 transitions. [2018-11-28 20:20:34,279 INFO L78 Accepts]: Start accepts. Automaton has 4823 states and 11285 transitions. Word has length 82 [2018-11-28 20:20:34,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:20:34,280 INFO L480 AbstractCegarLoop]: Abstraction has 4823 states and 11285 transitions. [2018-11-28 20:20:34,280 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 20:20:34,280 INFO L276 IsEmpty]: Start isEmpty. Operand 4823 states and 11285 transitions. [2018-11-28 20:20:34,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-11-28 20:20:34,285 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:20:34,285 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] [2018-11-28 20:20:34,285 INFO L423 AbstractCegarLoop]: === Iteration 24 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:20:34,286 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:20:34,286 INFO L82 PathProgramCache]: Analyzing trace with hash 1297452861, now seen corresponding path program 1 times [2018-11-28 20:20:34,286 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:20:34,286 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:20:34,287 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:20:34,287 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:20:34,288 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:20:34,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:20:34,481 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:34,481 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:20:34,481 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 20:20:34,481 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 20:20:34,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 20:20:34,482 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-28 20:20:34,482 INFO L87 Difference]: Start difference. First operand 4823 states and 11285 transitions. Second operand 6 states. [2018-11-28 20:20:34,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:20:34,974 INFO L93 Difference]: Finished difference Result 4439 states and 10117 transitions. [2018-11-28 20:20:34,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 20:20:34,975 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 82 [2018-11-28 20:20:34,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:20:34,981 INFO L225 Difference]: With dead ends: 4439 [2018-11-28 20:20:34,982 INFO L226 Difference]: Without dead ends: 4439 [2018-11-28 20:20:34,982 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-11-28 20:20:34,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4439 states. [2018-11-28 20:20:35,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4439 to 2639. [2018-11-28 20:20:35,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2639 states. [2018-11-28 20:20:35,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2639 states to 2639 states and 6019 transitions. [2018-11-28 20:20:35,032 INFO L78 Accepts]: Start accepts. Automaton has 2639 states and 6019 transitions. Word has length 82 [2018-11-28 20:20:35,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:20:35,033 INFO L480 AbstractCegarLoop]: Abstraction has 2639 states and 6019 transitions. [2018-11-28 20:20:35,033 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 20:20:35,033 INFO L276 IsEmpty]: Start isEmpty. Operand 2639 states and 6019 transitions. [2018-11-28 20:20:35,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-11-28 20:20:35,039 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:20:35,039 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] [2018-11-28 20:20:35,039 INFO L423 AbstractCegarLoop]: === Iteration 25 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:20:35,039 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:20:35,040 INFO L82 PathProgramCache]: Analyzing trace with hash 361661179, now seen corresponding path program 1 times [2018-11-28 20:20:35,040 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:20:35,040 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:20:35,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:20:35,045 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:20:35,045 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:20:35,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:20:35,988 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,988 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:20:35,989 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-11-28 20:20:35,989 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-28 20:20:35,989 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-28 20:20:35,989 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2018-11-28 20:20:35,989 INFO L87 Difference]: Start difference. First operand 2639 states and 6019 transitions. Second operand 10 states. [2018-11-28 20:20:36,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:20:36,587 INFO L93 Difference]: Finished difference Result 3719 states and 8458 transitions. [2018-11-28 20:20:36,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-28 20:20:36,588 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 84 [2018-11-28 20:20:36,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:20:36,593 INFO L225 Difference]: With dead ends: 3719 [2018-11-28 20:20:36,593 INFO L226 Difference]: Without dead ends: 3719 [2018-11-28 20:20:36,594 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2018-11-28 20:20:36,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3719 states. [2018-11-28 20:20:36,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3719 to 3066. [2018-11-28 20:20:36,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3066 states. [2018-11-28 20:20:36,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3066 states to 3066 states and 6992 transitions. [2018-11-28 20:20:36,626 INFO L78 Accepts]: Start accepts. Automaton has 3066 states and 6992 transitions. Word has length 84 [2018-11-28 20:20:36,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:20:36,627 INFO L480 AbstractCegarLoop]: Abstraction has 3066 states and 6992 transitions. [2018-11-28 20:20:36,627 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-28 20:20:36,627 INFO L276 IsEmpty]: Start isEmpty. Operand 3066 states and 6992 transitions. [2018-11-28 20:20:36,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-11-28 20:20:36,630 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:20:36,630 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] [2018-11-28 20:20:36,630 INFO L423 AbstractCegarLoop]: === Iteration 26 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:20:36,631 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:20:36,631 INFO L82 PathProgramCache]: Analyzing trace with hash 1249164860, now seen corresponding path program 1 times [2018-11-28 20:20:36,631 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:20:36,631 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:20:36,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:20:36,632 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:20:36,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:20:36,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:20:36,866 WARN L180 SmtUtils]: Spent 166.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-11-28 20:20:37,192 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:37,192 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:20:37,192 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-28 20:20:37,193 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-28 20:20:37,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-28 20:20:37,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-28 20:20:37,194 INFO L87 Difference]: Start difference. First operand 3066 states and 6992 transitions. Second operand 7 states. [2018-11-28 20:20:37,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:20:37,764 INFO L93 Difference]: Finished difference Result 5128 states and 11818 transitions. [2018-11-28 20:20:37,765 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-28 20:20:37,766 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 84 [2018-11-28 20:20:37,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:20:37,769 INFO L225 Difference]: With dead ends: 5128 [2018-11-28 20:20:37,769 INFO L226 Difference]: Without dead ends: 2134 [2018-11-28 20:20:37,769 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2018-11-28 20:20:37,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2134 states. [2018-11-28 20:20:37,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2134 to 2134. [2018-11-28 20:20:37,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2134 states. [2018-11-28 20:20:37,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2134 states to 2134 states and 4947 transitions. [2018-11-28 20:20:37,790 INFO L78 Accepts]: Start accepts. Automaton has 2134 states and 4947 transitions. Word has length 84 [2018-11-28 20:20:37,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:20:37,790 INFO L480 AbstractCegarLoop]: Abstraction has 2134 states and 4947 transitions. [2018-11-28 20:20:37,790 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-28 20:20:37,790 INFO L276 IsEmpty]: Start isEmpty. Operand 2134 states and 4947 transitions. [2018-11-28 20:20:37,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-11-28 20:20:37,793 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:20:37,793 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] [2018-11-28 20:20:37,793 INFO L423 AbstractCegarLoop]: === Iteration 27 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:20:37,793 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:20:37,793 INFO L82 PathProgramCache]: Analyzing trace with hash -1487745450, now seen corresponding path program 1 times [2018-11-28 20:20:37,794 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:20:37,794 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:20:37,796 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:20:37,796 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:20:37,796 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:20:37,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:20:38,060 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,061 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:20:38,061 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-28 20:20:38,061 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-28 20:20:38,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-28 20:20:38,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-11-28 20:20:38,062 INFO L87 Difference]: Start difference. First operand 2134 states and 4947 transitions. Second operand 7 states. [2018-11-28 20:20:38,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:20:38,354 INFO L93 Difference]: Finished difference Result 2222 states and 5085 transitions. [2018-11-28 20:20:38,355 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-28 20:20:38,355 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 84 [2018-11-28 20:20:38,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:20:38,358 INFO L225 Difference]: With dead ends: 2222 [2018-11-28 20:20:38,358 INFO L226 Difference]: Without dead ends: 2222 [2018-11-28 20:20:38,358 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2018-11-28 20:20:38,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2222 states. [2018-11-28 20:20:38,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2222 to 2113. [2018-11-28 20:20:38,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2113 states. [2018-11-28 20:20:38,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2113 states to 2113 states and 4865 transitions. [2018-11-28 20:20:38,378 INFO L78 Accepts]: Start accepts. Automaton has 2113 states and 4865 transitions. Word has length 84 [2018-11-28 20:20:38,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:20:38,378 INFO L480 AbstractCegarLoop]: Abstraction has 2113 states and 4865 transitions. [2018-11-28 20:20:38,378 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-28 20:20:38,378 INFO L276 IsEmpty]: Start isEmpty. Operand 2113 states and 4865 transitions. [2018-11-28 20:20:38,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-11-28 20:20:38,381 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:20:38,381 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] [2018-11-28 20:20:38,381 INFO L423 AbstractCegarLoop]: === Iteration 28 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:20:38,381 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:20:38,382 INFO L82 PathProgramCache]: Analyzing trace with hash -1276394537, now seen corresponding path program 2 times [2018-11-28 20:20:38,382 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:20:38,382 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:20:38,383 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:20:38,383 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:20:38,383 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:20:38,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:20:38,893 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,893 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:20:38,894 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-28 20:20:38,894 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-28 20:20:38,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-28 20:20:38,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-11-28 20:20:38,895 INFO L87 Difference]: Start difference. First operand 2113 states and 4865 transitions. Second operand 8 states. [2018-11-28 20:20:39,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:20:39,231 INFO L93 Difference]: Finished difference Result 2449 states and 5642 transitions. [2018-11-28 20:20:39,232 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-28 20:20:39,232 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 84 [2018-11-28 20:20:39,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:20:39,236 INFO L225 Difference]: With dead ends: 2449 [2018-11-28 20:20:39,236 INFO L226 Difference]: Without dead ends: 2449 [2018-11-28 20:20:39,237 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2018-11-28 20:20:39,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2449 states. [2018-11-28 20:20:39,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2449 to 2088. [2018-11-28 20:20:39,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2088 states. [2018-11-28 20:20:39,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2088 states to 2088 states and 4799 transitions. [2018-11-28 20:20:39,260 INFO L78 Accepts]: Start accepts. Automaton has 2088 states and 4799 transitions. Word has length 84 [2018-11-28 20:20:39,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:20:39,260 INFO L480 AbstractCegarLoop]: Abstraction has 2088 states and 4799 transitions. [2018-11-28 20:20:39,260 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-28 20:20:39,260 INFO L276 IsEmpty]: Start isEmpty. Operand 2088 states and 4799 transitions. [2018-11-28 20:20:39,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-11-28 20:20:39,263 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:20:39,263 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] [2018-11-28 20:20:39,263 INFO L423 AbstractCegarLoop]: === Iteration 29 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:20:39,264 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:20:39,264 INFO L82 PathProgramCache]: Analyzing trace with hash -388890856, now seen corresponding path program 2 times [2018-11-28 20:20:39,264 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:20:39,264 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:20:39,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:20:39,265 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 20:20:39,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:20:39,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:20:39,440 WARN L180 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2018-11-28 20:20:39,524 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,524 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:20:39,524 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-11-28 20:20:39,524 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-28 20:20:39,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-28 20:20:39,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-11-28 20:20:39,525 INFO L87 Difference]: Start difference. First operand 2088 states and 4799 transitions. Second operand 11 states. [2018-11-28 20:20:40,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:20:40,590 INFO L93 Difference]: Finished difference Result 4156 states and 9615 transitions. [2018-11-28 20:20:40,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-28 20:20:40,591 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 84 [2018-11-28 20:20:40,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:20:40,596 INFO L225 Difference]: With dead ends: 4156 [2018-11-28 20:20:40,596 INFO L226 Difference]: Without dead ends: 2453 [2018-11-28 20:20:40,597 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=70, Invalid=310, Unknown=0, NotChecked=0, Total=380 [2018-11-28 20:20:40,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2453 states. [2018-11-28 20:20:40,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2453 to 2125. [2018-11-28 20:20:40,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2125 states. [2018-11-28 20:20:40,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2125 states to 2125 states and 4828 transitions. [2018-11-28 20:20:40,628 INFO L78 Accepts]: Start accepts. Automaton has 2125 states and 4828 transitions. Word has length 84 [2018-11-28 20:20:40,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:20:40,628 INFO L480 AbstractCegarLoop]: Abstraction has 2125 states and 4828 transitions. [2018-11-28 20:20:40,628 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-28 20:20:40,628 INFO L276 IsEmpty]: Start isEmpty. Operand 2125 states and 4828 transitions. [2018-11-28 20:20:40,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-11-28 20:20:40,631 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:20:40,632 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] [2018-11-28 20:20:40,632 INFO L423 AbstractCegarLoop]: === Iteration 30 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:20:40,632 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:20:40,632 INFO L82 PathProgramCache]: Analyzing trace with hash 10917176, now seen corresponding path program 3 times [2018-11-28 20:20:40,633 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:20:40,633 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:20:40,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:20:40,635 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 20:20:40,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:20:40,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 20:20:40,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 20:20:40,708 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-11-28 20:20:40,874 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-11-28 20:20:40,876 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 08:20:40 BasicIcfg [2018-11-28 20:20:40,876 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-28 20:20:40,881 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-28 20:20:40,881 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-28 20:20:40,881 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-28 20:20:40,882 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 08:19:50" (3/4) ... [2018-11-28 20:20:40,888 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-11-28 20:20:41,094 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2018-11-28 20:20:41,098 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-28 20:20:41,099 INFO L168 Benchmark]: Toolchain (without parser) took 52489.35 ms. Allocated memory was 1.0 GB in the beginning and 4.3 GB in the end (delta: 3.3 GB). Free memory was 950.0 MB in the beginning and 1.8 GB in the end (delta: -863.1 MB). Peak memory consumption was 2.4 GB. Max. memory is 11.5 GB. [2018-11-28 20:20:41,102 INFO L168 Benchmark]: CDTParser took 0.30 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:20:41,102 INFO L168 Benchmark]: CACSL2BoogieTranslator took 874.26 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 159.9 MB). Free memory was 944.6 MB in the beginning and 1.1 GB in the end (delta: -185.0 MB). Peak memory consumption was 25.7 MB. Max. memory is 11.5 GB. [2018-11-28 20:20:41,103 INFO L168 Benchmark]: Boogie Procedure Inliner took 63.42 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 20:20:41,103 INFO L168 Benchmark]: Boogie Preprocessor took 46.34 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 20:20:41,104 INFO L168 Benchmark]: RCFGBuilder took 1155.44 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 43.3 MB). Peak memory consumption was 43.3 MB. Max. memory is 11.5 GB. [2018-11-28 20:20:41,105 INFO L168 Benchmark]: TraceAbstraction took 50122.96 ms. Allocated memory was 1.2 GB in the beginning and 4.3 GB in the end (delta: 3.1 GB). Free memory was 1.1 GB in the beginning and 1.9 GB in the end (delta: -777.9 MB). Peak memory consumption was 2.4 GB. Max. memory is 11.5 GB. [2018-11-28 20:20:41,111 INFO L168 Benchmark]: Witness Printer took 217.73 ms. Allocated memory is still 4.3 GB. Free memory was 1.9 GB in the beginning and 1.8 GB in the end (delta: 44.8 MB). Peak memory consumption was 44.8 MB. Max. memory is 11.5 GB. [2018-11-28 20:20:41,114 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.30 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 874.26 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 159.9 MB). Free memory was 944.6 MB in the beginning and 1.1 GB in the end (delta: -185.0 MB). Peak memory consumption was 25.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 63.42 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 46.34 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 1155.44 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 43.3 MB). Peak memory consumption was 43.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 50122.96 ms. Allocated memory was 1.2 GB in the beginning and 4.3 GB in the end (delta: 3.1 GB). Free memory was 1.1 GB in the beginning and 1.9 GB in the end (delta: -777.9 MB). Peak memory consumption was 2.4 GB. Max. memory is 11.5 GB. * Witness Printer took 217.73 ms. Allocated memory is still 4.3 GB. Free memory was 1.9 GB in the beginning and 1.8 GB in the end (delta: 44.8 MB). Peak memory consumption was 44.8 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] [L683] -1 _Bool x$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, x$flush_delayed=0] [L684] -1 int x$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, x$flush_delayed=0, x$mem_tmp=0] [L685] -1 _Bool x$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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0] [L686] -1 _Bool x$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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0] [L687] -1 _Bool x$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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0] [L688] -1 _Bool x$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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0] [L689] -1 _Bool x$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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0] [L690] -1 _Bool x$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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0] [L691] -1 _Bool x$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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0] [L692] -1 int *x$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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}] [L693] -1 int x$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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0] [L694] -1 _Bool x$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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0] [L695] -1 int x$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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0] [L696] -1 _Bool x$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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0] [L698] -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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L699] -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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L700] -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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L776] -1 pthread_t t1643; 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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L777] FCALL, FORK -1 pthread_create(&t1643, ((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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L778] -1 pthread_t t1644; 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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L779] FCALL, FORK -1 pthread_create(&t1644, ((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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L734] 0 x$w_buff1 = x$w_buff0 [L735] 0 x$w_buff0 = 1 [L736] 0 x$w_buff1_used = x$w_buff0_used [L737] 0 x$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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L739] 0 x$r_buff1_thd0 = x$r_buff0_thd0 [L740] 0 x$r_buff1_thd1 = x$r_buff0_thd1 [L741] 0 x$r_buff1_thd2 = x$r_buff0_thd2 [L742] 0 x$r_buff0_thd2 = (_Bool)1 [L745] 0 y = 1 [L748] 0 __unbuffered_p1_EAX = y [L751] 0 __unbuffered_p1_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L754] EXPR 0 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L704] 1 y = 2 [L709] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L710] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L711] 1 x$flush_delayed = weak$$choice2 [L712] 1 x$mem_tmp = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L713] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) VAL [!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L754] 0 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L755] EXPR 0 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used VAL [!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L755] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L713] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L756] EXPR 0 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L756] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L757] EXPR 0 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L714] EXPR 1 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0))=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L714] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L715] EXPR 1 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L715] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L716] EXPR 1 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L716] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L717] EXPR 1 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L717] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L718] EXPR 1 weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L718] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L719] EXPR 1 weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L719] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L720] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L721] EXPR 1 x$flush_delayed ? x$mem_tmp : x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=1, x$flush_delayed ? x$mem_tmp : x=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L721] 1 x = x$flush_delayed ? x$mem_tmp : x [L722] 1 x$flush_delayed = (_Bool)0 [L727] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L757] 0 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L758] EXPR 0 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L758] 0 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L761] 0 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L781] -1 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L785] EXPR -1 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L785] EXPR -1 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L785] EXPR -1 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L785] -1 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L786] EXPR -1 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L786] -1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L787] EXPR -1 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L787] -1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L788] EXPR -1 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L788] -1 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L789] EXPR -1 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L789] -1 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L792] -1 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 1) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L5] COND TRUE -1 !expression VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L5] -1 __VERIFIER_error() VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 199 locations, 3 error locations. UNSAFE Result, 49.9s OverallTime, 30 OverallIterations, 1 TraceHistogramMax, 26.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 7639 SDtfs, 9193 SDslu, 17612 SDs, 0 SdLazy, 6957 SolverSat, 406 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 13.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 287 GetRequests, 73 SyntacticMatches, 22 SemanticMatches, 192 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 156 ImplicationChecksByTransitivity, 8.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=61472occurred in iteration=7, 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: 12.8s AutomataMinimizationTime, 29 MinimizatonAttempts, 145274 StatesRemovedByMinimization, 28 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 7.5s InterpolantComputationTime, 2046 NumberOfCodeBlocks, 2046 NumberOfCodeBlocksAsserted, 30 NumberOfCheckSat, 1933 ConstructedInterpolants, 0 QuantifiedInterpolants, 348727 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 29 InterpolantComputations, 29 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...