./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/pthread-wmm/rfi004_rmo.opt_false-unreach-call.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 2e94e6aa Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/svcomp/c/pthread-wmm/rfi004_rmo.opt_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 a6f7774a15cefd0813adba8dfa8b75a7f19867db ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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-2e94e6a [2018-12-31 22:49:00,039 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-31 22:49:00,041 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-31 22:49:00,058 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-31 22:49:00,059 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-31 22:49:00,060 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-31 22:49:00,061 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-31 22:49:00,064 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-31 22:49:00,067 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-31 22:49:00,068 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-31 22:49:00,070 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-31 22:49:00,070 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-31 22:49:00,071 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-31 22:49:00,073 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-31 22:49:00,082 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-31 22:49:00,083 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-31 22:49:00,084 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-31 22:49:00,085 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-31 22:49:00,088 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-31 22:49:00,091 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-31 22:49:00,094 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-31 22:49:00,097 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-31 22:49:00,103 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-31 22:49:00,103 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-31 22:49:00,103 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-31 22:49:00,104 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-31 22:49:00,105 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-31 22:49:00,110 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-31 22:49:00,113 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-31 22:49:00,115 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-31 22:49:00,115 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-31 22:49:00,116 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-31 22:49:00,116 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-31 22:49:00,117 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-31 22:49:00,119 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-31 22:49:00,120 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-31 22:49:00,120 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-12-31 22:49:00,145 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-31 22:49:00,147 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-31 22:49:00,148 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-31 22:49:00,148 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-31 22:49:00,149 INFO L133 SettingsManager]: * Use SBE=true [2018-12-31 22:49:00,149 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-31 22:49:00,149 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-31 22:49:00,149 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-31 22:49:00,149 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-31 22:49:00,150 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-31 22:49:00,150 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-31 22:49:00,150 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-31 22:49:00,150 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-31 22:49:00,150 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-31 22:49:00,150 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-31 22:49:00,151 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-31 22:49:00,151 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-31 22:49:00,151 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-31 22:49:00,152 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-31 22:49:00,152 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-31 22:49:00,152 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-31 22:49:00,152 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-31 22:49:00,152 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-31 22:49:00,152 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-31 22:49:00,153 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-31 22:49:00,153 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-31 22:49:00,153 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-31 22:49:00,153 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-31 22:49:00,153 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 -> a6f7774a15cefd0813adba8dfa8b75a7f19867db [2018-12-31 22:49:00,221 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-31 22:49:00,234 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-31 22:49:00,239 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-31 22:49:00,240 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-31 22:49:00,241 INFO L276 PluginConnector]: CDTParser initialized [2018-12-31 22:49:00,242 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/pthread-wmm/rfi004_rmo.opt_false-unreach-call.i [2018-12-31 22:49:00,304 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3894c7f2d/29a6c3111ea948d7b52293f2f00582a3/FLAG0b0833326 [2018-12-31 22:49:00,893 INFO L307 CDTParser]: Found 1 translation units. [2018-12-31 22:49:00,894 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/pthread-wmm/rfi004_rmo.opt_false-unreach-call.i [2018-12-31 22:49:00,909 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3894c7f2d/29a6c3111ea948d7b52293f2f00582a3/FLAG0b0833326 [2018-12-31 22:49:01,134 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3894c7f2d/29a6c3111ea948d7b52293f2f00582a3 [2018-12-31 22:49:01,139 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-31 22:49:01,141 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-31 22:49:01,142 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-31 22:49:01,143 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-31 22:49:01,147 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-31 22:49:01,148 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.12 10:49:01" (1/1) ... [2018-12-31 22:49:01,154 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7307a100 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 10:49:01, skipping insertion in model container [2018-12-31 22:49:01,154 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.12 10:49:01" (1/1) ... [2018-12-31 22:49:01,164 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-31 22:49:01,231 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-31 22:49:01,702 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-31 22:49:01,717 INFO L191 MainTranslator]: Completed pre-run [2018-12-31 22:49:01,873 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-31 22:49:01,950 INFO L195 MainTranslator]: Completed translation [2018-12-31 22:49:01,950 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 10:49:01 WrapperNode [2018-12-31 22:49:01,950 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-31 22:49:01,951 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-31 22:49:01,951 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-31 22:49:01,951 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-31 22:49:01,962 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 10:49:01" (1/1) ... [2018-12-31 22:49:01,986 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 10:49:01" (1/1) ... [2018-12-31 22:49:02,019 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-31 22:49:02,020 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-31 22:49:02,020 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-31 22:49:02,020 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-31 22:49:02,032 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 10:49:01" (1/1) ... [2018-12-31 22:49:02,032 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 10:49:01" (1/1) ... [2018-12-31 22:49:02,044 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 10:49:01" (1/1) ... [2018-12-31 22:49:02,044 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 10:49:01" (1/1) ... [2018-12-31 22:49:02,065 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 10:49:01" (1/1) ... [2018-12-31 22:49:02,071 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 10:49:01" (1/1) ... [2018-12-31 22:49:02,075 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 10:49:01" (1/1) ... [2018-12-31 22:49:02,079 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-31 22:49:02,080 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-31 22:49:02,080 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-31 22:49:02,080 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-31 22:49:02,081 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 10:49:01" (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-12-31 22:49:02,150 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-31 22:49:02,150 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2018-12-31 22:49:02,150 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2018-12-31 22:49:02,150 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-31 22:49:02,151 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2018-12-31 22:49:02,151 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2018-12-31 22:49:02,151 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2018-12-31 22:49:02,152 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2018-12-31 22:49:02,152 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2018-12-31 22:49:02,152 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-31 22:49:02,153 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-31 22:49:02,154 WARN L198 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2018-12-31 22:49:03,207 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-31 22:49:03,207 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-12-31 22:49:03,207 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 10:49:03 BoogieIcfgContainer [2018-12-31 22:49:03,209 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-31 22:49:03,211 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-31 22:49:03,211 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-31 22:49:03,214 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-31 22:49:03,214 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.12 10:49:01" (1/3) ... [2018-12-31 22:49:03,215 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a048d9d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.12 10:49:03, skipping insertion in model container [2018-12-31 22:49:03,215 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 10:49:01" (2/3) ... [2018-12-31 22:49:03,216 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a048d9d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.12 10:49:03, skipping insertion in model container [2018-12-31 22:49:03,216 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 10:49:03" (3/3) ... [2018-12-31 22:49:03,218 INFO L112 eAbstractionObserver]: Analyzing ICFG rfi004_rmo.opt_false-unreach-call.i [2018-12-31 22:49:03,264 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:49:03,265 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:49:03,265 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:49:03,265 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:49:03,265 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:49:03,265 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:49:03,266 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:49:03,266 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:49:03,266 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:49:03,267 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:49:03,267 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:49:03,267 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:49:03,267 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:49:03,267 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:49:03,268 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:49:03,268 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:49:03,268 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:49:03,268 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:49:03,269 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:49:03,269 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:49:03,269 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:49:03,269 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:49:03,269 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:49:03,270 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:49:03,270 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:49:03,270 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:49:03,270 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:49:03,271 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:49:03,271 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:49:03,271 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:49:03,271 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:49:03,271 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:49:03,272 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:49:03,272 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:49:03,272 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:49:03,272 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:49:03,272 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:49:03,274 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:49:03,274 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:49:03,274 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:49:03,274 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:49:03,275 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:49:03,275 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:49:03,275 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:49:03,275 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:49:03,275 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:49:03,277 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:49:03,277 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:49:03,278 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:49:03,278 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:49:03,278 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:49:03,278 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:49:03,278 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:49:03,281 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:49:03,281 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:49:03,282 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:49:03,282 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:49:03,282 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:49:03,282 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:49:03,283 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:49:03,283 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:49:03,283 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:49:03,283 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:49:03,283 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:49:03,286 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:49:03,286 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:49:03,286 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:49:03,286 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:49:03,287 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:49:03,288 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:49:03,288 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:49:03,288 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:49:03,288 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:49:03,290 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:49:03,291 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:49:03,291 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:49:03,291 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:49:03,291 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:49:03,291 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:49:03,293 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:49:03,294 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:49:03,294 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:49:03,294 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:49:03,295 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:49:03,295 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:49:03,295 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:49:03,295 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:49:03,296 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:49:03,296 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:49:03,296 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:49:03,296 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:49:03,296 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:49:03,297 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet26.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:49:03,297 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet26.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:49:03,297 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:49:03,297 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:49:03,297 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet26.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:49:03,297 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet26.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:49:03,304 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:49:03,305 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:49:03,306 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:49:03,306 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:49:03,306 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:49:03,306 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:49:03,306 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:49:03,308 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:49:03,311 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:49:03,312 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:49:03,313 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:49:03,314 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:49:03,314 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:49:03,314 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:49:03,314 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:49:03,314 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:49:03,315 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:49:03,316 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:49:03,316 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:49:03,316 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:49:03,316 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:49:03,316 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:49:03,318 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:49:03,318 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:49:03,318 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:49:03,318 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:49:03,319 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:49:03,319 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:49:03,319 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:49:03,319 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:49:03,320 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:49:03,321 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:49:03,321 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet33.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:49:03,321 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet33.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:49:03,321 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:49:03,322 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:49:03,323 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet33.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:49:03,323 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet33.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:49:03,332 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2018-12-31 22:49:03,333 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-31 22:49:03,344 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-12-31 22:49:03,362 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2018-12-31 22:49:03,386 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-31 22:49:03,387 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-31 22:49:03,387 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-31 22:49:03,387 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-31 22:49:03,387 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-31 22:49:03,387 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-31 22:49:03,388 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-31 22:49:03,388 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-31 22:49:03,388 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-31 22:49:03,401 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 132places, 164 transitions [2018-12-31 22:49:05,435 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 27856 states. [2018-12-31 22:49:05,437 INFO L276 IsEmpty]: Start isEmpty. Operand 27856 states. [2018-12-31 22:49:05,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-12-31 22:49:05,448 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 22:49:05,449 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 22:49:05,451 INFO L423 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 22:49:05,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 22:49:05,457 INFO L82 PathProgramCache]: Analyzing trace with hash -31372928, now seen corresponding path program 1 times [2018-12-31 22:49:05,459 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 22:49:05,459 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 22:49:05,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:49:05,525 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 22:49:05,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:49:05,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 22:49:05,772 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 22:49:05,775 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 22:49:05,775 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 22:49:05,779 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-31 22:49:05,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-31 22:49:05,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-31 22:49:05,799 INFO L87 Difference]: Start difference. First operand 27856 states. Second operand 4 states. [2018-12-31 22:49:07,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 22:49:07,079 INFO L93 Difference]: Finished difference Result 47768 states and 183119 transitions. [2018-12-31 22:49:07,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-31 22:49:07,082 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 39 [2018-12-31 22:49:07,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 22:49:07,711 INFO L225 Difference]: With dead ends: 47768 [2018-12-31 22:49:07,712 INFO L226 Difference]: Without dead ends: 34608 [2018-12-31 22:49:07,714 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-12-31 22:49:08,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34608 states. [2018-12-31 22:49:08,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34608 to 21756. [2018-12-31 22:49:08,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21756 states. [2018-12-31 22:49:08,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21756 states to 21756 states and 83441 transitions. [2018-12-31 22:49:08,836 INFO L78 Accepts]: Start accepts. Automaton has 21756 states and 83441 transitions. Word has length 39 [2018-12-31 22:49:08,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 22:49:08,836 INFO L480 AbstractCegarLoop]: Abstraction has 21756 states and 83441 transitions. [2018-12-31 22:49:08,837 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-31 22:49:08,837 INFO L276 IsEmpty]: Start isEmpty. Operand 21756 states and 83441 transitions. [2018-12-31 22:49:08,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-12-31 22:49:08,851 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 22:49:08,851 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-12-31 22:49:08,852 INFO L423 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 22:49:08,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 22:49:08,852 INFO L82 PathProgramCache]: Analyzing trace with hash -954263015, now seen corresponding path program 1 times [2018-12-31 22:49:08,853 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 22:49:08,854 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 22:49:08,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:49:08,860 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 22:49:08,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:49:08,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 22:49:09,030 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 22:49:09,031 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 22:49:09,031 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-31 22:49:09,032 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 22:49:09,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 22:49:09,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 22:49:09,037 INFO L87 Difference]: Start difference. First operand 21756 states and 83441 transitions. Second operand 3 states. [2018-12-31 22:49:09,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 22:49:09,909 INFO L93 Difference]: Finished difference Result 21756 states and 83420 transitions. [2018-12-31 22:49:09,910 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 22:49:09,910 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 47 [2018-12-31 22:49:09,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 22:49:10,027 INFO L225 Difference]: With dead ends: 21756 [2018-12-31 22:49:10,028 INFO L226 Difference]: Without dead ends: 21756 [2018-12-31 22:49:10,029 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-12-31 22:49:10,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21756 states. [2018-12-31 22:49:10,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21756 to 21756. [2018-12-31 22:49:10,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21756 states. [2018-12-31 22:49:11,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21756 states to 21756 states and 83420 transitions. [2018-12-31 22:49:11,084 INFO L78 Accepts]: Start accepts. Automaton has 21756 states and 83420 transitions. Word has length 47 [2018-12-31 22:49:11,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 22:49:11,085 INFO L480 AbstractCegarLoop]: Abstraction has 21756 states and 83420 transitions. [2018-12-31 22:49:11,085 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 22:49:11,085 INFO L276 IsEmpty]: Start isEmpty. Operand 21756 states and 83420 transitions. [2018-12-31 22:49:11,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-12-31 22:49:11,091 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 22:49:11,091 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 22:49:11,091 INFO L423 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 22:49:11,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 22:49:11,093 INFO L82 PathProgramCache]: Analyzing trace with hash 788547320, now seen corresponding path program 1 times [2018-12-31 22:49:11,093 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 22:49:11,093 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 22:49:11,098 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:49:11,098 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 22:49:11,098 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:49:11,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 22:49:11,333 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 22:49:11,335 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 22:49:11,335 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-31 22:49:11,336 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 22:49:11,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 22:49:11,339 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-31 22:49:11,339 INFO L87 Difference]: Start difference. First operand 21756 states and 83420 transitions. Second operand 5 states. [2018-12-31 22:49:12,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 22:49:12,949 INFO L93 Difference]: Finished difference Result 47634 states and 173781 transitions. [2018-12-31 22:49:12,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-31 22:49:12,950 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 47 [2018-12-31 22:49:12,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 22:49:13,657 INFO L225 Difference]: With dead ends: 47634 [2018-12-31 22:49:13,657 INFO L226 Difference]: Without dead ends: 47066 [2018-12-31 22:49:13,658 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-31 22:49:13,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47066 states. [2018-12-31 22:49:14,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47066 to 31796. [2018-12-31 22:49:14,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31796 states. [2018-12-31 22:49:14,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31796 states to 31796 states and 116798 transitions. [2018-12-31 22:49:14,711 INFO L78 Accepts]: Start accepts. Automaton has 31796 states and 116798 transitions. Word has length 47 [2018-12-31 22:49:14,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 22:49:14,713 INFO L480 AbstractCegarLoop]: Abstraction has 31796 states and 116798 transitions. [2018-12-31 22:49:14,713 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 22:49:14,713 INFO L276 IsEmpty]: Start isEmpty. Operand 31796 states and 116798 transitions. [2018-12-31 22:49:14,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-12-31 22:49:14,718 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 22:49:14,718 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 22:49:14,719 INFO L423 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 22:49:14,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 22:49:14,720 INFO L82 PathProgramCache]: Analyzing trace with hash 1367871073, now seen corresponding path program 1 times [2018-12-31 22:49:14,720 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 22:49:14,720 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 22:49:14,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:49:14,723 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 22:49:14,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:49:14,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 22:49:14,820 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 22:49:14,820 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 22:49:14,820 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-31 22:49:14,821 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 22:49:14,821 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 22:49:14,821 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-31 22:49:14,821 INFO L87 Difference]: Start difference. First operand 31796 states and 116798 transitions. Second operand 5 states. [2018-12-31 22:49:15,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 22:49:15,679 INFO L93 Difference]: Finished difference Result 63028 states and 229088 transitions. [2018-12-31 22:49:15,679 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-31 22:49:15,680 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 48 [2018-12-31 22:49:15,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 22:49:16,522 INFO L225 Difference]: With dead ends: 63028 [2018-12-31 22:49:16,523 INFO L226 Difference]: Without dead ends: 62564 [2018-12-31 22:49:16,523 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-12-31 22:49:16,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62564 states. [2018-12-31 22:49:17,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62564 to 35364. [2018-12-31 22:49:17,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35364 states. [2018-12-31 22:49:17,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35364 states to 35364 states and 128851 transitions. [2018-12-31 22:49:17,626 INFO L78 Accepts]: Start accepts. Automaton has 35364 states and 128851 transitions. Word has length 48 [2018-12-31 22:49:17,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 22:49:17,626 INFO L480 AbstractCegarLoop]: Abstraction has 35364 states and 128851 transitions. [2018-12-31 22:49:17,626 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 22:49:17,627 INFO L276 IsEmpty]: Start isEmpty. Operand 35364 states and 128851 transitions. [2018-12-31 22:49:17,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-12-31 22:49:17,635 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 22:49:17,635 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 22:49:17,635 INFO L423 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 22:49:17,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 22:49:17,636 INFO L82 PathProgramCache]: Analyzing trace with hash -1372813561, now seen corresponding path program 1 times [2018-12-31 22:49:17,636 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 22:49:17,636 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 22:49:17,640 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:49:17,640 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 22:49:17,640 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:49:17,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 22:49:17,727 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 22:49:17,727 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 22:49:17,727 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-31 22:49:17,729 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 22:49:17,729 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 22:49:17,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 22:49:17,729 INFO L87 Difference]: Start difference. First operand 35364 states and 128851 transitions. Second operand 3 states. [2018-12-31 22:49:18,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 22:49:18,235 INFO L93 Difference]: Finished difference Result 45910 states and 163916 transitions. [2018-12-31 22:49:18,236 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 22:49:18,236 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2018-12-31 22:49:18,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 22:49:18,357 INFO L225 Difference]: With dead ends: 45910 [2018-12-31 22:49:18,358 INFO L226 Difference]: Without dead ends: 45910 [2018-12-31 22:49:18,358 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-12-31 22:49:19,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45910 states. [2018-12-31 22:49:19,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45910 to 40247. [2018-12-31 22:49:19,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40247 states. [2018-12-31 22:49:19,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40247 states to 40247 states and 145186 transitions. [2018-12-31 22:49:19,902 INFO L78 Accepts]: Start accepts. Automaton has 40247 states and 145186 transitions. Word has length 50 [2018-12-31 22:49:19,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 22:49:19,902 INFO L480 AbstractCegarLoop]: Abstraction has 40247 states and 145186 transitions. [2018-12-31 22:49:19,902 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 22:49:19,903 INFO L276 IsEmpty]: Start isEmpty. Operand 40247 states and 145186 transitions. [2018-12-31 22:49:19,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-12-31 22:49:19,919 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 22:49:19,919 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 22:49:19,919 INFO L423 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 22:49:19,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 22:49:19,921 INFO L82 PathProgramCache]: Analyzing trace with hash 1505170194, now seen corresponding path program 1 times [2018-12-31 22:49:19,921 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 22:49:19,921 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 22:49:19,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:49:19,925 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 22:49:19,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:49:19,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 22:49:20,039 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 22:49:20,040 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 22:49:20,040 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-31 22:49:20,040 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-31 22:49:20,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-31 22:49:20,042 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-31 22:49:20,042 INFO L87 Difference]: Start difference. First operand 40247 states and 145186 transitions. Second operand 6 states. [2018-12-31 22:49:21,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 22:49:21,131 INFO L93 Difference]: Finished difference Result 70850 states and 252328 transitions. [2018-12-31 22:49:21,132 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-31 22:49:21,132 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 54 [2018-12-31 22:49:21,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 22:49:21,360 INFO L225 Difference]: With dead ends: 70850 [2018-12-31 22:49:21,361 INFO L226 Difference]: Without dead ends: 70314 [2018-12-31 22:49:21,361 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2018-12-31 22:49:21,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70314 states. [2018-12-31 22:49:22,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70314 to 40898. [2018-12-31 22:49:22,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40898 states. [2018-12-31 22:49:23,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40898 states to 40898 states and 147642 transitions. [2018-12-31 22:49:23,444 INFO L78 Accepts]: Start accepts. Automaton has 40898 states and 147642 transitions. Word has length 54 [2018-12-31 22:49:23,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 22:49:23,445 INFO L480 AbstractCegarLoop]: Abstraction has 40898 states and 147642 transitions. [2018-12-31 22:49:23,445 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-31 22:49:23,445 INFO L276 IsEmpty]: Start isEmpty. Operand 40898 states and 147642 transitions. [2018-12-31 22:49:23,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-12-31 22:49:23,464 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 22:49:23,464 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 22:49:23,464 INFO L423 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 22:49:23,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 22:49:23,465 INFO L82 PathProgramCache]: Analyzing trace with hash -1915358571, now seen corresponding path program 1 times [2018-12-31 22:49:23,465 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 22:49:23,465 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 22:49:23,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:49:23,469 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 22:49:23,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:49:23,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 22:49:23,667 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 22:49:23,667 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 22:49:23,667 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-31 22:49:23,668 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-31 22:49:23,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-31 22:49:23,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-31 22:49:23,668 INFO L87 Difference]: Start difference. First operand 40898 states and 147642 transitions. Second operand 6 states. [2018-12-31 22:49:24,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 22:49:24,916 INFO L93 Difference]: Finished difference Result 56599 states and 201648 transitions. [2018-12-31 22:49:24,916 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-31 22:49:24,916 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 54 [2018-12-31 22:49:24,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 22:49:25,060 INFO L225 Difference]: With dead ends: 56599 [2018-12-31 22:49:25,060 INFO L226 Difference]: Without dead ends: 55460 [2018-12-31 22:49:25,060 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-31 22:49:25,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55460 states. [2018-12-31 22:49:25,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55460 to 51955. [2018-12-31 22:49:25,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51955 states. [2018-12-31 22:49:26,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51955 states to 51955 states and 186007 transitions. [2018-12-31 22:49:26,121 INFO L78 Accepts]: Start accepts. Automaton has 51955 states and 186007 transitions. Word has length 54 [2018-12-31 22:49:26,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 22:49:26,121 INFO L480 AbstractCegarLoop]: Abstraction has 51955 states and 186007 transitions. [2018-12-31 22:49:26,121 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-31 22:49:26,121 INFO L276 IsEmpty]: Start isEmpty. Operand 51955 states and 186007 transitions. [2018-12-31 22:49:26,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-12-31 22:49:26,141 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 22:49:26,141 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 22:49:26,142 INFO L423 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 22:49:26,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 22:49:26,142 INFO L82 PathProgramCache]: Analyzing trace with hash 582657366, now seen corresponding path program 1 times [2018-12-31 22:49:26,142 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 22:49:26,142 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 22:49:26,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:49:26,146 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 22:49:26,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:49:26,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 22:49:26,345 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 22:49:26,345 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 22:49:26,345 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-31 22:49:26,346 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-31 22:49:26,346 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-31 22:49:26,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-31 22:49:26,346 INFO L87 Difference]: Start difference. First operand 51955 states and 186007 transitions. Second operand 7 states. [2018-12-31 22:49:27,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 22:49:27,994 INFO L93 Difference]: Finished difference Result 75638 states and 260104 transitions. [2018-12-31 22:49:27,995 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-31 22:49:27,995 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 54 [2018-12-31 22:49:27,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 22:49:29,339 INFO L225 Difference]: With dead ends: 75638 [2018-12-31 22:49:29,339 INFO L226 Difference]: Without dead ends: 75638 [2018-12-31 22:49:29,340 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-12-31 22:49:29,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75638 states. [2018-12-31 22:49:30,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75638 to 61473. [2018-12-31 22:49:30,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61473 states. [2018-12-31 22:49:30,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61473 states to 61473 states and 215184 transitions. [2018-12-31 22:49:30,678 INFO L78 Accepts]: Start accepts. Automaton has 61473 states and 215184 transitions. Word has length 54 [2018-12-31 22:49:30,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 22:49:30,679 INFO L480 AbstractCegarLoop]: Abstraction has 61473 states and 215184 transitions. [2018-12-31 22:49:30,679 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-31 22:49:30,679 INFO L276 IsEmpty]: Start isEmpty. Operand 61473 states and 215184 transitions. [2018-12-31 22:49:30,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-12-31 22:49:30,695 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 22:49:30,695 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 22:49:30,696 INFO L423 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 22:49:30,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 22:49:30,696 INFO L82 PathProgramCache]: Analyzing trace with hash 1470161047, now seen corresponding path program 1 times [2018-12-31 22:49:30,696 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 22:49:30,696 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 22:49:30,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:49:30,698 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 22:49:30,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:49:30,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 22:49:30,843 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 22:49:30,843 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 22:49:30,843 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 22:49:30,844 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-31 22:49:30,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-31 22:49:30,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-31 22:49:30,844 INFO L87 Difference]: Start difference. First operand 61473 states and 215184 transitions. Second operand 4 states. [2018-12-31 22:49:30,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 22:49:30,917 INFO L93 Difference]: Finished difference Result 13778 states and 43274 transitions. [2018-12-31 22:49:30,917 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-31 22:49:30,918 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 54 [2018-12-31 22:49:30,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 22:49:30,939 INFO L225 Difference]: With dead ends: 13778 [2018-12-31 22:49:30,939 INFO L226 Difference]: Without dead ends: 12161 [2018-12-31 22:49:30,940 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-31 22:49:30,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12161 states. [2018-12-31 22:49:31,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12161 to 12113. [2018-12-31 22:49:31,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12113 states. [2018-12-31 22:49:31,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12113 states to 12113 states and 37958 transitions. [2018-12-31 22:49:31,127 INFO L78 Accepts]: Start accepts. Automaton has 12113 states and 37958 transitions. Word has length 54 [2018-12-31 22:49:31,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 22:49:31,128 INFO L480 AbstractCegarLoop]: Abstraction has 12113 states and 37958 transitions. [2018-12-31 22:49:31,128 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-31 22:49:31,128 INFO L276 IsEmpty]: Start isEmpty. Operand 12113 states and 37958 transitions. [2018-12-31 22:49:31,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-12-31 22:49:31,135 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 22:49:31,135 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 22:49:31,135 INFO L423 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 22:49:31,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 22:49:31,136 INFO L82 PathProgramCache]: Analyzing trace with hash 2067258406, now seen corresponding path program 1 times [2018-12-31 22:49:31,136 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 22:49:31,136 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 22:49:31,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:49:31,138 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 22:49:31,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:49:31,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 22:49:31,344 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 22:49:31,344 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 22:49:31,344 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 22:49:31,345 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-31 22:49:31,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-31 22:49:31,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-31 22:49:31,345 INFO L87 Difference]: Start difference. First operand 12113 states and 37958 transitions. Second operand 4 states. [2018-12-31 22:49:31,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 22:49:31,590 INFO L93 Difference]: Finished difference Result 14276 states and 44581 transitions. [2018-12-31 22:49:31,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-31 22:49:31,591 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 64 [2018-12-31 22:49:31,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 22:49:31,619 INFO L225 Difference]: With dead ends: 14276 [2018-12-31 22:49:31,619 INFO L226 Difference]: Without dead ends: 14276 [2018-12-31 22:49:31,619 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-31 22:49:31,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14276 states. [2018-12-31 22:49:31,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14276 to 12844. [2018-12-31 22:49:31,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12844 states. [2018-12-31 22:49:31,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12844 states to 12844 states and 40183 transitions. [2018-12-31 22:49:31,829 INFO L78 Accepts]: Start accepts. Automaton has 12844 states and 40183 transitions. Word has length 64 [2018-12-31 22:49:31,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 22:49:31,829 INFO L480 AbstractCegarLoop]: Abstraction has 12844 states and 40183 transitions. [2018-12-31 22:49:31,829 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-31 22:49:31,829 INFO L276 IsEmpty]: Start isEmpty. Operand 12844 states and 40183 transitions. [2018-12-31 22:49:31,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-12-31 22:49:31,837 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 22:49:31,837 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 22:49:31,837 INFO L423 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 22:49:31,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 22:49:31,837 INFO L82 PathProgramCache]: Analyzing trace with hash -484898555, now seen corresponding path program 1 times [2018-12-31 22:49:31,838 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 22:49:31,838 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 22:49:31,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:49:31,840 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 22:49:31,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:49:31,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 22:49:32,223 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 22:49:32,223 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 22:49:32,223 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-31 22:49:32,223 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-31 22:49:32,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-31 22:49:32,224 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-31 22:49:32,224 INFO L87 Difference]: Start difference. First operand 12844 states and 40183 transitions. Second operand 6 states. [2018-12-31 22:49:32,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 22:49:32,985 INFO L93 Difference]: Finished difference Result 23411 states and 72792 transitions. [2018-12-31 22:49:32,986 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-31 22:49:32,986 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 64 [2018-12-31 22:49:32,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 22:49:33,028 INFO L225 Difference]: With dead ends: 23411 [2018-12-31 22:49:33,029 INFO L226 Difference]: Without dead ends: 23347 [2018-12-31 22:49:33,029 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2018-12-31 22:49:33,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23347 states. [2018-12-31 22:49:33,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23347 to 13813. [2018-12-31 22:49:33,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13813 states. [2018-12-31 22:49:33,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13813 states to 13813 states and 42967 transitions. [2018-12-31 22:49:33,294 INFO L78 Accepts]: Start accepts. Automaton has 13813 states and 42967 transitions. Word has length 64 [2018-12-31 22:49:33,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 22:49:33,294 INFO L480 AbstractCegarLoop]: Abstraction has 13813 states and 42967 transitions. [2018-12-31 22:49:33,295 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-31 22:49:33,295 INFO L276 IsEmpty]: Start isEmpty. Operand 13813 states and 42967 transitions. [2018-12-31 22:49:33,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-12-31 22:49:33,304 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 22:49:33,304 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 22:49:33,305 INFO L423 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 22:49:33,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 22:49:33,306 INFO L82 PathProgramCache]: Analyzing trace with hash 708445986, now seen corresponding path program 1 times [2018-12-31 22:49:33,306 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 22:49:33,306 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 22:49:33,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:49:33,309 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 22:49:33,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:49:33,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 22:49:33,461 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 22:49:33,462 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 22:49:33,462 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 22:49:33,462 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-31 22:49:33,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-31 22:49:33,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-31 22:49:33,463 INFO L87 Difference]: Start difference. First operand 13813 states and 42967 transitions. Second operand 4 states. [2018-12-31 22:49:34,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 22:49:34,740 INFO L93 Difference]: Finished difference Result 20043 states and 60866 transitions. [2018-12-31 22:49:34,741 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-31 22:49:34,741 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2018-12-31 22:49:34,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 22:49:34,776 INFO L225 Difference]: With dead ends: 20043 [2018-12-31 22:49:34,776 INFO L226 Difference]: Without dead ends: 19971 [2018-12-31 22:49:34,777 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-12-31 22:49:34,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19971 states. [2018-12-31 22:49:35,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19971 to 15684. [2018-12-31 22:49:35,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15684 states. [2018-12-31 22:49:35,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15684 states to 15684 states and 48127 transitions. [2018-12-31 22:49:35,037 INFO L78 Accepts]: Start accepts. Automaton has 15684 states and 48127 transitions. Word has length 66 [2018-12-31 22:49:35,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 22:49:35,037 INFO L480 AbstractCegarLoop]: Abstraction has 15684 states and 48127 transitions. [2018-12-31 22:49:35,037 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-31 22:49:35,037 INFO L276 IsEmpty]: Start isEmpty. Operand 15684 states and 48127 transitions. [2018-12-31 22:49:35,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-12-31 22:49:35,049 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 22:49:35,049 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-31 22:49:35,050 INFO L423 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 22:49:35,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 22:49:35,050 INFO L82 PathProgramCache]: Analyzing trace with hash 497095073, now seen corresponding path program 1 times [2018-12-31 22:49:35,050 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 22:49:35,050 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 22:49:35,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:49:35,052 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 22:49:35,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:49:35,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 22:49:35,322 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 22:49:35,323 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 22:49:35,323 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 22:49:35,324 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-31 22:49:35,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-31 22:49:35,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-31 22:49:35,324 INFO L87 Difference]: Start difference. First operand 15684 states and 48127 transitions. Second operand 4 states. [2018-12-31 22:49:35,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 22:49:35,939 INFO L93 Difference]: Finished difference Result 19514 states and 59136 transitions. [2018-12-31 22:49:35,940 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-31 22:49:35,940 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2018-12-31 22:49:35,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 22:49:35,974 INFO L225 Difference]: With dead ends: 19514 [2018-12-31 22:49:35,975 INFO L226 Difference]: Without dead ends: 19514 [2018-12-31 22:49:35,975 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-12-31 22:49:36,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19514 states. [2018-12-31 22:49:37,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19514 to 15967. [2018-12-31 22:49:37,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15967 states. [2018-12-31 22:49:37,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15967 states to 15967 states and 48937 transitions. [2018-12-31 22:49:37,601 INFO L78 Accepts]: Start accepts. Automaton has 15967 states and 48937 transitions. Word has length 66 [2018-12-31 22:49:37,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 22:49:37,601 INFO L480 AbstractCegarLoop]: Abstraction has 15967 states and 48937 transitions. [2018-12-31 22:49:37,601 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-31 22:49:37,601 INFO L276 IsEmpty]: Start isEmpty. Operand 15967 states and 48937 transitions. [2018-12-31 22:49:37,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-12-31 22:49:37,616 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 22:49:37,616 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 22:49:37,616 INFO L423 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 22:49:37,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 22:49:37,618 INFO L82 PathProgramCache]: Analyzing trace with hash -1580114270, now seen corresponding path program 1 times [2018-12-31 22:49:37,618 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 22:49:37,618 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 22:49:37,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:49:37,620 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 22:49:37,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:49:37,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 22:49:37,752 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 22:49:37,752 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 22:49:37,752 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-31 22:49:37,753 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 22:49:37,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 22:49:37,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 22:49:37,753 INFO L87 Difference]: Start difference. First operand 15967 states and 48937 transitions. Second operand 3 states. [2018-12-31 22:49:38,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 22:49:38,033 INFO L93 Difference]: Finished difference Result 16435 states and 50215 transitions. [2018-12-31 22:49:38,034 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 22:49:38,034 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2018-12-31 22:49:38,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 22:49:38,063 INFO L225 Difference]: With dead ends: 16435 [2018-12-31 22:49:38,064 INFO L226 Difference]: Without dead ends: 16435 [2018-12-31 22:49:38,064 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 22:49:38,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16435 states. [2018-12-31 22:49:38,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16435 to 16201. [2018-12-31 22:49:38,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16201 states. [2018-12-31 22:49:38,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16201 states to 16201 states and 49549 transitions. [2018-12-31 22:49:38,315 INFO L78 Accepts]: Start accepts. Automaton has 16201 states and 49549 transitions. Word has length 66 [2018-12-31 22:49:38,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 22:49:38,315 INFO L480 AbstractCegarLoop]: Abstraction has 16201 states and 49549 transitions. [2018-12-31 22:49:38,315 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 22:49:38,316 INFO L276 IsEmpty]: Start isEmpty. Operand 16201 states and 49549 transitions. [2018-12-31 22:49:38,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-12-31 22:49:38,333 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 22:49:38,333 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 22:49:38,333 INFO L423 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 22:49:38,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 22:49:38,333 INFO L82 PathProgramCache]: Analyzing trace with hash -1496622296, now seen corresponding path program 1 times [2018-12-31 22:49:38,334 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 22:49:38,336 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 22:49:38,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:49:38,338 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 22:49:38,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:49:38,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 22:49:38,521 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 22:49:38,522 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 22:49:38,522 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-31 22:49:38,522 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-31 22:49:38,522 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-31 22:49:38,522 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-31 22:49:38,523 INFO L87 Difference]: Start difference. First operand 16201 states and 49549 transitions. Second operand 6 states. [2018-12-31 22:49:39,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 22:49:39,420 INFO L93 Difference]: Finished difference Result 19533 states and 58786 transitions. [2018-12-31 22:49:39,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-31 22:49:39,421 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 68 [2018-12-31 22:49:39,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 22:49:39,459 INFO L225 Difference]: With dead ends: 19533 [2018-12-31 22:49:39,459 INFO L226 Difference]: Without dead ends: 19533 [2018-12-31 22:49:39,460 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-12-31 22:49:39,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19533 states. [2018-12-31 22:49:39,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19533 to 18145. [2018-12-31 22:49:39,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18145 states. [2018-12-31 22:49:39,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18145 states to 18145 states and 54956 transitions. [2018-12-31 22:49:39,723 INFO L78 Accepts]: Start accepts. Automaton has 18145 states and 54956 transitions. Word has length 68 [2018-12-31 22:49:39,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 22:49:39,724 INFO L480 AbstractCegarLoop]: Abstraction has 18145 states and 54956 transitions. [2018-12-31 22:49:39,724 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-31 22:49:39,724 INFO L276 IsEmpty]: Start isEmpty. Operand 18145 states and 54956 transitions. [2018-12-31 22:49:39,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-12-31 22:49:39,739 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 22:49:39,739 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 22:49:39,739 INFO L423 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 22:49:39,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 22:49:39,739 INFO L82 PathProgramCache]: Analyzing trace with hash 721135657, now seen corresponding path program 1 times [2018-12-31 22:49:39,739 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 22:49:39,740 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 22:49:39,741 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:49:39,741 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 22:49:39,741 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:49:39,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 22:49:39,947 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 22:49:39,947 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 22:49:39,948 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-31 22:49:39,948 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-31 22:49:39,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-31 22:49:39,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-31 22:49:39,948 INFO L87 Difference]: Start difference. First operand 18145 states and 54956 transitions. Second operand 6 states. [2018-12-31 22:49:40,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 22:49:40,469 INFO L93 Difference]: Finished difference Result 19926 states and 59453 transitions. [2018-12-31 22:49:40,469 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-31 22:49:40,470 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 68 [2018-12-31 22:49:40,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 22:49:40,504 INFO L225 Difference]: With dead ends: 19926 [2018-12-31 22:49:40,505 INFO L226 Difference]: Without dead ends: 19926 [2018-12-31 22:49:40,505 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2018-12-31 22:49:40,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19926 states. [2018-12-31 22:49:40,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19926 to 18237. [2018-12-31 22:49:40,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18237 states. [2018-12-31 22:49:40,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18237 states to 18237 states and 54811 transitions. [2018-12-31 22:49:40,788 INFO L78 Accepts]: Start accepts. Automaton has 18237 states and 54811 transitions. Word has length 68 [2018-12-31 22:49:40,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 22:49:40,788 INFO L480 AbstractCegarLoop]: Abstraction has 18237 states and 54811 transitions. [2018-12-31 22:49:40,788 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-31 22:49:40,788 INFO L276 IsEmpty]: Start isEmpty. Operand 18237 states and 54811 transitions. [2018-12-31 22:49:40,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-12-31 22:49:40,802 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 22:49:40,802 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 22:49:40,802 INFO L423 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 22:49:40,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 22:49:40,803 INFO L82 PathProgramCache]: Analyzing trace with hash 932486570, now seen corresponding path program 1 times [2018-12-31 22:49:40,803 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 22:49:40,803 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 22:49:40,805 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:49:40,805 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 22:49:40,805 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:49:40,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 22:49:40,954 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 22:49:40,954 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 22:49:40,954 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-31 22:49:40,954 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 22:49:40,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 22:49:40,956 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-31 22:49:40,956 INFO L87 Difference]: Start difference. First operand 18237 states and 54811 transitions. Second operand 5 states. [2018-12-31 22:49:41,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 22:49:41,335 INFO L93 Difference]: Finished difference Result 22525 states and 67154 transitions. [2018-12-31 22:49:41,336 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-31 22:49:41,336 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 68 [2018-12-31 22:49:41,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 22:49:41,377 INFO L225 Difference]: With dead ends: 22525 [2018-12-31 22:49:41,377 INFO L226 Difference]: Without dead ends: 22525 [2018-12-31 22:49:41,377 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-12-31 22:49:41,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22525 states. [2018-12-31 22:49:41,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22525 to 19323. [2018-12-31 22:49:41,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19323 states. [2018-12-31 22:49:41,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19323 states to 19323 states and 57570 transitions. [2018-12-31 22:49:41,691 INFO L78 Accepts]: Start accepts. Automaton has 19323 states and 57570 transitions. Word has length 68 [2018-12-31 22:49:41,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 22:49:41,691 INFO L480 AbstractCegarLoop]: Abstraction has 19323 states and 57570 transitions. [2018-12-31 22:49:41,691 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 22:49:41,691 INFO L276 IsEmpty]: Start isEmpty. Operand 19323 states and 57570 transitions. [2018-12-31 22:49:41,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-12-31 22:49:41,705 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 22:49:41,706 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 22:49:41,706 INFO L423 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 22:49:41,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 22:49:41,706 INFO L82 PathProgramCache]: Analyzing trace with hash 421952393, now seen corresponding path program 1 times [2018-12-31 22:49:41,706 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 22:49:41,707 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 22:49:41,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:49:41,709 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 22:49:41,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:49:41,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 22:49:41,924 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 22:49:41,924 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 22:49:41,924 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-31 22:49:41,924 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 22:49:41,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 22:49:41,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-31 22:49:41,925 INFO L87 Difference]: Start difference. First operand 19323 states and 57570 transitions. Second operand 5 states. [2018-12-31 22:49:42,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 22:49:42,455 INFO L93 Difference]: Finished difference Result 27944 states and 82376 transitions. [2018-12-31 22:49:42,456 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-31 22:49:42,456 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 68 [2018-12-31 22:49:42,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 22:49:42,505 INFO L225 Difference]: With dead ends: 27944 [2018-12-31 22:49:42,505 INFO L226 Difference]: Without dead ends: 27944 [2018-12-31 22:49:42,505 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-12-31 22:49:42,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27944 states. [2018-12-31 22:49:42,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27944 to 22126. [2018-12-31 22:49:42,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22126 states. [2018-12-31 22:49:42,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22126 states to 22126 states and 65535 transitions. [2018-12-31 22:49:42,876 INFO L78 Accepts]: Start accepts. Automaton has 22126 states and 65535 transitions. Word has length 68 [2018-12-31 22:49:42,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 22:49:42,876 INFO L480 AbstractCegarLoop]: Abstraction has 22126 states and 65535 transitions. [2018-12-31 22:49:42,876 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 22:49:42,876 INFO L276 IsEmpty]: Start isEmpty. Operand 22126 states and 65535 transitions. [2018-12-31 22:49:42,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-12-31 22:49:42,894 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 22:49:42,895 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 22:49:42,895 INFO L423 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 22:49:42,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 22:49:42,895 INFO L82 PathProgramCache]: Analyzing trace with hash -1385502070, now seen corresponding path program 1 times [2018-12-31 22:49:42,895 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 22:49:42,895 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 22:49:42,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:49:42,899 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 22:49:42,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:49:42,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 22:49:43,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-12-31 22:49:43,483 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 22:49:43,483 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-31 22:49:43,483 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-31 22:49:43,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-31 22:49:43,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-31 22:49:43,484 INFO L87 Difference]: Start difference. First operand 22126 states and 65535 transitions. Second operand 6 states. [2018-12-31 22:49:44,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 22:49:44,765 INFO L93 Difference]: Finished difference Result 35126 states and 103809 transitions. [2018-12-31 22:49:44,766 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-31 22:49:44,766 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 68 [2018-12-31 22:49:44,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 22:49:44,825 INFO L225 Difference]: With dead ends: 35126 [2018-12-31 22:49:44,825 INFO L226 Difference]: Without dead ends: 35126 [2018-12-31 22:49:44,825 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-12-31 22:49:44,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35126 states. [2018-12-31 22:49:45,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35126 to 27938. [2018-12-31 22:49:45,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27938 states. [2018-12-31 22:49:45,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27938 states to 27938 states and 83546 transitions. [2018-12-31 22:49:45,573 INFO L78 Accepts]: Start accepts. Automaton has 27938 states and 83546 transitions. Word has length 68 [2018-12-31 22:49:45,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 22:49:45,573 INFO L480 AbstractCegarLoop]: Abstraction has 27938 states and 83546 transitions. [2018-12-31 22:49:45,573 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-31 22:49:45,573 INFO L276 IsEmpty]: Start isEmpty. Operand 27938 states and 83546 transitions. [2018-12-31 22:49:45,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-12-31 22:49:45,597 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 22:49:45,598 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 22:49:45,598 INFO L423 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 22:49:45,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 22:49:45,598 INFO L82 PathProgramCache]: Analyzing trace with hash -497998389, now seen corresponding path program 1 times [2018-12-31 22:49:45,598 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 22:49:45,599 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 22:49:45,602 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:49:45,603 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 22:49:45,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:49:45,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 22:49:45,853 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 22:49:45,854 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 22:49:45,854 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 22:49:45,854 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-31 22:49:45,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-31 22:49:45,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-31 22:49:45,855 INFO L87 Difference]: Start difference. First operand 27938 states and 83546 transitions. Second operand 4 states. [2018-12-31 22:49:46,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 22:49:46,549 INFO L93 Difference]: Finished difference Result 30414 states and 90227 transitions. [2018-12-31 22:49:46,550 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-31 22:49:46,550 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 68 [2018-12-31 22:49:46,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 22:49:46,599 INFO L225 Difference]: With dead ends: 30414 [2018-12-31 22:49:46,599 INFO L226 Difference]: Without dead ends: 29906 [2018-12-31 22:49:46,600 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-31 22:49:46,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29906 states. [2018-12-31 22:49:46,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29906 to 27610. [2018-12-31 22:49:46,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27610 states. [2018-12-31 22:49:47,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27610 states to 27610 states and 82079 transitions. [2018-12-31 22:49:47,027 INFO L78 Accepts]: Start accepts. Automaton has 27610 states and 82079 transitions. Word has length 68 [2018-12-31 22:49:47,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 22:49:47,027 INFO L480 AbstractCegarLoop]: Abstraction has 27610 states and 82079 transitions. [2018-12-31 22:49:47,027 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-31 22:49:47,027 INFO L276 IsEmpty]: Start isEmpty. Operand 27610 states and 82079 transitions. [2018-12-31 22:49:47,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-12-31 22:49:47,046 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 22:49:47,046 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 22:49:47,047 INFO L423 AbstractCegarLoop]: === Iteration 21 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 22:49:47,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 22:49:47,047 INFO L82 PathProgramCache]: Analyzing trace with hash 1112513867, now seen corresponding path program 1 times [2018-12-31 22:49:47,047 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 22:49:47,047 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 22:49:47,049 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:49:47,049 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 22:49:47,049 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:49:47,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 22:49:47,247 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 22:49:47,247 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 22:49:47,247 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-31 22:49:47,247 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-31 22:49:47,249 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-31 22:49:47,249 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-12-31 22:49:47,249 INFO L87 Difference]: Start difference. First operand 27610 states and 82079 transitions. Second operand 9 states. [2018-12-31 22:49:49,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 22:49:49,389 INFO L93 Difference]: Finished difference Result 34850 states and 102928 transitions. [2018-12-31 22:49:49,390 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-31 22:49:49,390 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 68 [2018-12-31 22:49:49,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 22:49:49,453 INFO L225 Difference]: With dead ends: 34850 [2018-12-31 22:49:49,453 INFO L226 Difference]: Without dead ends: 34850 [2018-12-31 22:49:49,453 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2018-12-31 22:49:49,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34850 states. [2018-12-31 22:49:49,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34850 to 29288. [2018-12-31 22:49:49,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29288 states. [2018-12-31 22:49:49,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29288 states to 29288 states and 87100 transitions. [2018-12-31 22:49:49,908 INFO L78 Accepts]: Start accepts. Automaton has 29288 states and 87100 transitions. Word has length 68 [2018-12-31 22:49:49,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 22:49:49,908 INFO L480 AbstractCegarLoop]: Abstraction has 29288 states and 87100 transitions. [2018-12-31 22:49:49,908 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-31 22:49:49,908 INFO L276 IsEmpty]: Start isEmpty. Operand 29288 states and 87100 transitions. [2018-12-31 22:49:49,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-12-31 22:49:49,926 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 22:49:49,926 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 22:49:49,926 INFO L423 AbstractCegarLoop]: === Iteration 22 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 22:49:49,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 22:49:49,927 INFO L82 PathProgramCache]: Analyzing trace with hash 2000017548, now seen corresponding path program 1 times [2018-12-31 22:49:49,927 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 22:49:49,927 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 22:49:49,928 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:49:49,930 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 22:49:49,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:49:49,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 22:49:50,026 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 22:49:50,027 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 22:49:50,027 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-31 22:49:50,027 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 22:49:50,027 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 22:49:50,027 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-31 22:49:50,028 INFO L87 Difference]: Start difference. First operand 29288 states and 87100 transitions. Second operand 5 states. [2018-12-31 22:49:50,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 22:49:50,088 INFO L93 Difference]: Finished difference Result 7664 states and 18502 transitions. [2018-12-31 22:49:50,089 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-31 22:49:50,089 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 68 [2018-12-31 22:49:50,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 22:49:50,096 INFO L225 Difference]: With dead ends: 7664 [2018-12-31 22:49:50,096 INFO L226 Difference]: Without dead ends: 5913 [2018-12-31 22:49:50,097 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-12-31 22:49:50,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5913 states. [2018-12-31 22:49:50,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5913 to 4971. [2018-12-31 22:49:50,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4971 states. [2018-12-31 22:49:50,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4971 states to 4971 states and 11771 transitions. [2018-12-31 22:49:50,151 INFO L78 Accepts]: Start accepts. Automaton has 4971 states and 11771 transitions. Word has length 68 [2018-12-31 22:49:50,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 22:49:50,151 INFO L480 AbstractCegarLoop]: Abstraction has 4971 states and 11771 transitions. [2018-12-31 22:49:50,151 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 22:49:50,151 INFO L276 IsEmpty]: Start isEmpty. Operand 4971 states and 11771 transitions. [2018-12-31 22:49:50,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-12-31 22:49:50,157 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 22:49:50,157 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 22:49:50,158 INFO L423 AbstractCegarLoop]: === Iteration 23 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 22:49:50,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 22:49:50,158 INFO L82 PathProgramCache]: Analyzing trace with hash 1506475877, now seen corresponding path program 1 times [2018-12-31 22:49:50,158 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 22:49:50,158 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 22:49:50,160 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:49:50,160 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 22:49:50,160 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:49:50,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 22:49:50,266 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 22:49:50,267 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 22:49:50,267 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-31 22:49:50,267 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 22:49:50,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 22:49:50,267 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-31 22:49:50,269 INFO L87 Difference]: Start difference. First operand 4971 states and 11771 transitions. Second operand 5 states. [2018-12-31 22:49:50,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 22:49:50,605 INFO L93 Difference]: Finished difference Result 6177 states and 14425 transitions. [2018-12-31 22:49:50,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-31 22:49:50,607 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 83 [2018-12-31 22:49:50,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 22:49:50,614 INFO L225 Difference]: With dead ends: 6177 [2018-12-31 22:49:50,614 INFO L226 Difference]: Without dead ends: 6143 [2018-12-31 22:49:50,615 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-31 22:49:50,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6143 states. [2018-12-31 22:49:50,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6143 to 5262. [2018-12-31 22:49:50,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5262 states. [2018-12-31 22:49:50,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5262 states to 5262 states and 12356 transitions. [2018-12-31 22:49:50,674 INFO L78 Accepts]: Start accepts. Automaton has 5262 states and 12356 transitions. Word has length 83 [2018-12-31 22:49:50,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 22:49:50,675 INFO L480 AbstractCegarLoop]: Abstraction has 5262 states and 12356 transitions. [2018-12-31 22:49:50,675 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 22:49:50,675 INFO L276 IsEmpty]: Start isEmpty. Operand 5262 states and 12356 transitions. [2018-12-31 22:49:50,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-12-31 22:49:50,681 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 22:49:50,681 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 22:49:50,681 INFO L423 AbstractCegarLoop]: === Iteration 24 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 22:49:50,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 22:49:50,681 INFO L82 PathProgramCache]: Analyzing trace with hash 1808148118, now seen corresponding path program 1 times [2018-12-31 22:49:50,682 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 22:49:50,682 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 22:49:50,683 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:49:50,683 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 22:49:50,683 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:49:50,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 22:49:50,836 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 22:49:50,836 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 22:49:50,836 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-31 22:49:50,836 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-31 22:49:50,837 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-31 22:49:50,837 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-31 22:49:50,837 INFO L87 Difference]: Start difference. First operand 5262 states and 12356 transitions. Second operand 6 states. [2018-12-31 22:49:51,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 22:49:51,196 INFO L93 Difference]: Finished difference Result 7071 states and 16571 transitions. [2018-12-31 22:49:51,197 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-31 22:49:51,198 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 83 [2018-12-31 22:49:51,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 22:49:51,206 INFO L225 Difference]: With dead ends: 7071 [2018-12-31 22:49:51,206 INFO L226 Difference]: Without dead ends: 7039 [2018-12-31 22:49:51,207 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-12-31 22:49:51,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7039 states. [2018-12-31 22:49:51,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7039 to 5567. [2018-12-31 22:49:51,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5567 states. [2018-12-31 22:49:51,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5567 states to 5567 states and 13121 transitions. [2018-12-31 22:49:51,274 INFO L78 Accepts]: Start accepts. Automaton has 5567 states and 13121 transitions. Word has length 83 [2018-12-31 22:49:51,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 22:49:51,274 INFO L480 AbstractCegarLoop]: Abstraction has 5567 states and 13121 transitions. [2018-12-31 22:49:51,274 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-31 22:49:51,274 INFO L276 IsEmpty]: Start isEmpty. Operand 5567 states and 13121 transitions. [2018-12-31 22:49:51,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-12-31 22:49:51,281 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 22:49:51,281 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 22:49:51,281 INFO L423 AbstractCegarLoop]: === Iteration 25 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 22:49:51,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 22:49:51,282 INFO L82 PathProgramCache]: Analyzing trace with hash 11196759, now seen corresponding path program 1 times [2018-12-31 22:49:51,282 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 22:49:51,282 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 22:49:51,283 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:49:51,283 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 22:49:51,283 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:49:51,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 22:49:51,881 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 22:49:51,881 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 22:49:51,881 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-31 22:49:51,881 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-31 22:49:51,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-31 22:49:51,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-12-31 22:49:51,884 INFO L87 Difference]: Start difference. First operand 5567 states and 13121 transitions. Second operand 7 states. [2018-12-31 22:49:53,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 22:49:53,135 INFO L93 Difference]: Finished difference Result 8508 states and 20474 transitions. [2018-12-31 22:49:53,136 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-31 22:49:53,136 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 83 [2018-12-31 22:49:53,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 22:49:53,148 INFO L225 Difference]: With dead ends: 8508 [2018-12-31 22:49:53,148 INFO L226 Difference]: Without dead ends: 8508 [2018-12-31 22:49:53,148 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2018-12-31 22:49:53,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8508 states. [2018-12-31 22:49:53,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8508 to 6212. [2018-12-31 22:49:53,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6212 states. [2018-12-31 22:49:53,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6212 states to 6212 states and 14765 transitions. [2018-12-31 22:49:53,232 INFO L78 Accepts]: Start accepts. Automaton has 6212 states and 14765 transitions. Word has length 83 [2018-12-31 22:49:53,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 22:49:53,233 INFO L480 AbstractCegarLoop]: Abstraction has 6212 states and 14765 transitions. [2018-12-31 22:49:53,233 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-31 22:49:53,233 INFO L276 IsEmpty]: Start isEmpty. Operand 6212 states and 14765 transitions. [2018-12-31 22:49:53,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-12-31 22:49:53,240 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 22:49:53,240 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 22:49:53,240 INFO L423 AbstractCegarLoop]: === Iteration 26 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 22:49:53,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 22:49:53,241 INFO L82 PathProgramCache]: Analyzing trace with hash 898700440, now seen corresponding path program 1 times [2018-12-31 22:49:53,241 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 22:49:53,241 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 22:49:53,242 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:49:53,243 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 22:49:53,243 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:49:53,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 22:49:53,730 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 22:49:53,731 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 22:49:53,731 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-31 22:49:53,732 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-31 22:49:53,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-31 22:49:53,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-31 22:49:53,732 INFO L87 Difference]: Start difference. First operand 6212 states and 14765 transitions. Second operand 6 states. [2018-12-31 22:49:54,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 22:49:54,321 INFO L93 Difference]: Finished difference Result 7643 states and 17929 transitions. [2018-12-31 22:49:54,323 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-31 22:49:54,323 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 83 [2018-12-31 22:49:54,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 22:49:54,334 INFO L225 Difference]: With dead ends: 7643 [2018-12-31 22:49:54,334 INFO L226 Difference]: Without dead ends: 7643 [2018-12-31 22:49:54,334 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-31 22:49:54,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7643 states. [2018-12-31 22:49:54,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7643 to 6085. [2018-12-31 22:49:54,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6085 states. [2018-12-31 22:49:54,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6085 states to 6085 states and 14405 transitions. [2018-12-31 22:49:54,412 INFO L78 Accepts]: Start accepts. Automaton has 6085 states and 14405 transitions. Word has length 83 [2018-12-31 22:49:54,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 22:49:54,413 INFO L480 AbstractCegarLoop]: Abstraction has 6085 states and 14405 transitions. [2018-12-31 22:49:54,413 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-31 22:49:54,413 INFO L276 IsEmpty]: Start isEmpty. Operand 6085 states and 14405 transitions. [2018-12-31 22:49:54,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-12-31 22:49:54,421 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 22:49:54,421 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 22:49:54,421 INFO L423 AbstractCegarLoop]: === Iteration 27 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 22:49:54,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 22:49:54,422 INFO L82 PathProgramCache]: Analyzing trace with hash -2026859530, now seen corresponding path program 1 times [2018-12-31 22:49:54,422 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 22:49:54,422 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 22:49:54,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:49:54,424 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 22:49:54,424 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:49:54,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 22:49:54,629 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 22:49:54,630 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 22:49:54,630 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-31 22:49:54,630 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-31 22:49:54,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-31 22:49:54,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-31 22:49:54,631 INFO L87 Difference]: Start difference. First operand 6085 states and 14405 transitions. Second operand 6 states. [2018-12-31 22:49:55,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 22:49:55,187 INFO L93 Difference]: Finished difference Result 5733 states and 13253 transitions. [2018-12-31 22:49:55,188 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-31 22:49:55,188 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 83 [2018-12-31 22:49:55,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 22:49:55,196 INFO L225 Difference]: With dead ends: 5733 [2018-12-31 22:49:55,196 INFO L226 Difference]: Without dead ends: 5733 [2018-12-31 22:49:55,196 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-12-31 22:49:55,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5733 states. [2018-12-31 22:49:55,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5733 to 3489. [2018-12-31 22:49:55,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3489 states. [2018-12-31 22:49:55,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3489 states to 3489 states and 8153 transitions. [2018-12-31 22:49:55,250 INFO L78 Accepts]: Start accepts. Automaton has 3489 states and 8153 transitions. Word has length 83 [2018-12-31 22:49:55,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 22:49:55,251 INFO L480 AbstractCegarLoop]: Abstraction has 3489 states and 8153 transitions. [2018-12-31 22:49:55,251 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-31 22:49:55,251 INFO L276 IsEmpty]: Start isEmpty. Operand 3489 states and 8153 transitions. [2018-12-31 22:49:55,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-12-31 22:49:55,255 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 22:49:55,255 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 22:49:55,256 INFO L423 AbstractCegarLoop]: === Iteration 28 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 22:49:55,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 22:49:55,257 INFO L82 PathProgramCache]: Analyzing trace with hash 1085951564, now seen corresponding path program 1 times [2018-12-31 22:49:55,257 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 22:49:55,257 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 22:49:55,261 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:49:55,261 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 22:49:55,261 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:49:55,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 22:49:55,411 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 22:49:55,411 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 22:49:55,411 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-31 22:49:55,411 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 22:49:55,412 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 22:49:55,412 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-31 22:49:55,412 INFO L87 Difference]: Start difference. First operand 3489 states and 8153 transitions. Second operand 5 states. [2018-12-31 22:49:55,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 22:49:55,457 INFO L93 Difference]: Finished difference Result 3489 states and 8137 transitions. [2018-12-31 22:49:55,458 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-31 22:49:55,458 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 85 [2018-12-31 22:49:55,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 22:49:55,463 INFO L225 Difference]: With dead ends: 3489 [2018-12-31 22:49:55,463 INFO L226 Difference]: Without dead ends: 3489 [2018-12-31 22:49:55,464 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-12-31 22:49:55,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3489 states. [2018-12-31 22:49:55,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3489 to 3063. [2018-12-31 22:49:55,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3063 states. [2018-12-31 22:49:55,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3063 states to 3063 states and 7125 transitions. [2018-12-31 22:49:55,502 INFO L78 Accepts]: Start accepts. Automaton has 3063 states and 7125 transitions. Word has length 85 [2018-12-31 22:49:55,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 22:49:55,503 INFO L480 AbstractCegarLoop]: Abstraction has 3063 states and 7125 transitions. [2018-12-31 22:49:55,503 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 22:49:55,503 INFO L276 IsEmpty]: Start isEmpty. Operand 3063 states and 7125 transitions. [2018-12-31 22:49:55,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-12-31 22:49:55,506 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 22:49:55,507 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 22:49:55,507 INFO L423 AbstractCegarLoop]: === Iteration 29 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 22:49:55,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 22:49:55,507 INFO L82 PathProgramCache]: Analyzing trace with hash 1973455245, now seen corresponding path program 1 times [2018-12-31 22:49:55,507 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 22:49:55,507 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 22:49:55,509 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:49:55,509 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 22:49:55,509 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:49:55,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 22:49:55,789 WARN L181 SmtUtils]: Spent 200.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2018-12-31 22:49:55,954 WARN L181 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-12-31 22:49:56,774 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 22:49:56,775 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 22:49:56,775 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-12-31 22:49:56,775 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-31 22:49:56,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-31 22:49:56,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-12-31 22:49:56,776 INFO L87 Difference]: Start difference. First operand 3063 states and 7125 transitions. Second operand 10 states. [2018-12-31 22:49:58,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 22:49:58,507 INFO L93 Difference]: Finished difference Result 5223 states and 12138 transitions. [2018-12-31 22:49:58,508 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-31 22:49:58,509 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 85 [2018-12-31 22:49:58,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 22:49:58,515 INFO L225 Difference]: With dead ends: 5223 [2018-12-31 22:49:58,515 INFO L226 Difference]: Without dead ends: 3650 [2018-12-31 22:49:58,515 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=71, Invalid=271, Unknown=0, NotChecked=0, Total=342 [2018-12-31 22:49:58,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3650 states. [2018-12-31 22:49:58,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3650 to 3140. [2018-12-31 22:49:58,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3140 states. [2018-12-31 22:49:58,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3140 states to 3140 states and 7230 transitions. [2018-12-31 22:49:58,565 INFO L78 Accepts]: Start accepts. Automaton has 3140 states and 7230 transitions. Word has length 85 [2018-12-31 22:49:58,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 22:49:58,565 INFO L480 AbstractCegarLoop]: Abstraction has 3140 states and 7230 transitions. [2018-12-31 22:49:58,565 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-31 22:49:58,566 INFO L276 IsEmpty]: Start isEmpty. Operand 3140 states and 7230 transitions. [2018-12-31 22:49:58,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-12-31 22:49:58,570 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 22:49:58,570 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 22:49:58,571 INFO L423 AbstractCegarLoop]: === Iteration 30 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 22:49:58,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 22:49:58,571 INFO L82 PathProgramCache]: Analyzing trace with hash 1532642072, now seen corresponding path program 1 times [2018-12-31 22:49:58,571 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 22:49:58,571 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 22:49:58,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:49:58,573 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 22:49:58,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:49:58,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 22:49:59,009 WARN L181 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 10 [2018-12-31 22:49:59,436 WARN L181 SmtUtils]: Spent 333.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 16 [2018-12-31 22:49:59,454 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 22:49:59,455 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 22:49:59,455 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-31 22:49:59,455 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-31 22:49:59,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-31 22:49:59,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-31 22:49:59,456 INFO L87 Difference]: Start difference. First operand 3140 states and 7230 transitions. Second operand 6 states. [2018-12-31 22:49:59,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 22:49:59,687 INFO L93 Difference]: Finished difference Result 3608 states and 8201 transitions. [2018-12-31 22:49:59,688 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-31 22:49:59,688 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 85 [2018-12-31 22:49:59,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 22:49:59,693 INFO L225 Difference]: With dead ends: 3608 [2018-12-31 22:49:59,693 INFO L226 Difference]: Without dead ends: 3554 [2018-12-31 22:49:59,694 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2018-12-31 22:49:59,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3554 states. [2018-12-31 22:49:59,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3554 to 3141. [2018-12-31 22:49:59,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3141 states. [2018-12-31 22:49:59,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3141 states to 3141 states and 7165 transitions. [2018-12-31 22:49:59,743 INFO L78 Accepts]: Start accepts. Automaton has 3141 states and 7165 transitions. Word has length 85 [2018-12-31 22:49:59,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 22:49:59,743 INFO L480 AbstractCegarLoop]: Abstraction has 3141 states and 7165 transitions. [2018-12-31 22:49:59,743 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-31 22:49:59,743 INFO L276 IsEmpty]: Start isEmpty. Operand 3141 states and 7165 transitions. [2018-12-31 22:49:59,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-12-31 22:49:59,748 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 22:49:59,748 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-31 22:49:59,748 INFO L423 AbstractCegarLoop]: === Iteration 31 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 22:49:59,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 22:49:59,749 INFO L82 PathProgramCache]: Analyzing trace with hash -544567271, now seen corresponding path program 2 times [2018-12-31 22:49:59,749 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 22:49:59,749 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 22:49:59,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:49:59,751 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 22:49:59,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:49:59,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 22:49:59,998 WARN L181 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2018-12-31 22:50:00,064 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 22:50:00,065 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 22:50:00,065 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-12-31 22:50:00,065 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-31 22:50:00,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-31 22:50:00,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-12-31 22:50:00,068 INFO L87 Difference]: Start difference. First operand 3141 states and 7165 transitions. Second operand 10 states. [2018-12-31 22:50:00,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 22:50:00,874 INFO L93 Difference]: Finished difference Result 5998 states and 13744 transitions. [2018-12-31 22:50:00,875 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-31 22:50:00,875 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 85 [2018-12-31 22:50:00,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 22:50:00,879 INFO L225 Difference]: With dead ends: 5998 [2018-12-31 22:50:00,880 INFO L226 Difference]: Without dead ends: 2311 [2018-12-31 22:50:00,880 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=84, Invalid=222, Unknown=0, NotChecked=0, Total=306 [2018-12-31 22:50:00,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2311 states. [2018-12-31 22:50:00,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2311 to 2311. [2018-12-31 22:50:00,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2311 states. [2018-12-31 22:50:00,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2311 states to 2311 states and 5296 transitions. [2018-12-31 22:50:00,912 INFO L78 Accepts]: Start accepts. Automaton has 2311 states and 5296 transitions. Word has length 85 [2018-12-31 22:50:00,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 22:50:00,912 INFO L480 AbstractCegarLoop]: Abstraction has 2311 states and 5296 transitions. [2018-12-31 22:50:00,912 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-31 22:50:00,913 INFO L276 IsEmpty]: Start isEmpty. Operand 2311 states and 5296 transitions. [2018-12-31 22:50:00,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-12-31 22:50:00,917 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 22:50:00,917 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 22:50:00,917 INFO L423 AbstractCegarLoop]: === Iteration 32 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 22:50:00,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 22:50:00,918 INFO L82 PathProgramCache]: Analyzing trace with hash -1942685255, now seen corresponding path program 3 times [2018-12-31 22:50:00,918 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 22:50:00,918 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 22:50:00,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:50:00,920 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-31 22:50:00,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:50:00,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 22:50:01,148 WARN L181 SmtUtils]: Spent 152.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2018-12-31 22:50:01,251 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 22:50:01,252 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 22:50:01,252 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-12-31 22:50:01,253 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-31 22:50:01,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-31 22:50:01,253 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-12-31 22:50:01,255 INFO L87 Difference]: Start difference. First operand 2311 states and 5296 transitions. Second operand 11 states. [2018-12-31 22:50:02,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 22:50:02,322 INFO L93 Difference]: Finished difference Result 3845 states and 8830 transitions. [2018-12-31 22:50:02,324 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-31 22:50:02,324 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 85 [2018-12-31 22:50:02,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 22:50:02,328 INFO L225 Difference]: With dead ends: 3845 [2018-12-31 22:50:02,328 INFO L226 Difference]: Without dead ends: 2506 [2018-12-31 22:50:02,329 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=70, Invalid=310, Unknown=0, NotChecked=0, Total=380 [2018-12-31 22:50:02,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2506 states. [2018-12-31 22:50:02,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2506 to 2305. [2018-12-31 22:50:02,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2305 states. [2018-12-31 22:50:02,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2305 states to 2305 states and 5280 transitions. [2018-12-31 22:50:02,356 INFO L78 Accepts]: Start accepts. Automaton has 2305 states and 5280 transitions. Word has length 85 [2018-12-31 22:50:02,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 22:50:02,357 INFO L480 AbstractCegarLoop]: Abstraction has 2305 states and 5280 transitions. [2018-12-31 22:50:02,357 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-31 22:50:02,357 INFO L276 IsEmpty]: Start isEmpty. Operand 2305 states and 5280 transitions. [2018-12-31 22:50:02,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-12-31 22:50:02,360 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 22:50:02,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-31 22:50:02,361 INFO L423 AbstractCegarLoop]: === Iteration 33 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 22:50:02,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 22:50:02,361 INFO L82 PathProgramCache]: Analyzing trace with hash -1542877223, now seen corresponding path program 4 times [2018-12-31 22:50:02,361 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 22:50:02,361 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 22:50:02,363 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:50:02,363 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-31 22:50:02,363 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:50:02,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-31 22:50:02,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-31 22:50:02,493 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-31 22:50:02,673 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-12-31 22:50:02,677 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.12 10:50:02 BasicIcfg [2018-12-31 22:50:02,677 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-31 22:50:02,678 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-31 22:50:02,678 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-31 22:50:02,678 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-31 22:50:02,683 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 10:49:03" (3/4) ... [2018-12-31 22:50:02,687 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-31 22:50:02,861 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2018-12-31 22:50:02,865 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-31 22:50:02,866 INFO L168 Benchmark]: Toolchain (without parser) took 61725.86 ms. Allocated memory was 1.0 GB in the beginning and 4.7 GB in the end (delta: 3.6 GB). Free memory was 951.4 MB in the beginning and 1.6 GB in the end (delta: -674.4 MB). Peak memory consumption was 3.0 GB. Max. memory is 11.5 GB. [2018-12-31 22:50:02,867 INFO L168 Benchmark]: CDTParser took 0.18 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-12-31 22:50:02,867 INFO L168 Benchmark]: CACSL2BoogieTranslator took 808.31 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.7 MB). Free memory was 946.0 MB in the beginning and 1.1 GB in the end (delta: -162.5 MB). Peak memory consumption was 25.8 MB. Max. memory is 11.5 GB. [2018-12-31 22:50:02,868 INFO L168 Benchmark]: Boogie Procedure Inliner took 68.58 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: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2018-12-31 22:50:02,869 INFO L168 Benchmark]: Boogie Preprocessor took 59.73 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-12-31 22:50:02,869 INFO L168 Benchmark]: RCFGBuilder took 1128.98 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: 46.4 MB). Peak memory consumption was 46.4 MB. Max. memory is 11.5 GB. [2018-12-31 22:50:02,869 INFO L168 Benchmark]: TraceAbstraction took 59466.66 ms. Allocated memory was 1.2 GB in the beginning and 4.7 GB in the end (delta: 3.5 GB). Free memory was 1.1 GB in the beginning and 1.6 GB in the end (delta: -570.6 MB). Peak memory consumption was 2.9 GB. Max. memory is 11.5 GB. [2018-12-31 22:50:02,870 INFO L168 Benchmark]: Witness Printer took 186.96 ms. Allocated memory is still 4.7 GB. Free memory was 1.6 GB in the beginning and 1.6 GB in the end (delta: 24 B). Peak memory consumption was 24 B. Max. memory is 11.5 GB. [2018-12-31 22:50:02,873 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.18 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 808.31 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.7 MB). Free memory was 946.0 MB in the beginning and 1.1 GB in the end (delta: -162.5 MB). Peak memory consumption was 25.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 68.58 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: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 59.73 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 1128.98 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: 46.4 MB). Peak memory consumption was 46.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 59466.66 ms. Allocated memory was 1.2 GB in the beginning and 4.7 GB in the end (delta: 3.5 GB). Free memory was 1.1 GB in the beginning and 1.6 GB in the end (delta: -570.6 MB). Peak memory consumption was 2.9 GB. Max. memory is 11.5 GB. * Witness Printer took 186.96 ms. Allocated memory is still 4.7 GB. Free memory was 1.6 GB in the beginning and 1.6 GB in the end (delta: 24 B). Peak memory consumption was 24 B. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L672] -1 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L674] -1 int __unbuffered_p0_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0] [L676] -1 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0] [L678] -1 int __unbuffered_p1_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0] [L679] -1 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0] [L680] -1 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L682] -1 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L684] -1 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L685] -1 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L686] -1 int y$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L687] -1 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0] [L688] -1 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0] [L689] -1 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0] [L690] -1 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0] [L691] -1 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0] [L692] -1 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0] [L693] -1 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0] [L694] -1 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}] [L695] -1 int y$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0] [L696] -1 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0] [L697] -1 int y$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0] [L698] -1 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L700] -1 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L701] -1 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L702] -1 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L778] -1 pthread_t t1661; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L779] FCALL, FORK -1 pthread_create(&t1661, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L780] -1 pthread_t t1662; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L781] FCALL, FORK -1 pthread_create(&t1662, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L736] 0 y$w_buff1 = y$w_buff0 [L737] 0 y$w_buff0 = 1 [L738] 0 y$w_buff1_used = y$w_buff0_used [L739] 0 y$w_buff0_used = (_Bool)1 [L5] COND FALSE 0 !(!expression) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L741] 0 y$r_buff1_thd0 = y$r_buff0_thd0 [L742] 0 y$r_buff1_thd1 = y$r_buff0_thd1 [L743] 0 y$r_buff1_thd2 = y$r_buff0_thd2 [L744] 0 y$r_buff0_thd2 = (_Bool)1 [L747] 0 z = 1 [L750] 0 __unbuffered_p1_EAX = z [L753] 0 __unbuffered_p1_EBX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L756] EXPR 0 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L706] 1 x = 1 [L711] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L712] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L713] 1 y$flush_delayed = weak$$choice2 [L714] 1 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=3, x=1, y=0, y$flush_delayed=3, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L715] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=3, x=1, y=0, y$flush_delayed=3, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L756] 0 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L757] EXPR 0 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used VAL [!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=3, x=1, y=1, y$flush_delayed=3, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L757] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L715] 1 y = !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L716] EXPR 1 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=3, weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0))=1, x=1, y=0, y$flush_delayed=3, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L716] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L717] EXPR 1 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=3, weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1))=0, x=1, y=0, y$flush_delayed=3, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L717] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L758] EXPR 0 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=3, x=1, y=0, y$flush_delayed=3, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L758] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L759] EXPR 0 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=3, x=1, y=0, y$flush_delayed=3, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L759] 0 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L760] EXPR 0 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=3, x=1, y=0, y$flush_delayed=3, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L760] 0 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L763] 0 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=3, x=1, y=0, y$flush_delayed=3, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L718] EXPR 1 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=3, weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used))=0, x=1, y=0, y$flush_delayed=3, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L718] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L719] EXPR 1 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=3, weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=3, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L719] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L720] EXPR 1 weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=3, weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1))=0, x=1, y=0, y$flush_delayed=3, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L720] 1 y$r_buff0_thd1 = weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) [L721] EXPR 1 weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=3, weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=3, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L721] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L722] 1 __unbuffered_p0_EAX = y VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=3, x=1, y=0, y$flush_delayed=3, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L723] EXPR 1 y$flush_delayed ? y$mem_tmp : y VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=3, x=1, y=0, y$flush_delayed=3, y$flush_delayed ? y$mem_tmp : y=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L723] 1 y = y$flush_delayed ? y$mem_tmp : y [L724] 1 y$flush_delayed = (_Bool)0 [L729] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=3, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L783] -1 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=3, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L787] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=3, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L787] EXPR -1 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=3, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L787] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=3, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L787] -1 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L788] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=3, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L788] -1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L789] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=3, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L789] -1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L790] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=3, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L790] -1 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L791] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=3, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L791] -1 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L794] -1 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=3, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L5] COND TRUE -1 !expression VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=3, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L5] -1 __VERIFIER_error() VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=3, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 200 locations, 3 error locations. UNSAFE Result, 59.2s OverallTime, 33 OverallIterations, 1 TraceHistogramMax, 30.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 8871 SDtfs, 10311 SDslu, 20888 SDs, 0 SdLazy, 9020 SolverSat, 459 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 17.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 302 GetRequests, 81 SyntacticMatches, 17 SemanticMatches, 204 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 176 ImplicationChecksByTransitivity, 9.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=61473occurred in iteration=8, 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: 16.5s AutomataMinimizationTime, 32 MinimizatonAttempts, 165239 StatesRemovedByMinimization, 30 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 8.3s InterpolantComputationTime, 2242 NumberOfCodeBlocks, 2242 NumberOfCodeBlocksAsserted, 33 NumberOfCheckSat, 2125 ConstructedInterpolants, 0 QuantifiedInterpolants, 385524 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 32 InterpolantComputations, 32 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...